• Title/Summary/Keyword: crew rostering problem

Search Result 3, Processing Time 0.02 seconds

A study on the crew roster scheduling (승무원 교번 작성에 관한 연구)

  • 김영훈;김지표
    • Proceedings of the KSR Conference
    • /
    • 2000.11a
    • /
    • pp.86-92
    • /
    • 2000
  • The crew operation scheduling problem is divided into duty generation and duty allocation. The railway crew roster scheduling(duty allocation) is developed monthly for each crew's office, considering the car types and crew's driving ability. However, it is very difficult to make schedules which assign monthly working hours to each crew evenly. The purpose of this thesis is to minimize the differences between each crew's total duty times and make a rostering table. To minimize the differences among monthly working hours of each crews are grouped according to car type and crew's driving ability and a rostering table which could be shared by the group members is developed. Our approach is to apply the techniques of Constraint Programming in order to solve such problems efficiently. This algorithm is suitable to solve optimization problems which involve many complicated constraints. And including the concept of cost, we suggested the model which enable to make the rostering table with a minimum personnel.

  • PDF

A Study on Korean Railroad Crew Rostering Problem (철도 승무원 교번표의 운행 사업 배치 문제에 관한 연구)

  • Yang, Tae-Yong;Kim, Young-Hoon;Lee, Dong-Ho
    • Journal of the Korean Society for Railway
    • /
    • v.9 no.2 s.33
    • /
    • pp.206-211
    • /
    • 2006
  • This thesis presents railroad crew restoring problem, which is to determine the railroad plan allocation. This problem is constructed that determine the sequence of duties that railroad crews have to perform. We analyze characteristic of this problem and railroad industry. It's hard to consider many constraint conditions. We propose Integer Programming model and easy methodology to be considered all given operation rules. This problem is known to be NP-hard. We develop a genetic algorithm, which is proved to be powerful in solving optimization problems. We proposed the effective mathematical model and algorithm about making crew restoring in real industry.

A Mathematical Model for Airline Ground Crew Scheduling Problem (항공사 지상직 승무원 근무 당번표 작성문제)

  • Ko, Young Dae;Oh, Yonghui
    • Korean Management Science Review
    • /
    • v.29 no.3
    • /
    • pp.183-192
    • /
    • 2012
  • For the past several decades, personnel scheduling and rostering problem has been one of the most popular research topics in optimization area. Among the numerous applications, airline (aviation) industry has been given most attention due to the economic scale and impact. Most of the literatures about the staff scheduling problem in airline industry are dealing with the air crew, pilots and flight attendances, and the rest of the literatures are about the ground staff, by whom cleaning, maintenance, fueling of aircraft and handling luggage are done from landing to taking off. None of the literatures found by the authors are dealing with the airline ground crew. In this paper roster of airline ground crew, who is responsible for issuing boarding pass, checking baggage, etc, is introduced, formulated and solved using CPLEX. Some expressions of the mathematical formulations, which are not suitable input format of the CPLEX, were transformed. Numerical examples are presented for the validation of proposed scheduling system.