Abstract
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 and LR (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 ECH1 is best. IRZ is the fastest heuristic. ECH2 is a trade-off between IRZ and ECH1 both in effectiveness and efficiency.
Chapter PDF
8. References
Allahverdi A, Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 2002; 77(1): 71–83.
Baker KR. Introduction to sequencing and scheduling. New York: Wiley, 1974.
Framinan JM, Leisten R, Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research 2003; 41(1): 121–148.
Framinan JM, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers & Operations Research 2005; 32(5): 1237–1254.
Framinan JM, Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA 2003; 31(4): 311–317.
French S. Sequencing and scheduling: an introduction to the mathematics of the job-shop. Chichester: Ellis Horwood, 1982.
Gray MR, Johnson DS, Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1976; l(2): 117–129.
Gupta JND. Heuristic algorithms for multistage flow shop problem. AIIE Transaction 1972; 4(1): 11–18.
Ho JC. Flowshop sequencing with mean flowtime objective. European Journal of Operational Research 1995; 81(3): 571–578.
Liu J, Reeves CR. Constructive and composite heuristic solutions to the P// ΣCi scheduling problem. European Journal of Operational Research 2001; 132(2): 439–452.
Nawaz M, Enscore EE, Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA 1983; 1 l(1): 91–95.
Rajendran C, Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research 1991; 61(2): 318–325.
Rajendran C, Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime ofjobs. European Journal of Operational Research 1997; 103(1): 129–138.
Rajendran C, Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan total flowtime of jobs. European Journal of Operational Research 2004; 155(2): 426–438.
Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research 1994; 32(11): 2541–2558.
Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimise total flowtime. International Journal of Production Economics 1993; 29(1): 65–73.
Tailard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64(1): 278–285.
Wang C, Chu C, Proth JM. Heuristic approaches for n/m/F/∑C 1 scheduling problems. European Journal of Operational Research 1997; 96(3): 636–644.
Woo DS, Yim HS. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers & Operations Research 1998; 25(3): 175–182.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Li, X., Wang, Q. (2006). Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization. In: Information Technology For Balanced Manufacturing Systems. BASYS 2006. IFIP International Federation for Information Processing, vol 220. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36594-7_37
Download citation
DOI: https://doi.org/10.1007/978-0-387-36594-7_37
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-36590-9
Online ISBN: 978-0-387-36594-7
eBook Packages: Computer ScienceComputer Science (R0)