COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING

DOI10.15807/JORSJ.39.88MaRDI QIDQ4889753zbMATH OpenOpenAlexFDO

Authors 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

minimum-cost flowmanpower schedulingfixed-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)

Recommendations

• scientific article; zbMATH DE number 1555983
• On the complexity of manpower shift scheduling
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
• scientific article; zbMATH DE number 978509
• A class of manpower scheduling problems

Cited in

(8)

• scientific article; zbMATH DE number 1555983 (Why is no real title available?)
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
• Efficient generation of rotating workforce schedules
• Counting and enumerating feasible rotating schedules by means of Gröbner bases
• Polynomially solvable personnel rostering problems
• On the complexity of manpower shift scheduling
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
• The minimum shift design problem: theory and practice

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

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