Closing the Gap for Makespan Scheduling via Sparsification Techniques.
Klaus JansenKim-Manuel KleinJosé VerschaePublished in: ICALP (2016)
Keyphrases
- scheduling problem
- release dates
- batch processing
- unrelated parallel machines
- scheduling jobs
- single machine
- parallel machines
- flowshop
- batch processing machines
- processing times
- precedence constraints
- deteriorating jobs
- job shop
- open shop
- scheduling algorithm
- single machine scheduling problem
- setup times
- job shop scheduling
- maximum lateness
- preventive maintenance
- minimizing makespan
- np hard
- tabu search
- real time
- lower bound
- resource allocation
- morphological operators
- identical machines
- real time database systems
- scheduling strategy
- identical parallel machines
- sequence dependent setup times
- permutation flowshop
- regularization method
- resource constraints
- branch and bound algorithm
- optimal solution
- job processing times
- data sets