Complexity of shop-scheduling problems with fixed number of jobs: a survey.
Peter BruckerYuri N. SotskovFrank WernerPublished in: Math. Methods Oper. Res. (2007)
Keyphrases
- fixed number
- identical parallel machines
- scheduling problem
- processing times
- flowshop
- single machine
- precedence constraints
- setup times
- total tardiness
- parallel machines
- earliness tardiness
- permutation flowshop
- minimizing makespan
- worst case
- maximum lateness
- total weighted tardiness
- optimal scheduling
- np hard
- partial ordering
- identical machines
- parallel machine scheduling problem
- job shop scheduling problem
- space complexity
- sequence dependent setup times
- release dates
- job shop
- job shop scheduling
- single machine scheduling problem
- average case
- parallel computing
- finite number
- limited capacity
- tabu search
- constraint satisfaction problems
- unrelated parallel machines
- computational complexity