An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs

International Journal of Production Economics

Volumn 49, Issue 3, 1997, Pages 255-263

  Parthasarathy, Srinivasaraghavan ^a   Rajendran, Chandrasekharan ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Flowshop scheduling; Sequence dependent setup times; Simulated annealing algorithm; Weighted tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MACHINE SHOPS; PERTURBATION TECHNIQUES; SCHEDULING; SIMULATED ANNEALING;

FLOWSHOP SCHEDULING; SEQUENCE DEPENDENT SETUP TIMES; WEIGHTED TARDINESS;

PRODUCTION CONTROL;

EID: 0031145735     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(97)00017-0     Document Type: Article

References (8)

1. Garey, M.R., Johnson. D.S. and Sethi, R., 1976. The complexity of flow-shop and job-shop scheduling. Math. Oper. Res., 1: 117-129.
2. Gelders, L.F. and Sambandam, N., 1978. Four simple heuristics for scheduling a flowshop. Int. J. Prod. Res., 16: 221-231.
3. Kim, Y.D., 1993. Heuristics for flowshop scheduling problems minimizing mean tardiness. J. Oper. Res. Soc., 44: 19-29.
4. Kirkpatrick, S., Gelatt, C.D. Jr. and Vecchi, M.P., 1983. Optimization by simulated annealing. Science, 220: 671-680.
5. Aarts, E.H.L and van Laarhoven, P.J.M., 1985. Statistical cooling approach to combinatorial optimization problems. Philips J. Res., 40: 193-226.
6. Wilhem, M.R. and Ward, T.L., 1987. Solving quadratic assignment problems by simulated annealing. IIE Trans., 19: 107-119.
7. Johnson, D.S., Aragon, C.R., McGeoch, L.A. and Schevon, C., 1989. Optimisation by simulated annealing: An experimental evaluation: Part 1. Graph partitioning. Oper. Res., 37: 865-891.
8. Widmer, M. and Hertz, A., 1989. A new heuristic method for the flowshop sequencing problem. Eur. J. Oper. Res., 41: 186-193.