ITERATIVE HEURISTICS FOR PERMUTATION FLOW SHOPS WITH TOTAL FLOWTIME MINIMIZATION

摘要

In this paper, flow shop scheduling problems with total flowtime minimization is considered. IRZ (iterative RZ, presented by Rajendran and Ziegler, EJOR, 1997) is found to be effective to improve solutions andLR (developed by Liu & Reeves, EJOR, 2001) is suitable for initial solution developing. By integrating FPE (forward pair wise exchange) and FPE-R(forward pair wise exchange-restart) with IRZ, two efficient composite heuristics, ECH1 and ECH2, are proposed. Computational results show that the proposed three outperform three best existing ones in performance and ECHl is best. IRZ is the fastest heuristic. ECH2 is a trade-off between IRZ and ECH1 both in effectiveness and efficiency.