Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters

Volumn 81, Issue 6, 2002, Pages 327-333

  Ng, C T ^a   Cheng, T C E ^a   Bachman, A ^b   Janiak, A ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Algorithms; Dynamic programming; Single machine scheduling; Start time dependent processing times; Total completion time

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

MACHINE SCHEDULING;

DATA PROCESSING;

EID: 0037204524     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00244-7     Document Type: Article

References (7)

1. Scheduling with time dependent processing times: Review and extensions
2. Scheduling jobs with special type of start time dependent processing times
3. The complexity of scheduling starting time dependent tasks with release dates
4. Optimization and approximation in deterministic sequencing and scheduling: A survey
5. Complexity of scheduling tasks with time-dependent execution times
6. V-shaped policies for scheduling deteriorating jobs
7. Scheduling jobs under simple linear deterioration