The time dependent machine makespan problem is strongly NP-complete.
T. C. Edwin ChengQing DingPublished in: Comput. Oper. Res. (1999)
Keyphrases
- np complete
- flowshop
- batch processing
- np hard
- scheduling problem
- strongly np hard
- scheduling jobs
- randomly generated
- processing times
- minimizing makespan
- unrelated parallel machines
- special case
- constraint satisfaction problems
- single machine
- pspace complete
- computational complexity
- bicriteria
- parallel machines
- optimal solution
- satisfiability problem
- lower bound
- polynomially solvable
- conjunctive queries
- setup times
- phase transition
- approximation algorithms
- sequence dependent setup times
- np complete problems
- open shop
- data sets
- search algorithm
- parallel machine scheduling problem
- database
- bounded treewidth
- release dates
- travel time
- upper bound
- decision problems