Scheduling jobs on parallel machines with sequence-dependent setup times

European Journal of Operational Research

Volumn 100, Issue 3, 1997, Pages 464-474

  Lee, Young Hoon ^a,c   Pinedo, Michael ^b  

^a SAMSUNG Electronics   (South Korea)

^b Columbia University ^*  (United States)

^c Yonsei University   (South Korea)

Author keywords

Heuristics; Parallel machines; Scheduling; Setup time

Indexed keywords

EID: 0000482108     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(95)00376-2     Document Type: Article

References (26)

1. Abdul-Razaq, T.S., Potts, C.N. and van Wassenhove, L.N., 1990. A Survey of Algorithms for the Single Machine Total Weighted Tardiness Scheduling Problem. Discrete Applied Mathematics, 26, 235-253.
2. Adler, L., Fraiman, N.M., Kobacker, E., Pinedo, M., Plotnicoff, J.C. and Wu, T.P., 1993 BPSS: A Scheduling System for the Packaging Industry. Operations Research 41, 641-648.
3. Arkin, E.M. and Roundy, R.O., 1991. Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights. Operations Research, 39, 64-81.
4. Barnes, J.W. and Brennan, J.W., 1977. A Improved Algorithm for Scheduling Jobs on Identical Machines. IIE Transactions, 9, 25-31.
5. Carroll, D.C., 1965. Heuristic Sequencing of Jobs with Single and Multiple Components. Ph.D. Thesis. Sloan School of Management, MIT.
6. Dogramaci, A., 1984. Production Scheduling of Independent Jobs on Parallel Identical Machines. International Journal of Production Research, 16, 535-548.
7. Du, J. and Leung, J.Y., 1990. Minimizing Total Tardinesses on One Machine is NP-hard. Mathematics of Operations Research, 15, 483-494.
8. Elmagraby, S.E. and Park, S., 1974. Scheduling Jobs on A Number of Identical Machines. IIE Transactions, 6, 1-13.
9. Greene, J.W. and Supowit, K.J., 1986. Simulated Annealing without Rejected Moves. IEEE Trans. on Computer-aided Design, CAD-5, 221-228.
10. Johnson, D.S., Aragon, C.R., McGeoch, L.A. and Schevon, C., 1989. Optimization by Simulated Annealing: An Experimental Evaluation; Part 1, Graph Partitioning. Operations Research, 37, 865-892.
11. Lawler, E.L., 1977. A Pseudo-Polynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness. Annals of Discrete Mathematics, 1, 331-342.
12. Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G., 1982. Recent Developments in Deterministic Sequencing and Scheduling. In: M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan, A.H.G., (eds.), A Survey, Deterministic and Stochastic Scheduling. Reidel, Dordrecht, 35-73.
13. Lee, Y.H., Bhaskaran, K. and Pinedo, M., to appear. A Heuristic to Minimize the Total Weighted Tardiness with Sequence Dependent Setups. IIE Transactions.
14. Matsuo, H., Suh, C.J. and Sullivan, R.S., 1988. A Controlled Search Simulated Annealing Method for the General Jobshop Scheduling Problem. Working Paper 03-04-88, Department of Management, The University of Texas at Austin.
15. Matsuo, H., Suh, C.J. and Sullivan, R.S., 1989. A Controlled Search Simulated Annealing Method for the Single Machine Weighted Tardiness Problem. Annals of Operations Research, 21, 85-108.
16. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E., 1953. Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21, 1087-1092.
17. Potts, C.N. and van Wassenhove, L.N., 1982. A Decomposition Algorithm for the Single Machine Total Tardiness Problem. Operations Research Letters, 1, 177-182.
18. Potts, C.N. and van Wassenhove, L.N., 1985. A Branch and Bound Algorithm for the Total Weighted Tardiness Problem. Operations Research, 33, 363-377.
19. Potts, C.N. and van Wassenhove, L.N., 1987. Dynamic Programming and Decomposition Approaches for the Single Machine Total Tardiness Problem. The European Journal of Operational Research, 32, 405-414.
20. Potts, C.N. and van Wassenhove, L.N., 1991. Single Machine Tardiness Sequencing Heuristics. IIE Transactions, 23, 346-354.
21. Raman, N., Rachamadugu, R.V. and Talbot, F.B., 1989. Real-Time Scheduling of an Automated Manufacturing Center. The European Journal of Operational Research, 40, 222-242.
22. Vakharia, A.J. and Chang, Y., 1990. A Simulated Annealing Approach to Scheduling a Manufacturing Cell. Naval Research Logistics, 30, 559-577.
23. van Laarhoven, P.J.M. and Aarts, E.H.L., 1987. Simulated Annealing: Theory and Applications. D. Reidel, Dordecht.
24. van Laarhoven, P.J.M., Aarts, E.H.L. and Lenstra, J.K., 1992. Job Shop Scheduling by Simulated Annealing. Operations Research, 40, 113-125.
25. Vasilescu, E.N. and Amar, A.D., 1983. An Empirical Evaluation of the Entrapment Procedure for Scheduling Jobs on Identical Machines. IIE Transactions, 15, 261-263.
26. Vepsalainen, A. and Morton, T., 1987. Priority Rules for Job Shops with Weighted Tardiness Costs. Management Science, 33, 1035-1047.