NP-hardness of Shop-scheduling Problems with Three Jobs.
Yuri N. SotskovNatalia V. ShakhlevichPublished in: Discret. Appl. Math. (1995)
Keyphrases
- np hardness
- scheduling problem
- np hard
- flowshop
- processing times
- permutation flowshop
- identical parallel machines
- single machine
- setup times
- total tardiness
- precedence constraints
- parallel machines
- earliness tardiness
- parallel machine scheduling problem
- strongly np hard
- minimizing makespan
- identical machines
- sequence dependent setup times
- approximation algorithms
- limited capacity
- release dates
- maximum lateness
- special case
- lower bound
- optimal scheduling
- tabu search
- worst case analysis
- optimal solution
- worst case
- single machine scheduling problem
- completion times
- linear programming
- greedy heuristic
- branch and bound algorithm
- list scheduling
- job shop
- mixed integer
- discrete tomography
- dynamic environments
- particle swarm optimization
- upper bound
- multi agent
- bayesian networks
- genetic algorithm