Closing the Gap for Makespan Scheduling via Sparsification Techniques.
Klaus JansenKim-Manuel KleinJosé VerschaePublished in: CoRR (2016)
Keyphrases
- scheduling problem
- release dates
- unrelated parallel machines
- scheduling jobs
- single machine
- batch processing
- batch processing machines
- flowshop
- processing times
- parallel machines
- maximum lateness
- sequence dependent setup times
- deteriorating jobs
- setup times
- job shop
- precedence constraints
- np hard
- minimizing makespan
- tabu search
- permutation flowshop
- single machine scheduling problem
- scheduling algorithm
- round robin
- neural network
- job shop scheduling problem
- lower bound
- release times
- identical parallel machines
- job processing times
- job shop scheduling
- strongly np hard
- preventive maintenance
- morphological operators
- upper bound
- production system
- image restoration
- least squares
- computational complexity