Abstract
Many sequencing and scheduling problems can be formulated as 0-1 integer programs and, in theory, solved using a branch-and-bound approach. In practice, real-world instances of these problems are usually solved using heuristics. In this paper we demonstrate the benefits of incorporating an intuitive, user-controlled variable-tolerance into a depth-first branch-and-bound algorithm. The tolerance comprises two components: a variable depth tolerance and a variable breadth tolerance. A sample scheduling problem is thoroughly analysed to illustrate empirically parameter impact on solution quality and execution time. Then, results based on several real-world problems are discussed.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vasko, F., Wolf, F., Stott, K. et al. Adapting Branch-and-Bound for Real-World Scheduling Problems. J Oper Res Soc 44, 483–490 (1993). https://doi.org/10.1057/jors.1993.84
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1993.84