A Heuristic Algorithm for Crew Scheduling Problems

발견적 승무계획 해법의 연구

This paper presents a heuristic algorithm for a crew scheduling problem with dead head flights. This paper modifies and improves saving method for finding the Multiple Salesman tours in the graph. The results show that the computing time from this algorithm is implemented very much than those from general crew scheduling algorithms by set covering models.