An acyclic days-off scheduling problem

DOI10.1007/S10288-005-0086-6MaRDI QIDQ862817zbMATH OpenOpenAlexFDO

Authors Marie-Christine Costa, Fethi Jarray, Christophe Picouleau

Publication date 24 January 2007

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-005-0086-6

zbMATH Keywords

discrete tomographymaximum flowworkforce schedulingpolynomial time algorithmacyclic scheduling

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• An efficient two-phase algorithm for cyclic days-off scheduling.
• A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks
• Optimum workforce scheduling under the (14, 21) days-off timetable
• Bounded flexibility in days-on and days-off scheduling
• A 4-DAY OR A 3-DAY WORKWEEKS SCHEDULING PROBLEM WITH A GIVEN WORKFORCE SIZE

Cited in

(9)

• A 4-DAY OR A 3-DAY WORKWEEKS SCHEDULING PROBLEM WITH A GIVEN WORKFORCE SIZE
• A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs
• Off-Day Scheduling with Hierarchical Worker Categories
• An efficient two-phase algorithm for cyclic days-off scheduling.
• Bounded flexibility in days-on and days-off scheduling
• Cyclic scheduling of offweekends
• Solving a multi-objective multi-skilled manpower scheduling model by a fuzzy goal programming approach
• A resource type analysis of the integrated project scheduling and personnel staffing problem
• Complexity results for the horizontal bar packing problem

This page was built for publication: An acyclic days-off scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862817)