A simulated annealing approach to the cyclic staff-scheduling problem

DOI<69::AID-NAV3220400105>3.0.CO;2-H 10.1002/1520-6750(199302)40:1<69::AID-NAV3220400105>3.0.CO;2-HzbMath0769.90056OpenAlexW2030235767MaRDI QIDQ4695782

Larry W. Jacobs, Michael J. Brusco

Publication date: 29 June 1993

Full work available at URL: https://doi.org/10.1002/1520-6750(199302)40:1<69::aid-nav3220400105>3.0.co;2-h

zbMATH Keywords

simulated annealingbranch-and- boundNP-complete cyclic staff-scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Theory of organizations, manpower planning in operations research (90B70)

Related Items (23)

\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care ⋮ A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis ⋮ A microcomputer-based heuristic for tour scheduling of a mixed workforce ⋮ Scheduling workforce relief breaks in advance versus in real-time ⋮ A simulated-annealing heuristic for shift scheduling using non-continuously available employees ⋮ Metaheuristics: A bibliography ⋮ Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations ⋮ An efficient two-phase algorithm for cyclic days-off scheduling. ⋮ Scheduling trainees at a hospital department using a branch-and-price approach ⋮ Analysis of three mathematical models of the staff rostering problem ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ A Pareto-based search methodology for multi-objective nurse scheduling ⋮ Temporary workforce planning with firm contracts: a model and a simulated annealing heuristic ⋮ Starting-time decisions in labor tour scheduling: An experimental analysis and case study ⋮ An integer programming model for the weekly tour scheduling problem ⋮ A distributed genetic algorithm for deterministic and stochastic labor scheduling problems ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ A sequential integer programming method for discontinuous labor tour scheduling ⋮ Combining integer programming and the randomization method to schedule employees ⋮ A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems ⋮ A genetic algorithm for scheduling staff of mixed skills under multi-criteria ⋮ Variable employee productivity in workforce scheduling ⋮ Nurse scheduling with tabu search and strategic oscillation

Cites Work

• Unnamed Item
• Tabu Search—Part I
• Tabu Search—Part II

This page was built for publication: A simulated annealing approach to the cyclic staff-scheduling problem