License class design: Complexity and algorithms

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

Leo G. Kroon, Antoon W. J. Kolen

Publication date: 1 April 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(92)90160-b

zbMATH Keywords

job schedulingcapacity planningfixed job schedulingaircraft maintenance process

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (4)

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

Cites Work

• Unnamed Item
• 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 ]

This page was built for publication: License class design: Complexity and algorithms