Abstract
No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH (fast composite heuristic) is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Hall N G, Sriskndarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Oper Res, 1996, 44(3): 510–525
Gray M R, Johnson D S, Sethi R. The complexity of flowshop and jobshop scheduling. Math Oper Res, 1976, 1(2): 117–129
Gangadharan R, Rajendran C. Heuristic algorithms for scheduling in the no-wait flowshop. Int J Prod Econ, 1993, 32(3): 285–290
Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc, 1994, 45(4): 472–478
Bonney M C, Gundry S W. Solutions to the constrained flow-shop sequencing problem. Oper Res Q, 1976, 24(4): 869–883
King J R, Spachis A S. Heuristics for flow-shop scheduling. Int J Pro Res, 1980, 18(3): 343–357
Aldowiasan T, Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Comp Oper Res, 2003, 30(8): 1219–1231
Grabowski J, Pempera J. Some local search algorithms for no-wait flow-shop problem with makespam criterion. Comp Oper Res, 2005, 32(8): 2197–2213
Tailard E. Benchmarks for basic scheduling problems. Eur J Oper Res, 1993, 64(2): 278–285
Li X P, Wang Q, Wu C. Efficient Composite Heuristics for Total Flowtime Minimization in Permutation Flow Shops. Omega. Accepted. (In press, online)
Nawaz M, Enscore E E, Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. Omega, 1983, 11(1): 91–95
Rajendran C, Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. Eur J Oper Res, 1997, 103(1): 129–138
Framinan J M, Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega, 2003, 31(4): 311–317
Framinan J M, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Comp Oper Res, 2005, 32(5): 1237–1254
Kalczynski P J, Kamburowski J. On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega, 2007, 35(1): 53–60
Woo D S, Yim H S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Comp Oper Res, 1998, 25(3): 175–182
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (Grant Nos 60504029 and 60672092), and the National High Technology Research and Development Program of China (863 Program) (Grant No. 2008AA04Z103)
Rights and permissions
About this article
Cite this article
Li, X., Wu, C. Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments. Sci. China Ser. F-Inf. Sci. 51, 896–909 (2008). https://doi.org/10.1007/s11432-008-0080-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-008-0080-7