Online algorithms to schedule a proportionate flexible flow shop of batching machines.
Christoph HertrichChristian WeißHeiner AckermannSandy HeydrichSven O. KrumkePublished in: J. Sched. (2022)
Keyphrases
- flowshop
- scheduling problem
- open shop
- online algorithms
- competitive ratio
- single machine
- job shop
- online learning
- processing times
- dispatching rule
- lower bound
- special case
- manufacturing cell
- setup times
- sequence dependent setup times
- np hard
- parallel machines
- tabu search
- learning algorithm
- completion times
- precedence constraints
- worst case
- scheduling jobs
- job shop scheduling problem
- job shop scheduling
- flowshop scheduling problems
- approximation algorithms
- upper bound
- average case
- lot streaming
- dynamic programming
- uniform distribution