A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time.
Ghaith RabadiMansooreh MollaghasemiGeorgios C. AnagnostopoulosPublished in: Comput. Oper. Res. (2004)
Keyphrases
- scheduling problem
- branch and bound algorithm
- flowshop
- np hard
- strongly np hard
- precedence constraints
- single machine
- shortest processing time
- lower bound
- parallel machines
- sequence dependent setup times
- dominance rules
- minimizing makespan
- single machine scheduling problem
- setup times
- optimal solution
- processing times
- branch and bound
- tabu search
- lower bounding
- upper bound
- maximum lateness
- upper bounding
- approximation algorithms
- randomly generated problems
- release dates
- special case
- combinatorial optimization
- completion times
- neural network
- computational complexity
- search algorithm
- finding an optimal solution
- integer programming
- variable ordering
- linear programming
- max sat
- lower and upper bounds
- tardiness cost