A class of manpower scheduling problems

DOI10.1007/BF01541035zbMath0764.90041MaRDI QIDQ4000927

Raffaele Cerulli, Manlio Gaudioso, R. Mautone

Publication date: 26 September 1992

Published in: ZOR Zeitschrift für Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

zbMATH Keywords

manpower scheduling; heuristic methods; necessary and sufficient conditions of existence

Mathematics Subject Classification ID

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

90B70: Theory of organizations, manpower planning in operations research

Related Items

Human resources management at a marine container terminal, Team-building with answer set programming in the Gioia-Tauro seaport

Cites Work

• Unnamed Item
• A network model for nursing staff scheduling
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem
• Cyclic Scheduling via Integer Programs with Circular Ones
• On Manpower Scheduling Algorithms
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Nurse Scheduling Using Mathematical Programming
• Unnetworks, with Applications to Idle Time Scheduling
• Optimal Scheduiing of Two Consecutive Idle Periods