Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Computers and Operations Research

Volumn 30, Issue 1, 2003, Pages 51-62

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

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Computational complexity; Sequencing; Time dependence scheduling

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; PROCESSING;

PROCESSING RATES;

SCHEDULING;

MACHINERY;

EID: 0037211214     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00077-6     Document Type: Article

References (14)

1. Optimization and approximation in deterministic sequencing and scheduling: A survey
2. Single facility scheduling with nonlinear processing times
3. Scheduling deteriorating jobs on a single processor
4. Single machine scheduling with deadlines and increasing rates of processing times
5. Scheduling problems with linear increasing processing times
6. Complexity of scheduling tasks with time-dependent execution times
7. The time dependent machine makespan problem is strongly NP-complete
8. The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
9. Scheduling with time dependent execution times
10. A note on single-processor scheduling with time-dependent execution times
11. Scheduling with time dependent processing times: Review and extensions
12. Scheduling jobs with linearly decreasing processing times