A new approximation algorithm for UET-Scheduling with chain-type precedence constraints.
Jiye HanJianjun WenGuochuan ZhangPublished in: Comput. Oper. Res. (1998)
Keyphrases
- precedence constraints
- np hard
- dynamic programming
- scheduling problem
- parallel processors
- parallel machines
- search space
- image segmentation
- worst case
- vertex cover
- branch and bound algorithm
- linear programming
- probabilistic model
- objective function
- simulated annealing
- cost function
- space complexity
- lower bound
- job shop scheduling problem
- computational complexity
- optimal solution
- release dates