Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms.
Marin BougeretPierre-François DutotKlaus JansenChristina RobenekDenis TrystramPublished in: Discret. Math. Algorithms Appl. (2011)
Keyphrases
- approximation algorithms
- precedence constraints
- identical machines
- open shop
- polynomial time approximation
- np hard
- job shop
- scheduling problem
- parallel machines
- strongly np hard
- vertex cover
- special case
- identical parallel machines
- parallel processors
- batch processing machines
- processing times
- release dates
- minimum cost
- network design problem
- worst case
- facility location problem
- setup times
- job scheduling
- maximum lateness
- sequence dependent setup times
- scheduling strategy
- single machine
- randomized algorithms
- approximation schemes
- search algorithm
- strip packing
- constant factor
- approximation ratio
- single machine scheduling problem
- primal dual
- combinatorial auctions
- resource allocation
- set cover
- job shop scheduling
- undirected graph
- upper bound