A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times.
Mohammad Mahdavi MazdehMansoor SarhadiKhalil S. HindiPublished in: Comput. Oper. Res. (2008)
Keyphrases
- release times
- branch and bound algorithm
- single machine scheduling problem
- deteriorating jobs
- precedence constraints
- release dates
- lower bound
- completion times
- branch and bound
- upper bound
- optimal solution
- sequence dependent setup times
- np hard
- combinatorial optimization
- lower bounding
- single machine
- setup times
- lagrangian relaxation
- maximum lateness
- online algorithms
- processing times
- scheduling problem
- worst case
- batch processing
- identical machines
- search space
- search algorithm