Proceedings of the KSR Conference (한국철도학회:학술대회논문집)
- 2011.05a
- /
- Pages.269-276
- /
- 2011
A Study on Rail Crane Scheduling Problem at Rail Terminal
철송 크레인 일정계획문제에 관한 연구
- Published : 2011.05.26
Abstract
This paper considers the rail crane scheduling problem with minimizing the sum of the range of order completion time and make-span of rail crane simultaneously. The range of order completion time implies the difference between the maximum of completion time and minimum of start time. Make-span refers to the time when all the tasks are completed. At a rail terminal, logistics companies wish to concentrate on their task of loading and unloading container on/from rail freight train at a time in order to increase the efficiency of their equipment such as reach stacker. In other words, they want to reduce the range of their order completion time. As a part of efforts to meet the needs, the crane schedule is rearranged based on worker's experience. We formulate the problem as a mixed integer program. To validate the effectiveness of the model, computational experiments were conducted using a set of data randomly generated.