Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times.
Max A. DeppertKlaus JansenPublished in: SPAA (2019)
Keyphrases
- approximation algorithms
- setup times
- scheduling problem
- np hard
- precedence constraints
- single machine
- flowshop
- constant factor approximation
- strongly np hard
- special case
- processing times
- sequence dependent setup times
- worst case
- integer programming
- tabu search
- parallel machines
- open shop
- set cover
- single machine scheduling problem
- computational complexity
- primal dual
- lower bound
- branch and bound algorithm
- job shop
- optimal solution
- single server
- lagrangian relaxation
- job shop scheduling problem
- job shop scheduling
- release dates
- polynomial time approximation
- lot sizing
- constraint satisfaction problems
- evolutionary algorithm
- greedy algorithm