블록 수송을 위한 트랜스포터 일정계획

Abstract

This thesis considers a transporter scheduling problem in shipbuilding. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard. The objective of this study is to minimize the weighted sum of empty transporter travel times, delay times, and tardy times. In this thesis, nine heuristic algorithms for transportation scheduling are proposed and their performance is evaluated. Furthermore, a rolling-horizon scheduling procedure based on the network simplex algorithm is proposed for the dynamic transportation environment. An IT-based transporter scheduling system with a rescheduling algorithm is also developed for an industrial use.