Common due date assignment and scheduling with ready times

Computers and Operations Research

Volumn 29, Issue 14, 2002, Pages 1957-1967

  Cheng, T C E ^a   Chen, Z L ^b   Shakhlevich, N V ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Due date assignment; Earliness; Single machine scheduling; Tardiness

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS;

PROCESSING TIME;

OPERATIONS RESEARCH;

COMPUTER;

EID: 0036885560     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00067-3     Document Type: Article

References (7)

1. Common due date assignments to minimize total penalty for the one machine scheduling problem
2. Optimization and approximation in deterministic sequencing and scheduling: A survey
3. Complexity of machine scheduling problems
4. Minimizing average completion time in the presence of release dates
5. Various optimizers for single-stage production
6. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time