Closing the Gap for Makespan Scheduling via Sparsification Techniques.
Klaus JansenKim-Manuel KleinJosé VerschaePublished in: Math. Oper. Res. (2020)
Keyphrases
- scheduling problem
- unrelated parallel machines
- release dates
- batch processing
- scheduling jobs
- batch processing machines
- single machine
- processing times
- parallel machines
- deteriorating jobs
- flowshop
- setup times
- precedence constraints
- job shop
- morphological operators
- maximum lateness
- lower bound
- minimizing makespan
- optimal solution
- permutation flowshop
- open shop
- scheduling algorithm
- job shop scheduling
- identical machines
- job shop scheduling problem
- sequence dependent setup times
- neural network
- flexible manufacturing systems
- round robin
- single machine scheduling problem
- tabu search
- data sets
- dynamic scheduling
- bicriteria
- preventive maintenance
- strongly np hard
- real time database systems
- parallel processors
- production scheduling
- response time
- special case