Hardness of Interval Scheduling on Unrelated Machines.
Danny HermelinYuval ItzhakiHendrik MolterDvir ShabtayPublished in: CoRR (2022)
Keyphrases
- parallel machines
- scheduling problem
- identical machines
- manufacturing cell
- identical parallel machines
- scheduling algorithm
- flowshop
- computational complexity
- wafer fabrication
- round robin
- parallel processors
- phase transition
- machine intelligence
- scheduling strategy
- multiple objectives
- np hard
- np complete
- information theoretic
- interval data
- setup times
- resource constraints
- flexible manufacturing systems
- job shop
- real time database systems
- cell formation
- fixed number
- processing times
- decision making