Efficient generation of rotating workforce schedules

DOI10.1016/S0166-218X(01)00258-XzbMath0995.90034MaRDI QIDQ1348256

Wolfgang Slany, Johannes Gärtner, Nysret Musliu

Publication date: 15 May 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

searchconstraint satisfactionbacktrackingworkforce scheduling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items

Rostering in a rail passenger carrier ⋮ Efficient generation of rotating workforce schedules ⋮ Efficient shift scheduling in the retail sector through two-stage optimization ⋮ Local search for shift design. ⋮ Counting and enumerating feasible rotating schedules by means of Gröbner bases ⋮ The minimum shift design problem ⋮ Joint employee weekly timetabling and daily rostering: a decision-support tool for a logistics platform ⋮ A branch-and-price approach for integrating nurse and surgery scheduling ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ Instance space analysis for a personnel scheduling problem

Cites Work

• Rotating schedules
• Efficient generation of rotating workforce schedules
• On the complexity of manpower shift scheduling
• The art and science of designing rotating schedules
• On Manpower Scheduling Algorithms
• A Multiple-Shift Workforce Scheduling Model Under the 4-Day Workweek with Weekday and Weekend Labour Demands
• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
• A Three-Day Workweek Multiple-Shift Scheduling Model
• Unnamed Item