COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING

DOI10.15807/JORSJ.39.88zbMATH Open0851.90073OpenAlexW2140129354MaRDI QIDQ4889753FDOQ4889753

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

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

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)

Cited In (8)

• Title not available (Why is that?)
• 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
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
• On the complexity of manpower shift 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)