Abstract
The problem of permutation flowshop scheduling is considered with the objective of minimizing the total flowtime. We present a constructive heuristic and two composite heuristics to solve the problem. The composite heuristics combine the simulated annealing method of Chakravarthy and Rajendran [Production Planning and Control 10 (1999)], the constructive heuristic of Nawaz et al. [Omega 11 (1983)] and the new heuristic. Computational analysis is carried out with the benchmark problems of Taillard [European Journal of Operational Research 64 (1993)]. The two composite heuristics produce better quality solutions than those produced by the composite heuristics of Liu and Reeves [European Journal of Operational Research 132 (2001)]. Statistical tests of significance are used to substantiate the improvement in solution quality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rajendran C, Ziegler H (1997) An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. Eur J Oper Res 103:129–138
Framinan JM, Leisten R, Ruiz-Usano R (2005) Comparison of heuristics for flow time minimization in permutation flow shop. Comput Oper Res 32:1237–1254
Nawaz ME, Enscore E, Ham I (1983) A heuristic algorithm for the m- machine, n-job flowshop sequencing problem. Omega 11:91–95
Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155:426–438
Laha D, Chakraborty UK (2007) An efficient stochastic hybrid heuristic for flowshop scheduling. Engineering Applications of Artificial Intelligence 20:851–856
Chakraborty UK, Laha D (2007) An improved heuristic for permutation flowshop scheduling. Int J Inf Commun Technol 1:89–97
Gonzalez T, Sahni S (1978) Flow shop and job shop scheduling: complexity & approximation. Oper Res 26:36–52
Rajendran C, Chaudhuri D (1991) An efficient heuristic approach to the scheduling of jobs in a flowshop. Eur J Oper Res 61:318–325
Rajendran C (1993) Heuristic algorithm for scheduling in flowshop to minimize total flow time. Int J Prod Econ 29:65–73
Woo DS, Yim HS (1998) A heuristic algorithm for mean flow time objective in flowshop scheduling. Comput Oper Res 25:175–182
Liu J, Reeves CR (2001) Constructive and composite heuristics solution of the \( P||{\sum {C_{i} } } \) scheduling problem. Eur J Oper Res 132:439–452
Framinan JM, Leisten R (2003) An efficient constructive heuristic for flowtime minimization in permutation flowshops. Omega 31:311–317
Chakravarthy K, Rajendran C (1999) A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Prod Plan Control 10:707–714
Wang C, Chu C, Proth JM (1997) Heuristic approaches for n/m/F/∑Ci scheduling problems. Eur J Oper Res 96:636–644
Ho JC (1995) Flowshop sequencing with mean flow time objective. Eur J Oper Res 81:571–578
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278–285
Kreyszig E (1972) Advanced engineering mathematics. John Wiley, New York
Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65–74
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Laha, D., Chakraborty, U.K. An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling. Int J Adv Manuf Technol 38, 1018–1025 (2008). https://doi.org/10.1007/s00170-007-1156-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-007-1156-z