Efficient composite heuristics for total flowtime minimization in permutation flow shops |
| |
Authors: | Xiaoping Li Qian Wang Cheng Wu |
| |
Affiliation: | 1. School of Computer Science & Engineering, Southeast University, 210096 Nanjing, PR China;2. Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, PR China;3. Department of Automation, Tsinghua University, 100084, Beijing, PR China |
| |
Abstract: | In this paper, permutation flow shops with total flowtime minimization are considered. General flowtime computing (GFC) is presented to accelerate flowtime computation. A newly generated schedule is divided into an unchanged subsequence and a changed part. GFC computes total flowtime of a schedule by inheriting temporal parameters from its parent in the unchanged part and computes only those of the changed part. Iterative methods and LR (developed by Liu J, Reeves, CR. Constructive and composite heuristic solutions to theP∥ΣCi scheduling problem, European Journal of Operational Research 2001; 132:439–52) are evaluated and compared as solution improvement phase and index development phase. Three composite heuristics are proposed in this paper by integrating forward pair-wise exchange-restart (FPE-R) and FPE with an effective iterative method. Computational results show that the proposed three outperform the best existing three composite heuristics in effectiveness and two of them are much faster than the existing ones. |
| |
Keywords: | Composite heuristic Flow shop Scheduling Flowtime |
本文献已被 ScienceDirect 等数据库收录! |
|