Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times

European Journal of Operational Research

Volumn 149, Issue 3, 2003, Pages 513-522

  Rajendran, Chandrasekharan ^a   Ziegler, Hans ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

Flowshops; Heuristics; Scheduling; Sequence dependent setup times

Indexed keywords

BENCHMARKING; HEURISTIC METHODS; JOB ANALYSIS; MACHINE SHOPS; RANDOM PROCESSES; SCHEDULING;

WEIGHTED FLOWTIME;

OPERATIONS RESEARCH;

EID: 0038577481     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00485-X     Document Type: Article

References (23)

1. Allahverdi A., Gupta J.N.D., Aldowaisan T.A. A review of scheduling research involving setup considerations. OMEGA. 27:1999;219-239.
2. Asano M., Ohto H. Scheduling with shutdowns and sequence dependent set-up times. International Journal of Production Research. 37:1999;1661-1676.
3. Baker K.R. Introduction to Sequencing and Scheduling. 1974;John Wiley and Sons, New York.
4. Ben-Daya M., Al-Fawzan M. A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research. 109:1998;88-95.
5. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science. 16:1970;B630-B637.
6. Corwin B.D., Esogbue A.O. Two-machine flowshop scheduling problem with sequence dependent setup times: A dynamic programming approach. Naval Research Logistics Quarterly. 21:1974;515-524.
7. Das S.R., Gupta J.N.D., Khumawala B.M. A savings index heuristic algorithm for flowshop scheduling with sequence dependent set-up times. Journal of the Operational Research Society. 46:1995;1365-1373.
8. French S. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop. 1982;Ellis Horwood, Chichester.
9. Garey M.R., Johnson D.S., Sethi R. Complexity of flowshop and jobshop scheduling. Mathematics of Operations Research. 1:1976;117-129.
10. Gelders L.F., Sambandam N. Four simple heuristics for scheduling a flow-shop. International Journal of Production Research. 16:1978;221-231.
11. Ignall E., Schrage L. Application of the branch-and-bound technique to some flowshop scheduling problems. Operations Research. 13:1965;400-412.
12. Ishibuchi H., Misaki S., Tanaka H. Modified simulated annealing algorithms for the flow shop sequencing problems. European Journal of Operational Research. 81:1995;388-398.
13. Johnson S.M. Optimal two- and three-stage production schedules. Naval Research Logistics Quarterly. 1:1954;61-68.
14. i scheduling problem European Journal of Operational Research. 132:2001;439-452.
15. Nawaz M., Enscore E.E. Jr., Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA. 11:1983;91-95.
16. Nowicki E., Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research. 91:1996;160-175.
17. Pinedo M. SCHEDULING Theory, Algorithms and Systems. 1995;Prentice-Hall, Englewood Cliffs, NJ.
18. Radhakrishnan S., Ventura J.A. Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. International Journal of Production Research. 38:2000;2233-2252.
19. Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research. 32:1994;2541-2558.
20. Rajendran C., Ziegler H. Heuristics for scheduling in a flowshop with setup, processing and removal times separated. Production Planning and Control. 8:1997;568-576.
21. Srikar B.N., Ghosh S. A MILP model for the n-job, M-stage flowshop, with sequence dependent setup times. International Journal of Production Research. 24:1986;1459-1472.
22. Tseng F.T., Stafford E.F. Jr. Two MILP models for the. N×M SDST flowshop sequencing problem International Journal of Production Research. 39:2001;1777-1809.
23. Widmer M., Hertz A. A new heuristic method for the flowshop sequencing problem. European Journal of Operational Research. 41:1989;186-193.