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

DOI10.1057/JORS.1993.84MaRDI QIDQ5289663zbMATH OpenOpenAlexFDO

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

Publication date 14 November 1993

Published in The 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

0-1 integer programsbranch-and-bounddepth and breadth toleranceheuristicsreal-world schedulingschedulingsequencing

Mathematics Subject Classification ID

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

Recommendations

• Strategies for LP-based solving a general class of scheduling problems
• A branch and bound algorithm for the job-shop scheduling problem
• A branch and bound algorithm for the response time variability problem
• Revisiting branch and bound search strategies for machine scheduling problems
• An enhanced branch-and-bound algorithm for the talent scheduling problem

Cited in

(4)

• Experimental analysis of approximation algorithms for the vertex cover and set covering problems
• A new lower bounding rule for permutation flow shop scheduling
• scientific article; zbMATH DE number 1953192 (Why is no real title available?)
• Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners

Describes a project that uses

Uses Software

• LINDO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289663)