Single machine scheduling with release times, deadlines and tardiness objectives

European Journal of Operational Research

Volumn 133, Issue 2, 2001, Pages 447-453

  Koulamas, Christos ^a   Kyparisis, George J ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Deadlines; Deterministic; Sequencing; Single machine; Tardiness

Indexed keywords

ALGORITHMS; POLYNOMIALS; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

PSEUDOPOLYNOMIAL ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0034976639     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00207-1     Document Type: Article

References (15)

1. Minimizing total tardiness on one machine is NP-hard
2. One-machine sequencing to minimize certain functions of job tardiness
3. A new dominance concept in scheduling n jobs on a single machine with ready times and due dates
4. Two-processor scheduling with start-times and deadlines
5. Optimization and approximation in deterministic sequencing and scheduling: A survey
6. Single machine scheduling with deadlines to minimize the weighted number of tardy jobs
7. Scheduling a production line to minimze maximum tardiness
8. A solvable case of the one-machine scheduling problem with ready and due times
9. The total tardiness problem: Review and extensions
10. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness
11. Complexity of machine scheduling problems
12. An n job, one machine sequencing algorithm for minimizing the number of late jobs
13. A decomposition algorithm for the single machine total tardiness problem
14. Various optimizers for single-stage production