COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING

DOI10.15807/jorsj.39.88zbMath0851.90073OpenAlexW2140129354MaRDI QIDQ4889753

Hoong Chuin Lau

Publication date: 25 November 1996

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.39.88

zbMATH Keywords

manpower schedulingminimum-cost flowfixed-charge networkchange shift assignment problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Theory of organizations, manpower planning in operations research (90B70)

Related Items (4)

Efficient generation of rotating workforce schedules ⋮ Polynomially solvable personnel rostering problems ⋮ Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms ⋮ Counting and enumerating feasible rotating schedules by means of Gröbner bases

This page was built for publication: COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING