TY - JOUR
T1 - A Constructive Heuristic for Minimizing Makespan in No-wait Flow Shop Scheduling
AU - Laha, Dipak
AU - Chakraborty, Uday K.
N1 - Dipak Laha Uday K. Chakraborty This paper presents a new constructive heuristic, based on the principle of job insertion, for minimizing makespan in no-wait permutation flow shop scheduling problems. Empirical results demonstrate the superiority of the proposed approach over four of the best-known methods in the literature.
PY - 2009/3/1
Y1 - 2009/3/1
N2 - This paper presents a new constructive heuristic, based on the principle of job insertion, for minimizing makespan in no-wait permutation flow shop scheduling problems. Empirical results demonstrate the superiority of the proposed approach over four of the best-known methods in the literature. Analytical expressions for the total number of partial and complete sequences generated by the algorithms are derived. Statistical tests of significance substantiate the improvement in solution quality.
AB - This paper presents a new constructive heuristic, based on the principle of job insertion, for minimizing makespan in no-wait permutation flow shop scheduling problems. Empirical results demonstrate the superiority of the proposed approach over four of the best-known methods in the literature. Analytical expressions for the total number of partial and complete sequences generated by the algorithms are derived. Statistical tests of significance substantiate the improvement in solution quality.
UR - https://link.springer.com/article/10.1007/s00170-008-1454-0
U2 - 10.1007/s00170-008-1454-0
DO - 10.1007/s00170-008-1454-0
M3 - Article
VL - 41
JO - The International Journal of Advanced Manufacturing Technology
JF - The International Journal of Advanced Manufacturing Technology
ER -