Cyclic Scheduling via Integer Programs with Circular Ones
From MaRDI portal
Publication:3898330
DOI10.1287/opre.28.5.1074zbMath0451.90075WikidataQ77474535 ScholiaQ77474535MaRDI QIDQ3898330
James B. Orlin, John J. III Bartholdi, H. Donald Ratliff
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5bfa2651f165f8d2702a4674e29b42b00ad0aab2
cyclic scheduling; special structure; network flow problems; cyclically structured 0-1 constraint matrix
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
90C09: Boolean programming
Related Items
A heuristic procedure for the crew rostering problem, Extensions of coloring models for scheduling purposes, Scheduling staff using mixed integer programming, Cyclic and non-cyclic scheduling of 12h shift nurses by network programming, A rounding algorithm for integer programs, Balancing problems in acyclic networks, A comparative evaluation of modeling approaches to the labor shift scheduling problem, An extension of a theorem of Fulkerson and Gross, Parametric formulation of the general integer linear programming problem, The column-circular, subsets-selection problem: Complexity and solutions, A class of manpower scheduling problems
