A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs–a case study

Production Planning and Control

Volumn 8, Issue 5, 1997, Pages 475-483

  Parthasarathy, S ^a   Rajendran, Chandrasekharan ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

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

Indexed keywords

ALGORITHMS; BITS; HEURISTIC METHODS; MANUFACTURE; PRODUCTION CONTROL; SIMULATED ANNEALING;

FLOWSHOP SCHEDULING; MEAN TARDINESS; SEQUENCE DEPENDENT SETUP TIMES; SIMULATED ANNEALING ALGORITHM;

SCHEDULING;

EID: 0031190804     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/095372897235055     Document Type: Article

References (21)

1. AARTS, E. H. L., and VAN LAARHOVEN, P.J. M., 1985, Statistical cooling: approach to combinatorial optimization problems. Philips Journal of Research, 40, 193-226.
2. BAKER, K. R., 1974, Introduction to Sequencing and Scheduling (Wiley, New York).
3. CAMPBELL, H. G., DUDEK, R. A., and SMITH, M. L., 1970, A heuristic algorithm for the n-job, m-machines sequencing problem. Management Science, 16, B630-637.
4. DANNENBRING, D. G., 1977, An evaluation of flow shop sequencing heuristics. Management Science, 23, 1174-1182.
5. FRENCH, S., 1982, Sequencing and Scheduling:An Introduction to the Mathematics of the Job-shop (Ellis Horwood, Chichester).
6. GAREY, M. R., JOHNSON, D. S., and SETHI, R. R., 1976, The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research, 1, 117-129.
7. GELDERS, F. L., and SAMBANDAM, N., 1978, Four simple heuristics for scheduling a flowshop. International Journal of Production Research, 16, 221-231.
8. HO, J. C., and CHANG, Y. L., 1991, A new heuristic for the n-job, m-machine flowshop problem. EuropeanJournal of Operational Research, 52, 194-202.
9. HUNDAL, T. S., and RAJGOPAL, J., 1988, An extension of Palmer’s heuristic for the flowshop scheduling problem. International Journal of Production Research, 26, 1119-1124.
10. IGNALL, E., and SCHARGE, L. E., 1965, Application of branch and bound technique to some flow-shop problem. Operations Research, 13, 400-412.
11. JING, C., and BEDWORTH, D. D., 1992, Flowshop scheduling in serial multi-product process with transfer and set-up times. International Journal of Production Research, 30, 1819-1830.
12. JOHNSON, D. S., ARAGON, C. R., MCGEOCH, L. A., SCHEVON, C., 1989, Optimisation by simulated annealing: an experimental valuation; Part I, Graph partitioning, Operations Research, 37, 865-891.
13. KIM, Y. D., 1993, Heuristics for flowshop schedulingproblems minimizing mean tardiness. Journal of Operations Research Society, 44, 19-29.
14. KIRKPATRICK, S., GELATT, C. D. Jr., and VECCHI, M. P., 1983, Optimization by simulated annealing. Science, 220, 671-680.
15. MIYAZAKI, S., NISHIYAMA, N., and HASHIMOTO, F., 1978, An adjacent pairwise approach to the mean flow-time scheduling problem. Journal of the Operations Research Society of Japan, 21, 287-299.
16. NAWAZ, M., ENSCORE, E. E., and HAM, I., 1983, A heuristic algorithm for the m-machine, n-Job flow-shop sequencing problem. Computer and Operations Research, 17, 243-253.
17. RAJENDRAN, C., 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics, 29, 65-73.
18. SAATY, T. L., 1990, Multicriteria Decision Making: The Analytic Hierarchy Process (RWS Publications, Pittsburg).
19. STINSON, J. P., and SMITH, A. W., 1982, A heuristic programming procedure for sequencing the static flowshop. International Journal of Production Research, 20, 753-764.
20. WIDMER, M., and HERTZ, A., 1989, A new heuristic method for the flowshop sequencingproblem. EuropeanJournal of Operational Research, 41, 186-193.
21. WILHEM, M. R., and WARD, T. L., 1987, Solving quadratic assignment problems by simulated annealing. IIE Transactions, 19, 107-119.