• Korean Management Science Review
• /
• v.21 no.1
• /
• pp.39-55
• /
• 2004

Efficient crew scheduling for cockpit crew is important in airline industry due to operational safety and cost associated with the flight duty time. Because of complexity of regulations imposed to the cockpit crew. it is complicated to generate an efficient schedule. Schedule of cockpit crew can be generated through two steps; selecting of flight patterns. and scheduling of them to the specific time horizon. Heuristic method is developed and applied with massive data in a limited time of computation. A set of flight patterns is selected from all possible flight patterns. which are generated by composing the flight leg based on regulations. by using the set partitioning problem with objective function of oversea stay cost. The selected set of flight patterns found at the first step is allocated to 4 week crew schedule to minimize the variance of total fight time assigned to each crew. The crew schedules obtained are evaluated and compared with the ones currently used in one of major airline company.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.67-86
• /
• 2002

This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

• Journal of the military operations research society of Korea
• /
• v.15 no.1
• /
• pp.28-43
• /
• 1989

Squadron crew scheduling problems can be defined as the assignment of crews to flights consistent with safety regulations and squadron policy. In this paper, the daily crew scheduling problems are formulated as zero-one interger programs known as generalized assignment problems. The objective function is to maximize the weighted mission interval to improve the crew performance. Flight schedules using the 0-1 integer model are compared with manual schedules. The results of the study show that the average crew performance is improved.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.9 no.13
• /
• pp.79-86
• /
• 1986

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.

• 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.

• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.155-163
• /
• 1985

This paper presents a heuristic algorithm for a multidepot aircraft scheduling and crew scheduling with deal-head flights. This algorithm is extended from a Greedy heuristic algorithm for a multi-depot multi-salesman traveling salesman problem. We first transform a given flight schedule into a multi-depot multi-traveling salesman problem, considering aircraft flight policies and crew management constraints. Then we solve this problem by applying a modified Greedy heuristic algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.2
• /
• pp.89-96
• /
• 2007

The object-based reservation scheduling techniques are to solve complex scheduling problems using constraint satisfaction problems and object-oriented concepts. We have tried to apply the object-based reservation scheduling techniques to the flight operation scheduling problems. For crew's satisfaction, we have considered the total crew's preferences board in the flight operation scheduling. To consider the over all satisfaction, the events of every object are alloted to the board along its priority. Constraints to reservation scheduling are classified to global and local. The definition of board and information of every event are global constraints and the preferences to object's board slots are local constraints. Actually, we have made an experiment on flight operation scheduling in order to raise crew's satisfaction.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.169-173
• /
• 2015

The linear scheduling method or line-of-balance (LOB) is a popular choice for projects that involve repetitive tasks during project execution. The method, however, produces deterministic schedule that does not convey a range of potential project outcomes under uncertainty. This results from the fact the basic scheduling parameters such as crew production rates are estimated to be deterministic based on single-point value inputs. The current linear scheduling technique, therefore, lacks the capability of reflecting the fluctuating nature of the project operation. In this paper the authors address the issue of how the variability of operation and production rates affects schedule outcomes and show a more realistic description of what might be a realistic picture of typical projects. The authors provide a solution by providing a more effective and comprehensive way of incorporating the crew performance variability using a Monte Carlo simulation technique. The simulation outcomes are discussed in terms of how this stochastic approach can overcome the shortcomings of the conventional linear scheduling technique and provide optimum schedule solutions.