Scheduling with batching: Two job types

Discrete Applied Mathematics

Volumn 72, Issue 1-2, 1997, Pages 99-114

  Hochbaum, Dorit S ^a   Landy, Dan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002065961     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00039-X     Document Type: Article

References (11)

1. S. Albers and P. Brucker, The complexity of one-machine batching problems, Discrete Appl. Math. 47(1993) 87-107.
2. A. Aggarwal, M.M. Klawe, S. Moran, P. Shor and R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica 2(1987) 195-208.
3. E. Coffman Jr., A. Nozari and M. Yannakakis, Optimal scheduling of products with two subassemblies on a single machine, Oper. Res. 37(1989) 426-436.
4. E. Coffman Jr., M. Yannakakis, M. Magazine and C. Santos, Batch sizing and sequencing on a single machine, Ann. Oper. Res. 26(1990) 135-147.
5. G. Dobson, U.S. Karmarkar and J.L. Rummel, Batching to minimize flow times on one machine, Management Sci. 33(1987) 784-799.
6. P. Gise and R. Blanchard, Modern Semiconductor Fabrication Technology (Prentice-Hall, Englewood Cliffs, NJ, 1986).
7. D. Hochbaum and D. Landy, Scheduling with batching: Minimizing the weighted number of tardy jobs, Oper. Res. Lett. 16(1994) 79-86.
8. D. Naddef and C. Santos, One-pass batching algorithms for the one machine problem, Discrete Appl. Math. 21(1988) 133-145.
9. D. Shallcross, A polynomial algorithm for a one machine batching problem, Oper. Res. Lett. 11(1992) 213-218.
10. S. Sze, VLSI Technology (McGraw-Hill, New York, 1983).
11. L. Ya. Zamanskii and V.L. Cherkasskii, A formula for finding the number of integer points under a straight line and its application, Ekonom. Mat. Metody 20(1984) 1132-1138 (in Russian).