A 4-DAY OR A 3-DAY WORKWEEKS SCHEDULING PROBLEM WITH A GIVEN WORKFORCE SIZE

DOI10.1142/S0217595909002419zbMath1178.90153OpenAlexW2088366970MaRDI QIDQ5850791

Fethi Jarray

Publication date: 15 January 2010

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595909002419

zbMATH Keywords

maximum flowworkforce schedulingdays-off scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Shift rostering using decomposition: assign weekend shifts first ⋮ A graph-based formulation for the shift rostering problem

Cites Work

• An acyclic days-off scheduling problem
• Four-day workweek scheduling with two or three consecutive days off
• Staff scheduling and rostering: a review of applications, methods and models.
• Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
• Workforce Scheduling with Cyclic Demands and Day-Off Constraints
• Optimal Scheduiing of Two Consecutive Idle Periods