Abstract
No-wait flow shop scheduling problems have been proved to be NP-hard. Therefore, heuristics are considered as the most suitable ones for obtaining near optimal solutions and are generally developed in two phases namely, initial solution phase and improvement solution phase. We propose a method for obtaining the initial solution with a view to minimize total flow time. The exhaustive computational results reveal that the proposed method performs better than the existing heuristics with respect to both quality of solution and computational time.
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
Röck, H.: The three-machine no-wait flow shop is NP-complete. J. of Associate Computer Machinery 31, 336–345 (1984)
Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)
Rajendran, C., Chaudhuri, D.: Heuristic algorithms for continuous flow-shop problem. Naval Research Logistic Quarterly 37, 695–705 (1990)
Bertolissi, E.: Heuristic algorithm for scheduling in the no-wait flow-shop. J. of Materials Processing Technology 107, 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)
Framinan, J.M., Leisten, R., Rajendran, C.: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int. J. of Prod. Research. 41, 121–148 (2003)
Shore, H.M.: The transportation problem and the Vogel Approximation Method. Decis. Sci. 1, 441–457 (1970)
Simons Jr., J.V.: Heuristics in flow shop scheduling with sequence dependent setup times. Int. J. Mgmt. Sci. 20, 215–225 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sapkal, S., Laha, D. (2011). Comparison of Initial Solutions of Heuristics for No-wait Flow Shop Scheduling. In: Das, V.V., Thankachan, N. (eds) Computational Intelligence and Information Technology. CIIT 2011. Communications in Computer and Information Science, vol 250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25734-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-25734-6_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25733-9
Online ISBN: 978-3-642-25734-6
eBook Packages: Computer ScienceComputer Science (R0)