Scheduling with two non-unit task lengths is NP-complete.
Jan ElffersMathijs de WeerdtPublished in: CoRR (2014)
Keyphrases
- np complete
- np hard
- scheduling problem
- randomly generated
- constraint satisfaction problems
- computational complexity
- scheduling algorithm
- pspace complete
- round robin
- conjunctive queries
- satisfiability problem
- phase transition
- np complete problems
- data complexity
- flexible manufacturing systems
- dynamic scheduling
- real time
- resource constraints
- scheduling strategy
- polynomial time complexity
- preventive maintenance
- wafer fabrication
- parallel machines
- control unit
- parallel processors
- job shop scheduling
- resource allocation
- neural network