Cyclic Scheduling via Integer Programs with Circular Ones
From MaRDI portal
Publication:3898330
DOI10.1287/opre.28.5.1074zbMath0451.90075OpenAlexW2119874970WikidataQ77474535 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
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items
A rounding algorithm for integer programs, Balancing problems in acyclic networks, Human resources management at a marine container terminal, Optimization-based heuristics for underground mine scheduling, Unnamed Item, MIP reformulations of the probabilistic set covering problem, Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems, Tabu search and iterated local search for the cyclic bottleneck assignment problem, Processes with alternating activities, A class of manpower scheduling problems, Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms, A resource type analysis of the integrated project scheduling and personnel staffing problem, Scheduling workforce relief breaks in advance versus in real-time, On dominating set polyhedra of circular interval graphs, Parametric formulation of the general integer linear programming problem, Static and dynamic source locations in undirected networks, Group control for consent rules with consecutive qualifications, The representation polyhedron of a semiorder., Parametric shortest path algorithms with an application to cyclic staffing, An efficient two-phase algorithm for cyclic days-off scheduling., Nurse rostering problems -- a bibliographic survey., Single-Sink Multicommodity Flow with Side Constraints, A survey of dynamic network flows, Chvátal closures for mixed integer programming problems, Soft car sequencing with colors: lower bounds and optimality proofs, The column-circular, subsets-selection problem: Complexity and solutions, A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row, The minimum shift design problem, The stable set polytope of quasi-line graphs, A heuristic procedure for the crew rostering problem, Minimizing the number of workers in a paced mixed-model assembly line, A faster algorithm for finding minimum Tucker submatrices, Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, A cyclic integer covering problem, Vertex adjacencies in the set covering polyhedron, The cyclical scheduling problem, Approximation algorithms for scheduling unrelated parallel machines, Extensions of coloring models for scheduling purposes, An extension of a theorem of Fulkerson and Gross, Scheduling staff using mixed integer programming, Distance-Preserving Graph Contractions, Combining integer programming and the randomization method to schedule employees, Multicuts and integral multiflows in rings, Cyclic and non-cyclic scheduling of 12h shift nurses by network programming, A comparative evaluation of modeling approaches to the labor shift scheduling problem, Integer Rounding for Polymatroid and Branching Optimization Problems, The integer {k}-domination number of circulant graphs, Total weak unimodularity: Testing and applications, Staff scheduling at the United States postal Service, An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
