Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times.
Daniel OronDvir ShabtayGeorge SteinerPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- approximation algorithms
- processing times
- scheduling problem
- np hard
- precedence constraints
- identical machines
- release dates
- precedence relations
- single machine
- scheduling jobs
- identical parallel machines
- special case
- polynomial time approximation
- setup times
- flowshop
- resource consumption
- scheduling decisions
- worst case
- release times
- sequence dependent setup times
- minimum cost
- optimal solution
- single machine scheduling problem
- communication delays
- response time
- tabu search
- polynomially solvable
- job shop scheduling
- job shop
- branch and bound algorithm
- strongly np hard
- scheduling algorithm
- competitive ratio
- approximation ratio
- job shop scheduling problem
- computational complexity
- manufacturing cell
- lower bound
- completion times
- knapsack problem
- integer programming
- objective function
- np complete
- combinatorial auctions
- parallel machines