Adapting Branch-and-Bound for Real-World Scheduling Problems
From MaRDI portal
Publication:5289663
DOI10.1057/jors.1993.84zbMath0774.90048MaRDI 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
heuristics; scheduling; branch-and-bound; sequencing; 0-1 integer programs; real-world scheduling; depth and breadth tolerance
Related Items
Experimental analysis of approximation algorithms for the vertex cover and set covering problems, A new lower bounding rule for permutation flow shop scheduling
Uses Software