Optimal Capacity Scheduling—I

DOI10.1287/opre.10.4.518zbMath0113.14301OpenAlexW4251826469MaRDI QIDQ3850363

Arthur F. jun. Veinott, Wagner, Harvey M.

Publication date: 1962

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

applications of probability theory and statistics

Related Items

Constraint programming and operations research, Optimal capacity expansion, Set covering with almost consecutive ones property, Convex hull characterizations of lexicographic orderings, Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms, Exact algorithms and applications for tree-like Weighted Set Cover, Three generalizations of the FOCUS constraint, On a generalization of Horn constraint systems, Analyzing fractional Horn constraint systems, A survey of dynamic network flows, Rounding to an integral program, A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row, Tree decompositions of graphs: saving memory in dynamic programming, The minimum shift design problem, Optimal switching between cash-flow streams, A faster algorithm for finding minimum Tucker submatrices, Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, Red-blue covering problems and the consecutive ones property, The practical conversion of linear programmes to network flow models, Fourier-Motzkin elimination and its dual, Representing inverses in pure network flow optimization