A simulated-annealing heuristic for shift scheduling using non-continuously available employees

DOI10.1016/0305-0548(95)00012-7zbMath0855.90073OpenAlexW1976288392MaRDI QIDQ1919204

Gary M. Thompson

Publication date: 1 August 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/72121

zbMATH Keywords

shift scheduleslabor-schedulingsimulated-annealing heuristic

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (16)

Workforce scheduling with multiple objectives ⋮ Selecting and adapting weekly work schedules with working time accounts: a case of a retail clothing chain ⋮ A Benders decomposition-based matheuristic for the cardinality constrained shift design problem ⋮ Scheduling workforce relief breaks in advance versus in real-time ⋮ Metaheuristics: A bibliography ⋮ First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ Nurse rostering problems -- a bibliographic survey. ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ Solution approaches to large shift scheduling problems ⋮ A Pareto-based search methodology for multi-objective nurse scheduling ⋮ Temporary workforce planning with firm contracts: a model and a simulated annealing heuristic ⋮ A distributed genetic algorithm for deterministic and stochastic labor scheduling problems ⋮ A self-adaptive biogeography-based algorithm to solve the set covering problem ⋮ Variable employee productivity in workforce scheduling ⋮ Nurse preference rostering using agents and iterated local search ⋮ Nurse scheduling with tabu search and strategic oscillation

Uses Software

• GAMS
• OSL

Cites Work

• A simulated annealing approach to the cyclic staff-scheduling problem

This page was built for publication: A simulated-annealing heuristic for shift scheduling using non-continuously available employees