Hardness of Interval Scheduling on Unrelated Machines.
Danny HermelinYuval ItzhakiHendrik MolterDvir ShabtayPublished in: IPEC (2022)
Keyphrases
- parallel machines
- scheduling problem
- identical machines
- identical parallel machines
- wafer fabrication
- flowshop
- scheduling algorithm
- resource allocation
- np hard
- precedence constraints
- round robin
- manufacturing cell
- dynamic scheduling
- release dates
- parallel processors
- scheduling strategy
- flexible manufacturing systems
- genetic algorithm
- learning machines
- resource constraints
- processing times
- learning theory
- phase transition
- database
- production scheduling
- real time database systems
- interval data
- information theoretic
- np complete
- case study
- fuzzy linear programming