Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems.
Adam KurpiszMonaldo MastrolilliGeorgios StamoulisPublished in: WAOA (2012)
Keyphrases
- competitive ratio
- approximation schemes
- scheduling problem
- single machine
- processing times
- approximation algorithms
- flowshop
- np hard
- release dates
- setup times
- precedence constraints
- sequence dependent setup times
- completion times
- single machine scheduling problem
- parallel machines
- tabu search
- special case
- job shop
- strongly np hard
- identical parallel machines
- average case
- lower bound
- bin packing
- resource consumption
- machine learning
- dynamic programming
- computational complexity
- optimal solution