You are here

Home » Content

Solving No-Wait Two-Stage Flexible Flow Shop Scheduling Problem with Unrelated Parallel Machines and Rework Time by the Adjusted Discrete Multi Objective Invasive Weed Optimization and Fuzzy Dominance Approach

Journal Name:

  • Journal of Industrial Engineering and Management

Publication Year:

  • 2017
DOI: 
doi.org/10.3926/jiem.2348

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for better performance of the algorithm. Findings: The results of this algorithm have been compared with those of conventional, multiobjective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm.Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-solving-no-wait-two-stage-flexible-flow-shop-scheduling-problem-unrelated-parallel-machines-and-rework-time-adjusted-discrete-multi-objective-invasive-weed-optimization.pdf
  • 5
887
918
  • English

REFERENCES

References: 

Abdollahpour, S., & Rezaian, J. (2016). Two new meta-heuristics for no-wait flexible flow shop scheduling
problem with capacitated machines, mixed make-to-order and make-to-stock policy. Soft Computing, 1-19.
Aldowaisan, T. (2001). A new heuristic and dominance relations for no-wait flowshops with setups.
Computers & Operations Research, 28(6), 563-584. https://doi.org/10.1016/S0305-0548(99)00136-7
Aldowaisan, T., & Allahverdi, A. (1998). Total flowtime in no-wait flowshops with separated setup times.
Computers & Operations Research, 25(9), 757-765. https://doi.org/10.1016/S0305-0548(98)00002-1
Aldowaisan, T., & Allahverdi, A. (2004). New heuristics for m-machine no-wait flowshop to minimize
total completion time. Omega, 32(5), 345-352. https://doi.org/10.1016/j.omega.2004.01.004
Allahverdi, A., & Aldowaisan, T. (2002). No-wait flowshops with bicriteria of makespan and total
completion time. Journal of the Operational Research Society, 53(9), 1004-1015.
https://doi.org/10.1057/palgrave.jors.2601403Allahverdi, A., & Aldowaisan, T. (2004). No-wait flowshops with bicriteria of makespan and maximum
lateness. European Journal of Operational Research, 152(1), 132-147. https://doi.org/10.1016/S0377-
2217(02)00646-X
Bonney, M., & Gundry, S. (1976). Solutions to the constrained flowshop sequencing problem. Journal of
the Operational Research Society, 27(4), 869-883. https://doi.org/10.1057/jors.1976.176
Callahan, J. R. (1972). The nothing hot delay problem in the production of steel. Thesis. Department of Industrial
Engineering, University of Toronto, Canada.
Chang, J., Yan, W., & Shao, H. (2004). Scheduling a two-stage no-wait hybrid flowshop with separated
setup and removal times. Paper presented at the American Control Conference.
Davendra, D., Zelinka, I., Bialic-Davendra, M., Senkerik, R., & Jasek, R. (2013). Discrete self-organising
migrating algorithm for flow-shop scheduling with no-wait makespan. Mathematical and Computer
Modelling, 57(1), 100-110. https://doi.org/10.1016/j.mcm.2011.05.029
Elyasi, M., Jafarzadeh, H., & Khoshalhan, F. (2012). An economical order quantity model for items with
imperfect quality: A non-cooperative dynamic game theoretical model. Paper presented at the 3rd
International Logistics and Supply chain Conference.
Framinan, J. M., & Nagano, M. S. (2008). Evaluating the performance for makespan minimisation in
no-wait flowshop sequencing. Journal of materials processing technology, 197(1), 1-9.
https://doi.org/10.1016/j.jmatprotec.2007.07.039
Gao, K.-Z, Pan, Q.-k., & Li, J.-Q. (2011). Discrete harmony search algorithm for the no-wait flow shop
scheduling problem with total flow time criterion. The International Journal of Advanced Manufacturing
Technology, 56(5-8), 683-692. https://doi.org/10.1007/s00170-011-3197-6
Gerami, A., Allaire, P., & Fittro, R. (2015). Control of Magnetic Bearing With Material Saturation
Nonlinearity. Journal of Dynamic Systems, Measurement, and Control, 137(6), 061002.
https://doi.org/10.1115/1.4029125
Gilmore, P.C., & Gomory, R.E. (1964). Sequencing a one state-variable machine: A solvable case of the
traveling salesman problem. Operations Research, 12(5), 655-679. https://doi.org/10.1287/opre.12.5.655
Goyal, S., & Sriskandarajah, C. (1988). No-wait shop scheduling: computational complexity and
approximate algorithms. Opsearch, 25(4), 220-244.
Grabowski, J., & Pempera, J. (2000). Sequencing of jobs in some production system. European journal of
operational research, 125(3), 535-550. https://doi.org/10.1016/S0377-2217(99)00224-6Gupta, J.N. (1976). Optimal flowshop schedules with no intermediate storage space. Naval Research
Logistics Quarterly, 23(2), 235-243. https://doi.org/10.1002/nav.3800230206
Gupta, J.N., Strusevich, V.A., & Zwaneveld, C.M. (1997). Two-stage no-wait scheduling models with setup
and removal times separated. Computers & Operations Research, 24(11), 1025-1031.
https://doi.org/10.1016/S0305-0548(97)00018-X
Hall, N.G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and
no-wait in process. Operations research, 44(3), 510-525. https://doi.org/10.1287/opre.44.3.510
Haouari, M., Hidri, L., & Gharbi, A. (2006). Optimal scheduling of a two-stage hybrid flow shop.
Mathematical Methods of Operations Research, 64(1), 107-124. https://doi.org/10.1007/s00186-006-0066-4
Hasani, R., Jafarzadeh, H., & Khoshalhan, F. (2013). A new method for supply chain coordination with
credit option contract and customers’ backordered demand. Uncertain Supply Chain Management, 1(4),
207-218. https://doi.org/10.5267/j.uscm.2013.09.002
Hmida, A.B., Haouari, M., Huguet, M.-J., & Lopez, P. (2011). Solving two-stage hybrid flow shop using
climbing depth-bounded discrepancy search. Computers & Industrial Engineering, 60(2), 320-327.
https://doi.org/10.1016/j.cie.2010.11.015
Huang, R.-H., Yang, C.-L., & Huang, Y.-C. (2009). No-wait two-stage multiprocessor flow shop
scheduling with unit setup. The International Journal of Advanced Manufacturing Technology, 44(9-10), 921-927.
https://doi.org/10.1007/s00170-008-1865-y
Jafarzadeh, H., Gholami, S., & Bashirzadeh, R. (2014). A new effective algorithm for on-line robot
motion planning. Decision Science Letters, 3(1), 121-130. https://doi.org/10.5267/j.dsl.2013.07.004
Jafarzadeh, H., Moradinasab, N., Eskandari, H. & Gholami, S. (2017). Genetic Algorithm for A Generic
Model of Reverse Logistics Network. International Journal of Engineering Innovation & Research, 6(4),
174-178.
Jolai, F., Asefi, H., Rabiee, M., & Ramezani, P. (2013). Bi-objective simulated annealing approaches for nowait
two-stage flexible flow shop scheduling problem. Scientia Iranica, 20(3), 861-872.
Jolai, F., Sheikh, S., Rabbani, M., & Karimi, B. (2009). A genetic algorithm for solving no-wait flexible
flow lines with due window and job rejection. The International Journal of Advanced Manufacturing Technology,
42(5), 523-532. https://doi.org/10.1007/s00170-008-1618-y
Kalczynski, P.J., & Kamburowski, J. (2007). On no-wait and no-idle flow shops with makespan criterion.
European Journal of Operational Research, 178(3), 677-685. https://doi.org/10.1016/j.ejor.2006.01.036King, J., & Spachis, A. (1980). Heuristics for flow-shop scheduling. International Journal of Production
Research, 18(3), 345-357. https://doi.org/10.1080/00207548008919673
Kundu, D., Suresh, K., Ghosh, S., Das, S., Panigrahi, B.K., & Das, S. (2011). Multi-objective optimization
with artificial weed colonies. Information Sciences, 181(12), 2441-2454. https://doi.org/10.1016/j.ins.2010.09.026
Kurian, K. (1987). Scheduling of Batch Processes. PhD. Purdue University, West Lafayette, Indiana.
Kuriyan, K., & Reklaitis, G. (1985). Approximate scheduling algorithms for network flowshops. Paper
presented at the The Institute of Chemical Engineers, Symposium Series.
Levner, E. (1969). Optimal planning of parts machining on a number of machines. Automation and Remote
Control, 12, 1972-1981.
Liu, Y., & Feng, Z. (2014). Two-machine no-wait flowshop scheduling with learning effect and convex
resource-dependent processing times. Computers & Industrial Engineering, 75, 170-175.
https://doi.org/10.1016/j.cie.2014.06.017
Liu, Z., Xie, J., Li, J., & Dong, J. (2003). A heuristic for two-stage no-wait hybrid flowshop scheduling with
a single machine in either stage. Tsinghua Science and Technology, 8(1), 43-48.
Marinakis, Y., Migdalas, A., & Pardalos, P.M. (2008). Expanding neighborhood search–GRASP for the
probabilistic traveling salesman problem. Optimization Letters, 2(3), 351-361. https://doi.org/10.1007/s11590-
007-0064-3
Mehrabian, A.R., & Lucas, C. (2006). A novel numerical optimization algorithm inspired from weed
colonization. Ecological Informatics, 1(4), 355-366. https://doi.org/10.1016/j.ecoinf.2006.07.003
Moradinasab, N., Shafaei, R., Rabiee, M., & Ramezani, P. (2013). No-wait two stage hybrid flow shop
scheduling with genetic and adaptive imperialist competitive algorithms. Journal of Experimental &
Theoretical Artificial Intelligence, 25(2), 207-225. https://doi.org/10.1080/0952813X.2012.682752
Moradinasab, N., Shafaei, R., Rabiee, M., & Mazinani, M. (2012). Minimization of maximum tardiness in
a no-wait two stage flexible flow shop. International Journal of Artificial Intelligence, 8(S12), 166-181.
Pan, Q.-K., Tasgetiren, M.F., & Liang, Y.-C. (2008). A discrete particle swarm optimization algorithm for
the no-wait flowshop scheduling problem. Computers & Operations Research, 35(9), 2807-2839.
https://doi.org/10.1016/j.cor.2006.12.030Pan, Q.-K., Wang, L., & Qian, B. (2009). A novel differential evolution algorithm for bi-criteria no-wait
flow shop scheduling problems. Computers & Operations Research, 36(8), 2498-2511.
https://doi.org/10.1016/j.cor.2008.10.008
Pang, K.-W. (2013). A genetic algorithm based heuristic for two machine no-wait flowshop scheduling
problems with class setup times that minimizes maximum lateness. International Journal of Production
Economics, 141(1), 127-136. https://doi.org/10.1016/j.ijpe.2012.06.017
Papadimitriou, C.H., & Kanellakis, P.C. (1984). On concurrency control by multiple versions. ACM
Transactions on Database Systems (TODS), 9(1), 89-99. https://doi.org/10.1145/348.318588
Qian, B., Wang, L., Hu, R., Huang, D., & Wang, X. (2009). A DE-based approach to no-wait flow-shop
scheduling. Computers & Industrial Engineering, 57(3), 787-805. https://doi.org/10.1016/j.cie.2009.02.006
Raaymakers, W.H., & Hoogeveen, J. (2000). Scheduling multipurpose batch process industries with nowait
restrictions by simulated annealing. European Journal of Operational Research, 126(1), 131-151.
https://doi.org/10.1016/S0377-2217(99)00285-4
Rajendran, C. (1994). A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the
Operational Research Society, 45(4), 472-478. https://doi.org/10.1057/jors.1994.65
Ramezani, P., Rabiee, M., & Jolai, F. (2015). No-wait flexible flowshop with uniform parallel machines and
sequence-dependent setup time: a hybrid meta-heuristic approach. Journal of Intelligent Manufacturing,
26(4), 731-744. https://doi.org/10.1007/s10845-013-0830-2
Ramudhin, A., & Ratliff, H. D. (1995). Generating daily production schedules in process industries. IIE
Transactions, 27(5), 646-657.
Reddi, S., & Ramamoorthy, C. (1972). On the Flow-Shop Sequencing Problem with No Wait in Process.
Journal of the Operational Research Society, 23(3), 323-331. https://doi.org/10.1057/jors.1972.52
Salvador, M.S. (1973). A solution to a special class of flow shop scheduling problems. Paper presented at
the Symposium on the Theory of Scheduling and its Applications. https://doi.org/10.1007/978-3-642-80784-8_7
Sang, H.-Y., Duan, P.-Y., &Li, J.-Q. (2016). A Discrete Invasive Weed Optimization Algorithm for the No-
Wait Lot-Streaming Flow Shop Scheduling Problems. International Conference on Intelligent Computing.
Springer International Publishing, 2016.
Shafaei, R., Moradinasab, N., & Rabiee, M. (2011). Efficient meta heuristic algorithms to minimize mean
flow time in no-wait two stage flow shops with parallel and identical machines. International Journal ofSidney, J.B., Potts, C.N., & Sriskandarajah, C. (2000). A heuristic for scheduling two-machine no-wait flow
shops with anticipatory setups. Operations Research Letters, 26(4), 165-173. https://doi.org/10.1016/S0167-
6377(00)00019-5
Sriskandarajah, C. (1993). Performance of scheduling algorithms for no-wait flowshops with parallel
machines. European Journal of Operational Research, 70(3), 365-378. https://doi.org/10.1016/0377-
2217(93)90248-L
Sriskandarajah, C., & Ladet, P. (1986). Some no-wait shops scheduling problems: complexity aspect.
European journal of operational research, 24(3), 424-438. https://doi.org/10.1016/0377-2217(86)90036-6
Su, L.-H., & Lee, Y.-Y. (2008). The two-machine flowshop no-wait scheduling problem with a single
server to minimize the total completion time. Computers & Operations Research, 35(9), 2952-2963.
https://doi.org/10.1016/j.cor.2007.01.002
Tapkan, P., Özbakır, L., & Baykasoğlu, A. (2012). Bees algorithm for constrained fuzzy multi-objective
two-sided assembly line balancing problem. Optimization Letters, 6(6), 1039-1049.
https://doi.org/10.1007/s11590-011-0344-9
Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., & Mirzaei, A.H. (2007). A hybrid multi-objective immune
algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and
weighted mean tardiness. Information Sciences, 177(22), 5072-5090. https://doi.org/10.1016/j.ins.2007.06.001
Thornton, H.W., & Hunsucker, J.L. (2004). A new heuristic for minimal makespan in flow shops with
multiple processors and no intermediate storage. European Journal of Operational Research, 152(1), 96-114.
https://doi.org/10.1016/S0377-2217(02)00524-6
Tseng, L.-Y., & Lin, Y.-T. (2010). A hybrid genetic algorithm for no-wait flowshop scheduling problem.
International Journal of Production Economics, 128(1), 144-152. https://doi.org/10.1016/j.ijpe.2010.06.006
Van Deman, J.M., & Baker, K.R. (1974). Minimizing mean flowtime in the flow shop with no
intermediate queues. AIIE Transactions, 6(1), 28-34. https://doi.org/10.1080/05695557408974929
Wang, C., Li, X., & Wang, Q. (2010). Accelerated tabu search for no-wait flowshop scheduling problem
with maximum lateness criterion. European Journal of Operational Research, 206(1), 64-72.
https://doi.org/10.1016/j.ejor.2010.02.014
Wang, S., & Liu, M. (2013). A genetic algorithm for two-stage no-wait hybrid flow shop scheduling
problem. Computers & Operations Research, 40(4), 1064-1075. https://doi.org/10.1016/j.cor.2012.10.015Wang, Z., Xing, W., & Bai, F. (2005). No-wait flexible flowshop scheduling with no-idle machines.
Operations Research Letters, 33(6), 609-614. https://doi.org/10.1016/j.orl.2004.10.004
Wismer, D. (1972). Solution of the flowshop-scheduling problem with no intermediate queues. Operations
research, 20(3), 689-697. https://doi.org/10.1287/opre.20.3.689
Xie, J., & Wang, X. (2005). Complexity and algorithms for two-stage flexible flowshop scheduling with
availability constraints. Computers & Mathematics with Applications, 50(10), 1629-1638.
https://doi.org/10.1016/j.camwa.2005.07.008
Management Science and Engineering Management, 6(6), 421-430.

Thank you for copying data from http://www.arastirmax.com