Minimizing the number of tardy jobs on a single machine with batch setup times

Acta Cybernetica

Volumn 13, Issue 4, 1998, Pages 423-429

  Rote, Günter ^a   Woeginger, Gerhard J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Batch setup times; Number of tardy jobs; Scheduling; Sequencing

Indexed keywords

EID: 0347537043     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. J. BRUNO AND P. DOWNEY, Complexity of task sequencing with deadlines, set-up times, and changeover costs, SIAM Journal on Computing 7, 1978, 393.-404.
2. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
3. T. IBARAKI AND N. KATOH, Resource Allocation Problems: Algorithmic Approaches, MIT Press, Boston, 1988.
4. N. KATOH, T. IBARAKI, AND H. MINE, Algorithms for a variant of the resource allocation problem, Journal of the Operations Research Society of Japan 22, 1979, 287-299.
5. E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN, AND D.B. SHMOYS, Sequencing and scheduling: Algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (eds.) Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, North-Holland, Amsterdam, 1993, 445-522.
6. C.L. MONMA AND C.N. POTTS, On the complexity of scheduling with batch set-up times, Operations Research 37, 1989, 798-804.
7. J. MOORE, An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management, Science 15, 1968, 102-109.
8. C.N. POTTS AND L.N. VAN WASSENHOVE, Integrating scheduling with batching and lotsizing: a review of algorithms and complexity, Journal of the Operational Research Society 43, 1992, 395-406.
9. S. WEBSTER AND K.R. BAKER, Scheduling groups of jobs on a single machine, Operations Research 43, 1995, 692-703.