Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs

Annals of Operations Research

Volumn 92, Issue , 1999, Pages 107-123

  Gupta, J N D ^a   Hariri, A M A ^b   Potts, C N ^c  

^a BALL STATE UNIVERSITY   (United States)

^b KING ABDULAZIZ UNIVERSITY   (Saudi Arabia)

^c UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Branch and bound; Maximum tardiness; Minimum number tardy; Scheduling; Single machine

Indexed keywords

EID: 0033476671     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018974428912     Document Type: Article

References (7)

1. C.-L. Chen and R.L. Bulfin, Complexity of single machine, multi-criteria scheduling problems, European Journal of Operational Research 70(1993)115-125.
2. J.N.D. Gupta and R. Ramnarayanan, Single facility scheduling with dual criteria: Minimizing maximum tardiness subject to minimum number of tardy jobs, Production Planning and Control 7(1996)190-196.
3. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Management Science Research Report, University of California at Los Angeles, CA, 1955.
4. C.-Y. Lee and G.L. Vairaktarakis, Complexity of single machine hierarchical scheduling: A survey, in: Complexity in Numerical Optimization, ed. P.M. Pardalos, World Scientific, 1993, pp. 269-298.
5. J.M. Moore, An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15(1968)102-109.
6. J.G Shanthikumar, Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number tardy, Computers and Operations Research 10(1983)255-266.
7. J.B. Sidney, An extension of Moore's due date algorithm, in: Symposium on the Theory of Scheduling and its Applications, ed. S.E. Elmaghraby, Lecture Notes in Economics and Mathematical Systems, Vol. 86, Springer, 1973, pp. 393-398.