The minimum shift design problem: theory and practice

DOI10.1007/B13632MaRDI QIDQ5897279zbMATH OpenOpenAlexFDO

Authors Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The minimum shift design problem
• Local search for shift design.
• Modeling and solving a real-life multi-skill shift design problem
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING

Cited in

(6)

• An approximation algorithm for the license and shift class design problem
• Local search for shift design.
• Modelling and solving the minimum shift design problem
• Modeling and solving a real-life multi-skill shift design problem
• The minimum shift design problem
• A Benders decomposition-based matheuristic for the cardinality constrained shift design problem

This page was built for publication: The minimum shift design problem: theory and practice

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