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. © 2011 Springer-Verlag.
CITATION STYLE
Sapkal, S., & Laha, D. (2011). Comparison of initial solutions of heuristics for no-wait flow shop scheduling. In Communications in Computer and Information Science (Vol. 250 CCIS, pp. 294–298). https://doi.org/10.1007/978-3-642-25734-6_44
Mendeley helps you to discover research relevant for your work.