The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem.
Philip M. KaminskyDavid Simchi-LeviPublished in: Oper. Res. (2001)
Keyphrases
- asymptotic optimality
- flowshop
- scheduling problem
- asymptotically optimal
- special case
- dispatching rule
- processing times
- shortest processing time
- setup times
- flowshop scheduling
- maximum lateness
- tabu search
- sufficient conditions
- minimizing makespan
- sequence dependent setup times
- single machine
- open shop
- parallel machines
- permutation flowshop
- lot streaming
- flowshop scheduling problems