Single machine scheduling with step-deteriorating processing times

European Journal of Operational Research

Volumn 134, Issue 3, 2001, Pages 623-630

  Cheng, T C E ^a   Ding, Q ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Computational complexity; Scheduling; Sequencing; Step deterioration

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

PROCESSING TIME;

SCHEDULING;

EID: 0035502107     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00284-8     Document Type: Article

References (9)

1. A survey on scheduling with time-dependent processing times
2. The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
3. The complexity of single machine scheduling with release times
4. The time dependent machine makespan problem is strongly NP-complete
5. Optimization and approximation in deterministic sequencing and scheduling: A survey
6. Scheduling deteriorating jobs to minimize makespan
7. Scheduling jobs with step-deterioration: Minimizing makespan on a single and multi-machine
8. Single machine scheduling with start time dependent processing times: Some solvable cases