On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem.
Cathy H. XiaJ. George ShanthikumarPeter W. GlynnPublished in: Oper. Res. (2000)
Keyphrases
- asymptotic optimality
- flowshop
- scheduling problem
- asymptotically optimal
- special case
- dispatching rule
- sufficient conditions
- processing times
- flowshop scheduling
- sequence dependent setup times
- setup times
- maximum lateness
- tabu search
- minimizing makespan
- flowshop scheduling problems
- shortest processing time
- job shop
- parallel machines
- information systems
- single machine
- buffer allocation
- lot streaming
- np hard