A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile.
Cheng-I YangJia-Shung WangRichard Chia-Tung LeePublished in: Comput. Oper. Res. (1989)
Keyphrases
- precedence constraints
- branch and bound algorithm
- scheduling problem
- maximum lateness
- single machine scheduling problem
- release dates
- strongly np hard
- mixed integer linear programming
- flowshop
- integer variables
- np hard
- lower bound
- sequence dependent setup times
- branch and bound
- processing times
- setup times
- identical parallel machines
- single machine
- optimal solution
- upper bound
- finding an optimal solution
- combinatorial optimization
- lower bounding
- dominance rules
- upper bounding
- global constraints
- randomly generated problems
- branch and bound method
- shortest processing time
- scheduling decisions
- lagrangian relaxation
- partially ordered
- parallel machines
- resource constraints
- approximation algorithms
- partial order
- tabu search
- completion times
- variable ordering
- linear programming
- neural network
- integer program
- max sat
- minimizing makespan
- metaheuristic