A stochastic batching and scheduling problem

Probability in the Engineering and Informational Sciences

Volumn 15, Issue 4, 2001, Pages 465-479

  Koole, Ger ^a   Righter, Rhonda ^b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b SANTA CLARA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SEMICONDUCTOR DEVICE MANUFACTURE; STOCHASTIC SYSTEMS;

BATCH-SCHEDULING; DETERMINISTIC PROBLEMS; FLOW-TIME; OPTIMAL POLICIES; POLYNOMIAL-TIME ALGORITHMS; PROCESSING TIME; SCHEDULING PROBLEM; SEMICONDUCTOR MANUFACTURING;

SCHEDULING;

EID: 0346909237     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0269964801154033     Document Type: Article

References (18)

1. Ahmadi, J.H., Ahmadi, R.R., Dasu, S., & Tang, C.S. (1992). Batching and scheduling jobs on batch and discrete processors. Operations Research 40: 750-763.
2. Albers, S. & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics 47: 87-107.
3. Brucker, P. (1991). Scheduling problems in connection with flexible production systems. In Proceedings of the IEEE International Conference on Robotics and Automation, pp. 1778-1783.
4. Chandru, V., Lee, C.Y., & Uzsoy, R. (1993). Minimizing total completion time on batch processing machines. International Journal of Production Research 31: 2097-2121.
5. Chandru, V., Lee, C.Y., & Uzsoy, R. (1993). Minimizing total completion time on abatch processing machine with families. Operations Research Letters 13: 61-65.
6. Cheng, T.C.E. & Kovalyov, M.Y. (2000). Parallel machine batching and scheduling with deadlines. Journal of Scheduling 3: 109-123.
7. Coffman, E., Jr., Yannakakis, M., Magazine, M., & Santos, C. (1990). Batch sizing and sequencing on a single machine. Annals of Operations Research 26: 135-147.
8. Deb, R.K. & Serfozo, R.F. (1973). Optimal control of batch service queues. Advances in Applied Probability 5: 340-361.
9. Dobson, G., Karmarkar, U.S., & Rummel, J.L. (1987). Batching to minimize flow times on one machine. Management Science 33: 784-799.
10. Glassey, C.R. & Weng, W.W. (1991). Dynamic batching heuristics for simultaneous processing. IEEE Transactions on Semiconductor Manufacturing 4: 77-82.
11. Hochbaum, D. & Landy, D. (1994). Scheduling with batching: Minimizing the weighted number of tardy jobs. Operations Research Letters 16: 79-86.
12. Hochbaum, D. & Landy, D. (1997), Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research 45: 874-885.
13. Ikura, Y. & Gimple, M. (1986). Scheduling algorithms for a single batch processing machine. Operations Research Letters 5: 61-65.
14. Nadder, D. & Santos, C. (1988). One-pass batching algorithms for the one machine scheduling problem. Discrete Applied Mathematics 21: 133-145.
15. Potts, C.N. & Kovalyov, M.Y. (2000). Scheduling with batching. A review. European Journal of Operational Research 120: 228-249.
16. Shallcross, D. (1992). A polynomial algorithm for a one machine batching problem. Operations Research Letters 11: 213-218.
17. Sung, C.S. & Choung, Y.I. (2000). Minimizing makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research 120: 559-574.
18. Wagelmans, A.P.M. & Gerodimos, A.E. (2000). Improved dynamic programs for some batching problems involving the maximum lateness criterion. Operations Research Letters 27: 109-118.