Computational complexity of some scheduling problems with multiprocessor tasks.
Yakov ZinderVan Ha DoCeyda OguzPublished in: Discret. Optim. (2005)
Keyphrases
- scheduling problem
- computational complexity
- special case
- np hard
- processing times
- np complete
- single machine
- mobile robot
- job shop scheduling
- job shop
- computational efficiency
- decision problems
- computational cost
- scheduling algorithm
- storage requirements
- job shop scheduling problem
- high computational complexity
- multiple tasks
- setup times