Abstract
No-wait flowshops circumscribe an important class of sequencing problems in the field of production planning. For no-wait flowshops with total completion time minimization, a permutation of jobs should be find to be processed sequentially on a number of machines under the restriction that each job is processed continuously. This is a typical NP-hard combinatorial optimization problem. In this paper, a new hybrid heuristic algorithm is proposed which is based on PH1p algorithm. PH1p is modified by replacing Nawaz-Enscore-Ham (NEH) insertion operator with FL method. A composite algorithm is adopted to generate an advantageous initial seed. Based on well-known benchmarks and comparisons with some existing algorithms, simulation results demonstrate the effectiveness of the proposed hybrid algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pinedo, M.: Scheduling: theory, algorithm, and systems. Prentice-Hall, Englewood Chills (1995)
Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44(3), 510–525 (1996)
Rajendran, C.: A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 45, 472–478 (1994)
Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. European Journal of Operational Research 125, 535–550 (2000)
Raaymakers, W., Hoogeveen, J.: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research 126, 131–151 (2000)
Rajendran, C.: A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research 32, 2541–2558 (1994)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)
Van Deman, J.M., Baker, K.R.: Minimizing Mean Flow Time in the Flowshop with No Intermediate Queues. AIIE Transactions 6(1), 28–34 (1974)
Adiri, I., Pohoryles, D.: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Navel Research Logistics Quarterly 29(3), 495–504 (1982)
Van der Veen, J.A.A., Van Dal, R.: Solvable cases of the no-wait flowshop scheduling problem. Journal of the Operational Research Society 42, 971–980 (1991)
Aldowiasan, T., Allahverdi, A.: Total flowtime in no-wait flowshops with separated setup times. Computers & Operations Research 25, 757–765 (1998)
Aldowiasan, T.: A new heuristic and dominance relations for no-wait flowshops with setups. Computers & Operations Research 28, 563–584 (2000)
Allahverdi, A., Aldowaisan, T.: No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research 7, 245–264 (2000)
Rajendran, C., Chaudhuri, D.: Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics 37, 695–705 (1990)
Bonney, M.C., Gundry, S.W.: Solutions to the constrained flow-shop sequencing problem. Oper. Res. Quart. 24, 869–883 (1976)
King, J.R., Spachis, A.S.: Heuristics for flow-shop scheduling. Int. J. Prod. Res. 18, 343–357 (1980)
Bertolissi, E.: Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Materials Processing Technology 107(1-3), 459–465 (2000)
Aldowaisan, T., Allahverdi, A.: New heuristics for m-machine no-wait flowshop to minimize total completion time. OMEGA 32, 345–352 (2004)
Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA 11(1), 91–95 (1983)
Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimization in permutation flow shops. OMEGA 31(4), 311–317 (2003)
Gao, X., Li, X., Zhang, H.: A Heuristic for Total Flowtime Minimization in Flow shop Scheduling. Proceedings of Machine Learning and Cybernetics 18(21), 3656–3660 (2005)
Framinan, J.M., Leisten, R., Ruiz-Usano, R.: Comparison of heuristics for flowtime minimization in permutation flowshops. Computer & Operations Research 32, 1237–1254 (2005)
Campbell, H.G., Dudek, R.A., Simth, M.L.: A heuristic algorithm for the n-job m-machine sequencing problem. Management Science 16, B630–B637 (1970)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, X., Li, X., Wang, Q. (2008). Hybrid Heuristic for m-Machine No-Wait Flowshops to Minimize Total Completion Time. In: Shen, W., Yong, J., Yang, Y., Barthès, JP.A., Luo, J. (eds) Computer Supported Cooperative Work in Design IV. CSCWD 2007. Lecture Notes in Computer Science, vol 5236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92719-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-92719-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92718-1
Online ISBN: 978-3-540-92719-8
eBook Packages: Computer ScienceComputer Science (R0)