Branch and Bound Methods for Multi-Item Scheduling
From MaRDI portal
Publication:3920978
DOI10.1287/opre.29.5.853zbMath0467.90035OpenAlexW2036743250MaRDI QIDQ3920978
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
resource allocationcombinatorial problemscomputational resultsbranch and bound methodsblock angular structuremulti-item activity scheduling
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Related Items
The reduced cost branch and bound algorithm for mixed integer programming ⋮ A heuristic for multiple choice programming ⋮ On the calculation of true and pseudo penalties in multiple choice integer programming ⋮ Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming ⋮ A note on modeling multiple choice requirements for simple mixed integer programming solvers ⋮ An ideal column algorithm for integer programs with special ordered sets of variables ⋮ A dynamic programming algorithm for multiple-choice constraints
This page was built for publication: Branch and Bound Methods for Multi-Item Scheduling
