Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines.
Martin KouteckýJohannes ZinkPublished in: ISAAC (2020)
Keyphrases
- parallel machines
- identical machines
- identical parallel machines
- scheduling problem
- flowshop
- processing times
- wafer fabrication
- unrelated parallel machines
- fixed number
- job scheduling
- single machine
- scheduling jobs
- minimize total
- optimal scheduling
- release times
- weighted tardiness
- precedence constraints
- computational complexity
- parallel machine scheduling problem
- sequence dependent setup times
- dispatching rule
- release dates
- maximum lateness
- space complexity
- worst case
- tabu search
- decision problems
- scheduling decisions
- genetic algorithm
- deteriorating jobs
- special case
- computational cost
- resource allocation
- batch processing
- scheduling strategy
- shared memory
- parallel processors
- setup times
- competitive ratio