Abstract
This article addresses the problem of hybrid flexible flow line where some constraints are considered to alleviate the chasm between the real-world industries scheduling and the production scheduling theories. Sequence-dependent setup times, machine release date and time lags are three constraints deemed to project the circumstances commonly found in real-world industries. To tackle the complexity of the problem at hand, we propose an approach base on genetic algorithm (GA). However, the performance of most evolutionary algorithms is significantly impressed by the values determined for the miscellaneous parameters which these algorithms possess. Hence, response surface methodology is applied to set the parameters of GA and to estimate the proper values of GA parameters in continually intervals. Finally, problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with some existing heuristic in the literature such as SPT, LPT and NEH.
Similar content being viewed by others
References
Andrés C., Albarracín J.M., Tormo G., Vicens E., García-Sabater J.P. (2005) Group technology in a hybrid flowshop environment: A case study. European Journal of Operational Research 167(1): 272–281. doi:10.1016/j.ejor.2004.03.026
Bertel S., Billaut J.C. (2004) A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research 159(3): 651–662. doi:10.1016/S0377-2217(03)00434-X
Botta-Genoulaz V. (2000) Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics 64(1–3): 101–111. doi:10.1016/S0925-5273(99)00048-1
Cheng B.-W., Chang C.-L. (2007) A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm. Expert Systems with Applications 32: 415–421. doi:10.1016/j.eswa.2005.12.002
Cho H.-S., Paik C.-H., Yoon H.-M., Kim H.-G. (2005) A robust design of simulated annealing approach for mixed-model sequencing. Computers & Industrial Engineering 48: 753–764. doi:10.1016/j.cie.2004.12.005
Ford F.N., Bradbard D.A., Ledbetter W.N., Cox J.F. (1987) Use of operations research in production management. Production and Inventory Management 28(3): 59–62
Gholami, M., Zandieh, M., & Alem-Tabriz, A. (2008). Scheduling hybrid flow shop with sequence-dependant setup times and machines with random breakdowns. International Journal of Advanced Manufacturing Technology. doi:10.1007/s00170-008-1577-3
Johnson S.M. (1954) Optimal two- and three-stage production schedules with setup times include. Naval Research Logistics Quarterly 1(1): 61–68. doi:10.1002/nav.3800010110
Jungwattanakit J., Reodecha M., Chaovalitwongse P., Werner F. (2009) A comparison of Scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Computers & Operations Research 36(2): 358–378
Kurz M.E., Askin R.G. (2003) Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85(3): 371–388. doi:10.1016/S0925-5273(03)00123-3
Kurz M.E., Askin R.G. (2004) Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159(1): 66–82. doi:10.1016/S0377-2217(03)00401-6
Ledbetter W.N., Cox J.F. (1977) Operations research in production management: An investigation of past and present utilization. Production and Inventory Management 18(3): 84–91
Lee C.-Y., Vairaktarakis G.L. (1994) Minimizing makespan in hybrid flow shops. Operations Research Letters 16: 149–158. doi:10.1016/0167-6377(94)90026-4
Liu C.Y., Chang S.C. (2000) Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation 16: 408–419. doi:10.1109/70.864235
Low C. (2005) Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers & Operations Research 32(8): 2013–2025. doi:10.1016/j.cor.2004.01.003
MacCarthy B.L., Liu J. (1993) Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling. International Journal of Production Research 31(1): 59–79. doi:10.1080/00207549308956713
Nawaz M., Enscore E.E. Jr., Ham I. (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA. The International Journal of Management Science 11(1): 91–95
Norman B.A., Bean J.C. (1999) A genetic algorithm method- ology for complex scheduling problems. Naval Research Logistics 46: 199–211. doi:10.1002/(SICI)1520-6750(199903)46:2<199::AID-NAV5>3.0.CO;2-L
Olhager J., Rapp B. (1995) Operational research techniques in manufacturing planning and control system. International Transactions in Operational Research 2(1): 7–13. doi:10.1111/j.1475-3995.1995.tb00003.x
Pugazhendhi S., Thiagarajan S., Rajendran C., Anantharaman N. (2004) Generating non-permutation schedules in flow line based manufacturing systems with sequence-dependent setup times of jobs: A heuristic approach. International Journal of Advanced Manufacturing Technology 23: 64–78. doi:10.1007/s00170-002-1525-6
Reisman A., Kumar A., Motwani J. (1997) Flowshop scheduling/ sequencing research: A statistical review of the literature 1952–1994. IEEE Transactions on Engineering Management 44(3): 316–329. doi:10.1109/17.618173
Ruiz R., Maroto C. (2006) A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169(3): 781–800. doi:10.1016/j.ejor.2004.06.038
Ruiz R., Sivrikay Serifoglu F., Urlings T. (2006) Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research 35(4): 1151–1175. doi:10.1016/j.cor.2006.07.014
Ruiz R., Stützle T. (2008) An iterated greedy heuristic for the sequence dependent setup times flow shop with makespan and weighted tardiness objectives. European Journal of Operational Research 187: 1143–1159. doi:10.1016/j.ejor.2006.07.029
Sawik T. (2000) Mixed integer programming for scheduling flexi- ble flow lines with limited intermediate buffers. Mathematical and Computer Modelling 31(13): 39–52
Soewnadi H., Elmaghraby S.E. (2001) Sequencing three-stage flexible flowshops with identical machines to minimize makespan. IIE Transactions 31: 985–993
Wang T.-Y., Wu K.-B. (1999) A parameter set design procedure for the simulated annealing algorithm under the computational time constraint. Computers & Operations Research 26: 665–678. doi:10.1016/S0305-0548(98)00079-3
Zandieh M., Fatemi Ghomi S.M.T., Moattar Husseini S.M. (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180: 111–127. doi:10.1016/j.amc.2005.11.136
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zandieh, M., Mozaffari, E. & Gholami, M. A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. J Intell Manuf 21, 731–743 (2010). https://doi.org/10.1007/s10845-009-0250-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-009-0250-5