Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines.
Martin KouteckýJohannes ZinkPublished in: CoRR (2020)
Keyphrases
- identical machines
- parallel machines
- identical parallel machines
- scheduling problem
- wafer fabrication
- flowshop
- processing times
- fixed number
- job scheduling
- single machine
- unrelated parallel machines
- release dates
- scheduling jobs
- optimal scheduling
- precedence constraints
- manufacturing cell
- maximum lateness
- resource allocation
- computational grids
- parallel machine scheduling problem
- worst case
- minimize total
- deteriorating jobs
- sequence dependent setup times
- neural network
- scheduling algorithm
- polynomial time approximation
- setup times
- release times
- tabu search
- computational cost
- lower bound