On the computational complexity of (maximum) shift class scheduling
From MaRDI portal
Publication:684343
DOI10.1016/0377-2217(93)90014-EzbMath0776.90038OpenAlexW2582423026MaRDI QIDQ684343
Antoon W. J. Kolen, Leo G. Kroon
Publication date: 15 September 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90014-e
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
An analysis of shift class design problems ⋮ Scheduling jobs within time windows on identical parallel machines: New model and algorithms ⋮ Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach ⋮ Routing trains through railway stations: Complexity issues
Cites Work
- Scheduling jobs with fixed start and end times
- On the computational complexity of (maximum) class scheduling
- Max-min matching problems with multiple assignments
- An Optimal Solution for the Channel-Assignment Problem
- When Is the Classroom Assignment Problem Hard?
- Minimal Resources for Fixed and Variable Job Schedules
- On the complexity of computing the measure of ∪[a i ,b i ]
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the computational complexity of (maximum) shift class scheduling
