A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs.
Mohammad Mahdavi MazdehMansoor SarhadiKhalil S. HindiPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- precedence constraints
- lower bound
- branch and bound
- single machine scheduling problem
- combinatorial optimization
- optimal solution
- np hard
- upper bound
- completion times
- lower bounding
- mixed integer linear programming
- scheduling problem
- linear programming
- objective function
- release dates
- randomly generated problems
- upper bounding