Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs.
H. A. J. CrauwelsChris N. PottsDirk Van OudheusdenLuk N. Van WassenhovePublished in: J. Sched. (2005)
Keyphrases
- branch and bound algorithm
- number of late jobs
- single machine scheduling problem
- precedence constraints
- completion times
- release times
- release dates
- single machine
- lower bound
- branch and bound
- scheduling problem
- np hard
- setup times
- sequence dependent setup times
- upper bound
- optimal solution
- maximum lateness
- combinatorial optimization
- search tree
- processing times
- set covering problem
- flowshop
- total tardiness
- scheduling jobs
- lagrangian relaxation
- finding an optimal solution
- boolean satisfiability
- cost function
- search algorithm
- learning effect
- weighted sum
- dynamic programming