License class design: Complexity and algorithms

DOI10.1016/0377-2217(92)90160-BMaRDI QIDQ1207538zbMATH OpenOpenAlexFDO

Authors Leo 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, http://hdl.handle.net/1765/6683

zbMATH Keywords

aircraft maintenance processcapacity planningfixed job schedulingjob scheduling

Mathematics Subject Classification ID

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

Recommendations

• On the computational complexity of (maximum) class scheduling
• On the computational complexity of (maximum) shift class scheduling
• Scheduling of time-shared jet aircraft
• An analysis of shift class design problems
• An approximation algorithm for the license and shift class design problem

Cites work

• A decomposition theorem for partially ordered sets
• An Optimal Solution for the Channel-Assignment Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Max-min matching problems with multiple assignments
• Minimal Resources for Fixed and Variable Job Schedules
• On the complexity of computing the measure of ∪[a _i ,b _i ]
• On the computational complexity of (maximum) class scheduling
• Scheduling jobs with fixed start and end times
• When Is the Classroom Assignment Problem Hard?

Cited in

(8)

• On the computational complexity of (maximum) class scheduling
• Routing trains through railway stations: Complexity issues
• An approximation algorithm for the license and shift class design problem
• An analysis of shift class design problems
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Tactical fixed job scheduling with spread-time constraints
• The optimal cost chromatic partition problem for trees and interval graphs
• Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207538)