The asymptotic optimality of the SPT rule for the flow shop mean completion time problem

Operations Research

Volumn 49, Issue 2, 2001, Pages 293-304

  Kaminsky, Philip ^a   Simchi Levi, David ^b  

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

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; DISTRIBUTED PARAMETER CONTROL SYSTEMS; PROBLEM SOLVING; TIME MEASUREMENT;

JOB PROCESSING;

MACHINE SHOP PRACTICE;

EID: 0035269004     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.2.293.13536     Document Type: Article

References (16)

1. Dispatching
2. Probabilistic analysis of the LPT processor scheduling heuristic
3. The asymptotic optimality of the LPT rule
4. The complexity of flowshop and jobshop scheduling
5. Approximation algorithms for scheduling
6. Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
7. Exact, approximate, and guaranteed accuracy algorithms for the flow shop problem n/2/F/F̄
8. Heuristic programming solutions of a flowshop scheduling problem
9. Tight bounds and probabilistic analysis of two heuristics for parallel processor scheduling
10. A probabilistic analysis of 2-machine flowshops
11. Probabilistic analysis of the minimum weighted flowtime scheduling problem
12. Bounds and asymptotic results for the uniform parallel processor weighted flow time problem