Cyclic Scheduling via Integer Programs with Circular Ones
From MaRDI portal
Cited in
(54)- Combining integer programming and the randomization method to schedule employees
- Multicuts and integral multiflows in rings
- Processes with alternating activities
- Parametric shortest path algorithms with an application to cyclic staffing
- 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
- An efficient two-phase algorithm for cyclic days-off scheduling.
- Nurse rostering problems -- a bibliographic survey.
- A comparative evaluation of modeling approaches to the labor shift scheduling problem
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
- An extension of a theorem of Fulkerson and Gross
- Staff scheduling at the United States postal Service
- Human resources management at a marine container terminal
- Parametric formulation of the general integer linear programming problem
- The representation polyhedron of a semiorder.
- The column-circular, subsets-selection problem: Complexity and solutions
- Minimizing the number of workers in a paced mixed-model assembly line
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A cyclic integer covering problem
- A resource type analysis of the integrated project scheduling and personnel staffing problem
- The minimum shift design problem
- On dominating set polyhedra of circular interval graphs
- Group control for consent rules with consecutive qualifications
- Single-Sink Multicommodity Flow with Side Constraints
- Optimization-based heuristics for underground mine scheduling
- A polynomial-time algorithm for finding a minimal conflicting set containing a given row
- Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems
- Integer Rounding for Polymatroid and Branching Optimization Problems
- An O(n^2 ) Algorithm for Coloring Proper Circular Arc Graphs
- A class of manpower scheduling problems
- scientific article; zbMATH DE number 7141490 (Why is no real title available?)
- Distance-Preserving Graph Contractions
- The integer \(\{k\}\)-domination number of circulant graphs
- On a variant of Flory model
- The \textsc{Days On Days Off Scheduling Problem}
- A faster algorithm for finding minimum Tucker submatrices
- Scheduling electric vehicle regular charging tasks: a review of deterministic models
- Vertex adjacencies in the set covering polyhedron
- The cyclical scheduling problem
- Approximation algorithms for scheduling unrelated parallel machines
- Total weak unimodularity: Testing and applications
- MIP reformulations of the probabilistic set covering problem
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Scheduling workforce relief breaks in advance versus in real-time
- Static and dynamic source locations in undirected networks
- 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 stable set polytope of quasi-line graphs
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
This page was built for publication: Cyclic Scheduling via Integer Programs with Circular Ones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898330)