• Korean Journal of Community Nutrition
• /
• v.12 no.5
• /
• pp.630-638
• /
• 2007

The purpose of this study is to investigate an efficient use of labor in personnel scheduling for the restaurant industry. More specifically, this study attends to reduce overall labor cost while not sacrificing both full-time and part-time employees' schedules. The customers' demands were measured by sales in this analysis. Historically, server scheduling in the restaurant has been practiced by manager's experience and intuition; however, those practices provided drawbacks because managers often fail to consider external factors such as a employees' working conditions and change in a restaurant's size. The result of a new method in personnel scheduling provided significant cost saving compared to a previous scheduling technique. This study found that a new method in personnel scheduling allowed the restaurant to save labor cost. The outcome of this study should of for important strategic implication for the restaurant managers.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.26
• /
• pp.21-31
• /
• 1992

Today, manpower is used as a major factor in the production of service industry that is on the increasing trend. So the research on manpower structure have been regarded as a important field. The research on personnel scheduling, however, have got de-emphasizeed as compared wi th the field of manufacturing scheduling. As the increasing trend of service industry, an appropriate personnel scheduling for each type of service industry is needed urgently. This paper deals with nurse scheduling problem in the field of personnel scheduling. We aim at developing prototype of the expert nurse scheduling program which is easy to use when scheduling without help of expert, and satisfies the various request of hospital scheduling policy and nurse scheduling.

• Journal of Korean Academy of Nursing Administration
• /
• v.2 no.2
• /
• pp.73-83
• /
• 1996

Scheduling for nursing personnel involves many factors and requirements. Therefore, manual scheduling requires much time and effort to produce an adequate schedule. This paper introduces a PC based nurse scheduling support system which was developed in Microsoft Access 2.0, an easy to use data base management tool. First step of this system is to determine necessary number of nursing personnel by medical law or by patient classification. Current Korean medical law stipulates that number of patients attended by a nurse is 2.5 for hospitalization. In addition, necessary nursing personnel by patient classification was determined four nurses for seven patients in this system based on the authors' preliminary study. And the second step is to assign daily duty type for each nurse at every nursing unit automatically. The introduced system fully utilizes the GUI environment of Microsoft Windows and even makes the computer-novice nurses feel comfortable in using the system. This system can help nursing administrators improve nurse scheduling in a way of quick and easy schedule generation for the future, and allow nurses more time for patient care.

• 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 Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.283-285
• /
• 2001

The most work-space invest much time and labor for optimal arrangement. The work-plates of the work-space should be arranged, processed and assembled under the restricted work space. The optimal arrangement under the terms of a restriction arrange the maximum work-plates in appointed work-space. It's the central aim. The work-plates arrangement scheduling of the most work-space are achieved through the experience of the planner. Like this, if the work-plates arrangement is worked by hand, there spend much time for the training planner. And the burden of the personnel expenses occur for using the master worker, also there are dangerous factors to be able to bring the bottleneck circumstance for the process planning, because the quick work planning does not accomplish. With such problems, the biggest problem is inferior the value of the plan. For solved the such problem of hand-operating, some work-spaces developed and used the work-plate arrangement scheduling system for the special quality of themselves. This paper make research into a plan to develop the work-plate arrangement scheduling system efficiently.

• 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 the Korean Statistical Society
• /
• v.4 no.1
• /
• pp.79-87
• /
• 1975

However, the mechanism for producing revised estimate is the principal means of varying the resulting precisions of estimate. Therefore, a scheduling system including physician's revision should be checked by a computer simulation to evaluate possible gains to admissions scheduling accruing from the use of these estimates. The ability to accurately predict bed occupancy has long been an objective of hospital management. If the one were able to anticipate bed accupancy, then the one could more accurately plan for bed needs, schedule personnel, allocate service and supply. We may conclude that even though the Markov chain analysis would not lead to ready-made answers for the scheduling system of elective patients, it can provide the more detailed and systematic knowledgy for the solutions on the weekly base as well as the foundations for long run planning in relative sense.

• Proceedings of the KSR Conference
• /
• 2003.05a
• /
• pp.280-285
• /
• 2003

The process of railway traffic planning is composed of several steps such as long-term, mid-term. short-term, and real-time plan. The planning of vehicle and manpower resources is a main research topic in tactical short-term planning step. Railway vehicle is usually consisted of a power car, passenger/freight cars and human resource is composed of engine driver, cabin crew, ground personnel. So far, power car was main research target in railway vehicle scheduling problem. Recently according as the light electric railway or high-speed railway is introduced, the operational planning of trainset vehicles become important, In this paper, we introduce the conceptional model for trainset restoring problem and developed heuristic algorithm.

• Proceedings of the Safety Management and Science Conference
• /
• 2003.05a
• /
• pp.53-61
• /
• 2003

The process of railway traffic planning is composed of several steps such as long - term, mid - term, short - term, and real - time plan. The planning of vehicle and manpower resources is a main research topic in tactical short - term planning step Railway vehicle is usually consisted of a power car, passenger/freight cars and human resource is composed of engine driver, cabin crew, ground personnel. So far , power car was main research target in railway vehicle scheduling problem. Recently according as the light electric railway or high - speed railway is introduced, the operational planning of train set vehicles become important . In this paper , we introduce the conceptional model for trainset restoring problem and developed heuristic algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.150-160
• /
• 2020

In this paper, we introduce a pilot's scheduling model which is able to maintain and balance their capabilities for each relevant skill level in military helicopter squadron. Flight scheduler has to consider many factors related pilot's flight information and spends a lot of times and efforts for flight planning without scientific process depending on his/her own capability and experience. This model reflected overall characteristics that include pilot's progression by basis monthly and cumulative flight hours, operational recent flight data and quickly find out a pinpoint areas of concern with respect to their mission subjects etc. There also include essential several constraints, such as personnel qualifications, and Army helicopter training policy's constraints such as regulations and guidelines. We presented binary Integer Programming (IP) mathematical formulation for optimization and demonstrated its effectiveness by comparisons of real schedule versus model's solution to several cases experimental scenarios and greedy random simulation model. The model made the schedule in less than 30 minutes, including the data preprocessing process, and the results of the allocation were more equal than the actual one. This makes it possible to reduce the workload of the scheduler and effectively manages the pilot's skills. We expect to set up and improve better flight planning and combat readiness in Korea Army aviation.