CONTROL MODEL FOR GROUND CREW SCHEDULING PROBLEM AT SMALL AIRPORTS: CASE OF SERBIA

Present-day airline industry is quite a competitive field and crew scheduling represents one of the crucial problems due to significant impact on the airline’s cost. The crew scheduling problem is based on the assignment of crew members to operate different tasks of route. The main goal of this paper is to provide an analysis and a solution to one of the biggest problems detected on a small airport in the Serbia - the problem of ground crew scheduling. The paper presents the main characteristics, goals and limitations of a real-life problem identified at this small airport. In order to solve the problem, we developed a dynamic discrete simulation model. The model is developed in a spreadsheet environment of Microsoft Excel. Some of the main limitations found in the development of the model are strong constraints and multiple goals. The model presented in the paper is designed as a useful management tool for smaller airports and is aimed at the improvement of operative processes.

Applying Constraint Programming and Integer Programming to Solve the Crew Scheduling Problem for Railroad Systems: Model Formulation and a Case Study

Crew scheduling is one of the crucial processes in railroad operation planning. Based on current regulations and working and break time requirements, as well as the operational rules, this process aims to find a duty arrangement with minimal cost that covers all trips. Most past studies considered this subject for railroad systems as an optimization problem and solved it with mathematical programming-based methods or heuristic algorithms, despite numerous logical constraints embedded in this problem. Few studies have applied constraint programming (CP) approaches to tackle the railroad crew scheduling problem. This paper proposes a hybrid approach to solve the problem with a CP model for duty generation, and an integer programming model for duty optimization. These models have been applied to the Kaohsiung depot of Taiwan Railways Administration, the largest railroad operator in Taiwan. The encouraging results show that the proposed approach is more efficient than the manual process and can achieve 30% savings of driver cost. Moreover, the approach is robust and provides flexibility to easily accommodate related operational concerns such as minimizing the number of overnight duties. Thus, this hybrid two-phase approach seems to have the potential for applications to the railroad crew scheduling problems outside Taiwan.