Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates

Operations Research Letters

Volumn 29, Issue 3, 2001, Pages 141-148

  Kaminsky, Philip ^a   Simchi Levi, David ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

Asymptotic analysis; On line algorithms; Scheduling

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; SCHEDULING;

ASYMPTOTIC ANALYSIS;

JOB ANALYSIS;

EID: 0035476812     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00099-2     Document Type: Article

References (17)

1. Approximation schemes for minimizing average weighted completion time with release dates
2. Scheduling with release dates on a single machine to total weighted completion time
3. Scheduling of a single machine to minimize total weighted completion time subject to release dates
4. Approximation techniques for average completion time scheduling
5. Sequencing jobs with unequal ready times to minimize mean flow time
6. Formulating the single machine sequencing problem with release dates as a mixed integer program
7. Probabilistic analysis of a machine scheduling problem
8. An algorithm for single machine sequencing with release dates to minimize total weighted completion time
9. Optimal on-line algorithms for single-machine scheduling
10. Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
11. The asymptotic optimality of the SPT rule for the flow shop mean completion time problem
12. Complexity of machine scheduling problems
13. Scheduling jobs that arrive over time
14. A proof of the optimality of the shortest remaining processing time discipline
15. A time indexed formulation of non-preemptive single machine scheduling problems