Scheduling start time dependent jobs to minimize the total weighted completion time

Journal of the Operational Research Society

Volumn 53, Issue 6, 2002, Pages 688-693

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

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Computational analysis; Heuristics; Scheduling; Single machine; Start time dependent processing time

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; HEURISTIC METHODS; LINEARIZATION; SCHEDULING; THEOREM PROVING; TIME AND MOTION STUDY; TIME SERIES ANALYSIS;

HEURISTIC ALGORITHMS; JOB PROCESSING TIME; LINEAR FUNCTIONS; SINGLE MACHINE SCHEDULING; START TIME DEPENDENT JOBS; TOTAL WEIGHTED COMPLETION TIME;

JOB ANALYSIS;

EID: 0036602498     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601359     Document Type: Article

References (15)

1. The complexity of scheduling starting time dependent tasks with release dates
2. The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
3. The time dependent machine makespan problem is strongly NP-complete
4. Complexity of scheduling tasks with time-dependent execution times
5. Scheduling with time dependent processing times: Review and extensions
6. Scheduling jobs under simple linear deterioration
7. A-shaped policies to schedule deteriorating jobs
8. Single machine scheduling with start time dependent processing times: Some solvable cases
9. Scheduling jobs with special type of start time dependent processing times
10. Optimization and approximation in deterministic sequencing and scheduling: A survey
11. Various optimizers for single-stage production
12. Minimizing the total weighted completion time of deteriorating jobs
13. Three scheduling problems with deteriorating jobs to minimize the total completion time
14. V-shaped policies for scheduling deteriorating jobs