Pre-processing techniques for resource allocation in the heterogeneous case

DOI10.1016/S0377-2217(97)00340-8zbMath0941.90052OpenAlexW2070870333MaRDI QIDQ1296109

M. Sacramento Quintanilla, Vicente Valls, Maria Angelés Pérez

Publication date: 23 September 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00340-8

zbMATH Keywords

resource allocationpreprocessingmacroactivities

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Operations research and management science (90B99)

Related Items (1)

The maximum balanced subgraph of a signed graph: applications and solution approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Scheduling jobs with fixed start and end times
• A graph colouring model for assigning a heterogeneous workforce to a given schedule
• The Fixed Job Schedule Problem with Working-Time Constraints
• Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
• Graph coloring conditions for the existence of solutions to the timetable problem

This page was built for publication: Pre-processing techniques for resource allocation in the heterogeneous case