A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering

DOI10.1287/opre.29.3.501zbMath0466.90037OpenAlexW2079052655MaRDI QIDQ3919436

John J. III Bartholdi

Publication date: 1981

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

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

zbMATH Keywords

set coveringNP-completebound on the absolute errorcyclic staff schedulinground-off heuristic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (29)

Working set generation methods for labor tour scheduling ⋮ Near-optimal MIP solutions for preference based self-scheduling ⋮ Some complexity results in cyclic scheduling ⋮ Workforce planning incorporating skills: state of the art ⋮ A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern ⋮ A finite procedure to generate feasible points for the extreme point mathematical programming problem ⋮ Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms ⋮ A resource type analysis of the integrated project scheduling and personnel staffing problem ⋮ A binary cat swarm optimization algorithm for the non-unicost set covering problem ⋮ A binary-rounding heuristic for multi-period variable-task-duration assignment problems ⋮ Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations ⋮ Scheduling Security Personnel for the Vancouver 2010 Winter Olympic Games ⋮ An efficient two-phase algorithm for cyclic days-off scheduling. ⋮ Modelling a nurse shift schedule with multiple preference ranks for shifts and days-off ⋮ Absolute bounds on optimal cost for a class of set covering problems ⋮ A branch-and-price approach for large-scale employee tour scheduling problems ⋮ A heuristic procedure for the crew rostering problem ⋮ Enhancing an algorithm for set covering problems ⋮ Implicit shift scheduling with multiple breaks and work stretch duration restrictions ⋮ A cyclic integer covering problem ⋮ Set covering approach for reconstruction of sibling relationships ⋮ A distributed genetic algorithm for deterministic and stochastic labor scheduling problems ⋮ Approximation algorithms for scheduling unrelated parallel machines ⋮ Solving the non-unicost set covering problem by using cuckoo search and black hole optimization ⋮ A sequential integer programming method for discontinuous labor tour scheduling ⋮ Heuristic methods and applications: A categorized survey ⋮ A genetic algorithm for scheduling staff of mixed skills under multi-criteria ⋮ A comparative evaluation of modeling approaches to the labor shift scheduling problem ⋮ A parallel genetic algorithm to solve the set-covering problem

This page was built for publication: A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering