License class design: Complexity and algorithms

DOI10.1016/0377-2217(92)90160-BzbMath0770.90035MaRDI QIDQ1207538

Antoon W. J. Kolen, Leo G. Kroon

Publication date: 1 April 1993

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

zbMATH Keywords

job scheduling; capacity planning; fixed job scheduling; aircraft maintenance process

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

90B10: Deterministic network models in operations research

Related Items

Tactical fixed job scheduling with spread-time constraints, Routing trains through railway stations: Complexity issues, An analysis of shift class design problems, Exact and approximation algorithms for the operational fixed interval scheduling problem

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
• A decomposition theorem for partially ordered sets
• 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