Login / Signup

Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time.

H. A. J. CrauwelsA. M. A. HaririChris N. PottsLuk N. Van Wassenhove
Published in: Ann. Oper. Res. (1998)
Keyphrases
  • branch and bound algorithm
  • orders of magnitude
  • branch and bound
  • np hard
  • combinatorial optimization
  • search tree
  • set covering problem