Single machine scheduling to minimize batch delivery and job earliness penalties

SIAM Journal on Optimization

Volumn 7, Issue 2, 1997, Pages 547-559

  Cheng, T C Edwin ^a   Kovalyov, Mikhail Y ^b   Lin, Bertrand M T ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^c MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Batch scheduling; Dynamic programming; N P hardness; Polynomial algorithms; Single machine scheduling

Indexed keywords

EID: 0031493530     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494269540     Document Type: Article

References (20)

1. S. ALBERS AND P. BRUCKER (1993), The complexity of one-machine batching problems, Discrete Appl. Math., 47, pp. 87-107.
2. K. R. BAKER (1988), Scheduling the production of components at a common facility, IIE Trans., 20, pp. 32-35.
3. G. R. BITRAN AND D. TIRUPATI (1988), Planning and scheduling for epitaxial wafer production, Oper. Res., 36, pp. 34-49.
4. H. CHEN, J.M. HARRISON, A. MANDELBAUM, A. VAN ACKERE, AND L. M. WEIN (1988), Empirical evaluation of a queueing network model for semiconductor wafer fabrication, Oper. Res., 36, pp. 202-215.
5. T. C. E. CHENG AND V. S. GORDON (1994), Batch delivery scheduling on a single machine, J. Oper. Res. Soc., 45, pp. 1211-1215.
6. T. C. E. CHENG, V. S. GORDON, AND M. Y. KOVALYOV (1996), Single machine scheduling with batch deliveries, European J. Oper. Res., 94, pp. 277-283.
7. T. C. E. CHENG AND H. G. KAHLBACHER (1993), Scheduling with delivery and earliness penalties, Asia-Pacific J. Oper. Res., 10, pp. 145-152.
8. E. G. COFFMAN, JR., M. YANNAKAKIS, M. J. MAGAZINE, AND C. SANTOS (1990), Batch sizing and job sequencing on a single machine, Ann. Oper. Res., 26, pp. 135-147.
9. E. G. COFFMAN, A. NOZARI, AND M. YANNAKAKIS (1989), Optimal scheduling of products with two subassemblies on a single machine, Oper. Res., 37, pp. 426-436.
10. J. E. DAYHOFF AND R. W. ATHERTON (1987), A model for wafer fabrication dynamics in integrated circuit manufacturing, IEEE Trans. Systems Man Cybernet., 17, pp. 91-100.
11. G. DOBSON, U. S. KARMARKAR, AND J. L. RUMMEL (1987), Batching to minimize flow times on one machine, Management Sci., 33, pp. 784-799.
12. M. R. GAREY AND D. S. JOHNSON (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA.
13. C. R. GLASSEY AND M. G. C. RESENDE (1988), Closed-loop job release control for VLSI circuit manufacturing, IEEE Trans. Semiconductor Manufacturing, 1, pp. 36-46.
14. R. L. GRAHAM, E. L. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN (1979), Optimization and approximation in deterministic sequencing and scheduling, Ann. Discrete Math., 5, pp. 287-326.
15. E. L. LAWLER AND J. M. MOORE (1969), A functional equation and its application to resource allocation and sequencing problems, Management Sci., 16, pp. 77-84.
16. C.-Y. LEE, R. UZSOY, AND L. A. MARTIN-VEGA (1992), Efficient algorithms for scheduling semiconductor burn-in operations, Oper. Res., 40, pp. 764-775.
17. D. NADEFF AND C. SANTOS (1988), One-pass batching algorithms for the one machine problem, Discrete Appl. Math., 21, pp. 133-145.
18. M. H. ROTHKOPF (1966), Scheduling independent tasks on parallel processors, Management Sci., 12, pp. 437-447.
19. D. SHALLCROSS (1992), A polynomial algorithm for a one machine batching problem, Oper. Res. Lett., 11, pp. 213-218.
20. L. M. WEIN (1988), Scheduling semiconductor wafer fabrication, IEEE Trans. Semiconductor Manufacturing, 1, pp. 115-129.