Scheduling a capacitated batch-processing machine to minimize makespan

Robotics and Computer-Integrated Manufacturing

Volumn 23, Issue 2, 2007, Pages 208-216

  Damodaran, Purushothaman ^a   Srihari, Krishnaswami ^a   Lam, Sarah S ^a  

^a State University of New York   (United States)

Author keywords

Batch processing; Mathematical modeling; Scheduling; Simulated annealing

Indexed keywords

BATCH DATA PROCESSING; MATHEMATICAL MODELS; PROBLEM SOLVING; QUALITY ASSURANCE; SCHEDULING; SIMULATED ANNEALING;

BATCH-PROCESSING MACHINE; MAKESPAN; RUN TIME; SOLUTION QUALITY;

INDUSTRIAL MANAGEMENT;

EID: 33845888245     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.rcim.2006.02.012     Document Type: Article

References (30)

1. Pinedo M. Scheduling: theory, algorithms, and systems (2002), Prentice-Hall, Englewood Cliffs, NJ
2. Chandru V., Lee C.Y., and Uzsoy R. Minimizing total completion time on a batch processing machine with job families. Oper Res Lett 13 (1993) 61-65
3. Uzsoy R. Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32 7 (1994) 1615-1635
4. Hochbaum D.S., and Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime. Oper Res 45 6 (1997) 874-885
5. Li C.L., and Lee C.Y. Scheduling with agreeable release times and due dates on a batch processing machine. Eur J Oper Res 96 (1997) 564-569
6. Ghazvini F.J., and Dupont L. Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. Int J Prod Econ 55 (1998) 273-280
7. Sung C.S., and Choung Y.I. Minimizing makespan on a single burn-in oven in semiconductor manufacturing. Eur J Oper Res 120 (2000) 559-574
8. Chang P.Y., Damodaran P., and Melouk S. Minimizing makespan on parallel batch-processing machines. Int J Prod Res 42 19 (2004) 4211-4220
9. Melouk S., Damodaran P., and Chang P.Y. Minimizing makespan for a single machine batch processing with non-identical job sizes using simulated annealing. Int J Prod Econ 87 2 (2004) 141-147
10. Ikura Y., and Gimple M. Scheduling algorithms for a single batch processing machine. Oper Res Lett 5 (1986) 61-65
11. Sung C.S., and Yoon S.H. Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed. Eng Optim 120 (1987) 559-574
12. Sung C.S., Kim Y.H., and Yoon S.H. A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. Eur J Oper Res 121 (2000) 179-192
13. Uzsoy R., and Yang Y. Minimizing total weighted completion time on a single batch processing machine. Prod Oper Manage 6 1 (1997) 57-73
14. Dupont L., and Dhanence-Flipo C. Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Comput Oper Res 29 (2002) 807-819
15. Lee C.Y., Uzsoy R., and Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40 4 (1992) 764-775
16. Wang C.S., and Uzsoy R. A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput Oper Res 29 (2002) 1621-1640
17. Potts C.N., and Kovalyov M.Y. Scheduling with batching: a review. Eur J Oper Res 120 (2000) 228-249
18. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
19. Cerny V. A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim: Theory Appl 45 (1985) 41-51
20. Bonomi E., and Lutton J.L. The N-city traveling salesman problem: statistical mechanics and the metropolis algorithm. SIAM Rev 26 (1984) 551-568
21. Golden B.L., and Skiscim C.C. Using simulated annealing to solve routing and location problems. Nav Res Logist Q 33 (1986) 261-279
22. Burkard R.E., and Rendl F. A thermodynamically motivated simulation procedure for combinatorial optimization problems. J Optim: Theory Appl 45 (1984) 41-45
23. Wilhelm M.R., and Ward T.L. Solving quadratic assignment problems by simulated annealing. IIE Trans 37 (1987) 107-119
24. Radhakrishnan S., and Ventura J.A. Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence dependent set-up times. Int J Prod Res 38 10 (2000) 2233-2252
25. Van Laarhoven P.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by simulated annealing. Oper Res 40 1 (1992) 113-125
26. Johnson D.S., Aragon C.R., Mcgeouch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation; Part II, graph coloring and number partitioning. Oper Res 39 3 (1991) 378-406
27. Eglese R.W. Simulated annealing: a tool for operational research. Eur J Oper Res 46 (1990) 271-281
28. Pirlot M. General local search methods. Eur J Oper Res 92 (1996) 493-511
29. Reeves C. Modern heuristic techniques for combinatorial optimization problems (1997), McGraw-Hill International, UK
30. Koulamas C., Antony S.R., and Jaen R. A survey of simulated annealing applications to operations research problems. Int J Manage Sci 22 1 (1994) 41-56