Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times.
Max A. DeppertKlaus JansenPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- setup times
- scheduling problem
- np hard
- precedence constraints
- constant factor approximation
- flowshop
- processing times
- single machine
- strongly np hard
- special case
- job shop
- open shop
- worst case
- parallel machines
- sequence dependent setup times
- job shop scheduling
- lower bound
- multi item
- primal dual
- lot sizing
- tabu search
- linear programming
- combinatorial auctions
- single machine scheduling problem
- integer programming
- computational complexity
- constraint satisfaction problems
- job shop scheduling problem
- optimal solution
- release dates
- knapsack problem
- branch and bound algorithm