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