License class design: complexity and algorithms
In this paper a generalization of the Fixed Job Scheduling Problem (FSP) is considered, which appears in the aircraft maintenance process at an airport. A number of jobs have to be carried out, where the main attributes of a job are a fixed start time, a fixed finish time and an aircraft type. For carrying out these jobs a number of engineers are available. An engineer is allowed to carry out a specific job only if he has a license for the corresponding aircraft type. Furthermore, the jobs must be carried out in a non-preemptive way and each engineer can be carrying out at most one job at the same time. Within this setting natural questions to be answered ask for the minimum number of engineers required for carrying out all jobs or, more generally, for the minimum total costs for hiring engineers. In this paper a complete classification of the computational complexity of two classes of mathematical problems related to these practical questions is given. Furthermore, it is shown that the polynomially solvable cases of these problems can be solved by a combination of Linear Programming and Network Flow algorithms.
|Keywords||Capacity planning, computational complexity, fixed job intervals, job scheduling|
|Persistent URL||dx.doi.org/10.1016/0377-2217(92)90160-B, hdl.handle.net/1765/6683|
Kroon, L.G., & Kolen, A.W.J.. (1992). License class design: complexity and algorithms. European Journal of Operational Research, 432–444. doi:10.1016/0377-2217(92)90160-B