An acyclic days-off scheduling problem

DOI10.1007/s10288-005-0086-6zbMath1106.60074OpenAlexW2084667431MaRDI QIDQ862817

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

polynomial time algorithmdiscrete tomographymaximum flowworkforce schedulingacyclic scheduling

Mathematics Subject Classification ID

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

Related Items (5)

A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs ⋮ A resource type analysis of the integrated project scheduling and personnel staffing problem ⋮ Solving a multi-objective multi-skilled manpower scheduling model by a fuzzy goal programming approach ⋮ Complexity results for the horizontal bar packing problem ⋮ A 4-DAY OR A 3-DAY WORKWEEKS SCHEDULING PROBLEM WITH A GIVEN WORKFORCE SIZE

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