On the computational complexity of (maximum) shift class scheduling
In this paper we consider a generalization of the Fixed Job Scheduling Problem (FSP) which appears in a natural way in the aircraft maintenance process at an airport. A number of jobs has to be carried out, where the main attributes of a job are: a fixed start time, a fixed finish time and a value representing the priority of the job. For carrying out these jobs a number of machines is available. These machines are available in specific time intervals (shifts) only. A job can be carried out by a machine only if the interval between the start time and the finish time of the job is a subinterval of the shift of the machine. Furthermore, the jobs must be carried out in a non-preemptive way and each machine can be carrying out at most one job at the same time.
|Keywords||Air transportation, Computational complexity, Fixed job scheduling|
|Persistent URL||dx.doi.org/10.1016/0377-2217(93)90014-E, hdl.handle.net/1765/6679|
Kroon, L.G., & Kolen, A.W.J.. (1993). On the computational complexity of (maximum) shift class scheduling. European Journal of Operational Research, 138–151. doi:10.1016/0377-2217(93)90014-E