A branch and bound to minimize the number of late jobs on a single machine with release time constraints.
Philippe BaptisteLaurent PéridyEric PinsonPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- number of late jobs
- branch and bound
- single machine
- release times
- branch and bound algorithm
- single machine scheduling problem
- lower bound
- completion times
- scheduling problem
- search algorithm
- column generation
- search space
- optimal solution
- upper bound
- combinatorial optimization
- precedence constraints
- processing times
- release dates
- total tardiness
- learning effect
- scheduling jobs
- lower and upper bounds
- competitive ratio
- sequence dependent setup times
- constraint satisfaction
- objective function
- integer program
- dynamic programming
- constraint programming
- setup times