Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines.
Christoph HertrichChristian WeißHeiner AckermannSandy HeydrichSven O. KrumkePublished in: CoRR (2020)
Keyphrases
- flowshop
- scheduling problem
- open shop
- online algorithms
- single machine
- competitive ratio
- job shop
- online learning
- dispatching rule
- processing times
- setup times
- manufacturing cell
- parallel machines
- sequence dependent setup times
- np hard
- worst case
- tabu search
- lower bound
- special case
- precedence constraints
- flowshop scheduling problems
- average case
- completion times
- learning algorithm
- asymptotically optimal
- release dates
- decision boundary
- job shop scheduling problem
- nearest neighbor
- strongly np hard
- scheduling jobs
- active learning