Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed

Engineering Optimization

Volumn 28, Issue 3, 1997, Pages 231-243

  Sung, Chang Sup ^a   Yoon, Sang Hum ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Batch processing machine; Dynamic arrival; Flowshop; Scheduling

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; MACHINERY; PRODUCTION; SCHEDULING;

BATCH PROCESSING MACHINE; DYNAMIC ARRIVAL; FLOWSHOP; MAXIMUM COMPLETION TIME;

OPTIMIZATION;

EID: 0031340163     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052159708941133     Document Type: Article

References (14)

1. Ahmadi, J. H., Ahmadi, R. H., Dasu, S. and Tang, C. S. (1992). Batching and scheduling jobs on batch and discrete processors. Operations Research, 39, 750-763.
2. Chandru, V., Lee, C. Y. and Uzsoy, R. (1993). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61-65.
3. Chandru, V., Lee, C. Y. and Uzsoy, R. (1993). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31, 2097-2121.
4. Dobson, G., Karmarkar, U. S. and Rummel, J. L. (1987). Batching to minimize flow times on one machine. Management science, 33, 784-799.
5. Dobson, G., Karmarkar, U. S. and Rummel, J. L. (1989). Batching to minimize flow times on parallel heterogeneous machines. Management Science, 35, 607-613.
6. Glassey, C. R. and Weng, W. W. (1991). Dynamic batching heuristic for simultaneous processing. IEEE Transactions on Semiconductor Manufacturing, 4, 77-82.
7. Hochbaum, D. S. and Landy, D. (1994). Algorithms and heuristics for scheduling semiconductor burn-in operations. Technical Report, Engineering Systems Research Centre, University of California, Berkeley.
8. Ikura, Y. and Gimple, M. (1986). Scheduling algorithms for a single batch processing machine. Operations Research letters, 5, 764-775.
9. Lee, C. Y., Uzsoy, R. and Martin-Vega, L. A. (1992). Efficient algorithms of scheduling semiconductor burn-in operations. Operations Research, 40, 764-775.
10. Santos, C. and Magazine, M. (1985). Batching in single operation manufacturing systems. Operations Research Letters, 4, 99-013.
11. Slomson, A. (1991). An introduction to combinatorics. Chapman and Hall, London.
12. Sung, C. S. and Joo, U. G. (1997). Batching to minimize weighted mean flow time on a single machine with batch size restrictions. Computers and I. E. (to appear).
13. Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32, 1615-1635.
14. Webster, S. and Baker, K. R. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692-703.