Login / Signup

Comparison of Different Variable and Value Order Strategies for the Optimum Solution of a Single Machine Scheduling Problem with Sequence-Dependent Setups.

Seyda TopalogluIrem Ozkarahan
Published in: ISCIS (2004)
Keyphrases
  • single machine scheduling problem
  • computational complexity
  • branch and bound algorithm