Note on `An efficient algorithm for the single-machine tardiness problem'

International Journal of Production Economics

Volumn 66, Issue 3, 2000, Pages 287-292

  Biskup, Dirk ^a   Piewitt, Wolfgang ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING; STRATEGIC PLANNING; THEOREM PROVING;

BRANCH-AND-BOUND ALGORITHMS; ELMAGHRABY DOMINANCE THEOREM;

PRODUCTION CONTROL;

EID: 0034691445     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(00)00014-1     Document Type: Article

References (9)

1. Smith W.E. Various optimizers for single-stage production. Naval Research Logistics Quarterly. 3:1956;59-66.
2. Du J., Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research. 15:1990;483-495.
3. Kondakci S., Kirca Ö., Azizoglu M. An efficient algorithm for the single machine tardiness problem. International Journal of Production Economics. 36:1994;213-219.
4. Hall N.G. Scheduling problems with generalized due dates. IIE Transactions. 18:1986;220-222.
5. Schrage L., Baker K.R. Dynamic programming solution of sequencing problems with precedence constraints. Operations Research. 26:1978;444-449.
6. Elmaghraby S.E. The one machine sequencing problem with delay costs. Journal of Industrial Engineering. 19:1968;105-108.
7. Srinivasan V. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Research Logistics Quarterly. 18:1971;317-327.
8. Emmons H. One-machine sequencing to minimize certain functions of job tardiness. Operations Research. 17:1969;701-715.
9. K.R. Baker, Elements of Sequencing and Scheduling, Hanover, 1998.