Optimal streaming of a single job in a two-stage flow shop.
Alper SenEngin TopalogluÖmer S. BenliPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- flowshop
- scheduling problem
- asymptotic optimality
- lot streaming
- buffer allocation
- processing times
- asymptotically optimal
- flowshop scheduling
- maximum lateness
- strongly np hard
- special case
- makespan minimization
- tabu search
- job shop
- completion times
- sequence dependent setup times
- setup times
- single machine
- minimizing makespan
- multistage
- optimal solution
- competitive ratio
- single machine scheduling problem
- harmony search algorithm
- parallel machines
- flowshop scheduling problems
- identical parallel machines
- unrelated parallel machines
- particle swarm optimization
- dispatching rule