Adapting Branch-and-Bound for Real-World Scheduling Problems

DOI10.1057/jors.1993.84zbMath0774.90048OpenAlexW1984691800MaRDI QIDQ5289663

Francis J. Vasko, L. R. Woodyatt, Kenneth L. jun. Stott, Floyd E. Wolf

Publication date: 14 November 1993

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1993.84

zbMATH Keywords

heuristicsschedulingbranch-and-boundsequencing0-1 integer programsreal-world schedulingdepth and breadth tolerance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items (3)

Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ Experimental analysis of approximation algorithms for the vertex cover and set covering problems

Uses Software

• LINDO

This page was built for publication: Adapting Branch-and-Bound for Real-World Scheduling Problems