Branch and Bound Methods for Multi-Item Scheduling

DOI10.1287/OPRE.29.5.853MaRDI QIDQ3920978zbMATH OpenOpenAlexFDO

Authors Dennis J. Sweeney, Richard A. Murphy

Publication date 1981

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.29.5.853

zbMATH Keywords

resource allocationcombinatorial problemscomputational resultsbranch and bound methodsblock angular structuremulti-item activity scheduling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(8)

• A heuristic for multiple choice programming
• Computational comparison on the partitioning strategies in multiple choice integer programming
• An ideal column algorithm for integer programs with special ordered sets of variables
• A note on modeling multiple choice requirements for simple mixed integer programming solvers
• On the calculation of true and pseudo penalties in multiple choice integer programming
• Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
• A dynamic programming algorithm for multiple-choice constraints
• The reduced cost branch and bound algorithm for mixed integer programming

This page was built for publication: Branch and Bound Methods for Multi-Item Scheduling

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