동적 블록수송환경을 위한 네트워크 흐름모형 기반의 트랜스포터 일정계획

이운식,임원일,구평회 대한산업공학회 2009 산업공학 Vol.22 No.1

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. 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 and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

트랜스포터 결합을 고려한 조선소 블록 운반 일정계획

신재영(Jae-Young Shin),박나현(Na-Hyun Bak) 한국항해항만학회 2014 한국항해항만학회지 Vol.38 No.3

In a ship-building, a transporter is the moving equipment to transport ship blocks from a workshop to another in a shipyard. The efficient scheduling of transporters has an important role for the operation of a building ship to be completed on schedule. There are the previous studies on the transporter scheduling for moving blocks in a shipyard. These studies have no consideration for the transporter combination to increase the productivity of moving blocks. This paper presents an efficient transporter scheduling model considering transporter combination explicitly. The objective of this model is to minimize the operational cost and maintain the workload balance among transporters. we also present three heuristics algorithms based on tabu search for finding the solution of the model. The efficiency of the proposed heuristics are verified with several computational tests. 트랜스포터란 조선소에서 작업장 간에 조선 블록을 운반하는 장비이다. 트랜스포터 일정 계획을 효율적으로 하는 것은 선박 건조과정에서 매우 중요한 역할을 한다. 블록 운반에 있어서의 트랜스포터 일정 계획에 관한 몇몇 연구들이 수행되었다. 이러한 연구들은 트랜스포터 결합을 고려하지 않았다. 본 논문에서는 결합을 고려한 효율적인 트랜스포터 일정 계획 모형을 제안한다. 수리적 모형에서는 운영 비용을 최소화하면서 트랜스포터 간의 작업 부하를 가능한 균등하게 하는 것을 목적으로 하였다. 또한 본 모형의 해를 탐색하기 위해 타부 서치기반의 세 가지 휴리스틱 알고리즘을 제시하였으며 컴퓨터 실험을 통해 제안된 휴리스틱들의 효율성을 검증하였다.

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

이운식,임원일,구평회,주철민 대한산업공학회 2008 산업공학 Vol.21 No.3

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. 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 and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

동적 블록수송환경을 고려한 트랜스포터 일정계획시스템 개발

임원일,이운식,구평회,김동준 한국경영공학회 2008 한국경영공학회지 Vol.13 No.2

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. 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 paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. T재 heuristic algorithms for transporter scheduling are proposed and their performance is evaluated. Also, an IT-based transporter scheduling system with a rescheduling algorithm is developed for an industrial use and its development process is introduced.

Research on the Scheduling of Legal Operating Vehicles based on NFC

Jiyan Lin,Peini Shang,Fei Yang,Yongheng Zhang 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.11

In the study of reasons that cause the flush illegal operating vehicles, we found out that the insufficient legal operating vehicles were the main cause. In order to efficiently solve the illegal operating, the paper brings out the research of scheduling algorithm about the legal operating vehicles based on NFC. The research uses the NFC technology to realize the intelligent and fast identification and the scheduling algorithm to realize the problem of insufficient legal operating vehicles. The scheduling can be divided into two stages--the multi-level queues high response ratio first scheduling and the multi-level queues earliest available time first scheduling. The algorithm can choose the user whose response ratio is the highest from the users’scheduling list and allocate the user who has the highest ratio to the legal operating vehicle who has the earliest available time that in the same area. Experiment indicates that the scheduling success ratio, throughput, average waiting time of the scheduling algorithm are superior to random travel of the drivers and can efficiently resolve the insufficient of legal operating vehicles.

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

이운식(Lee, Woon-Seek),임원일(Lim, Won-Il),구평회(Koo, Pyung-Hoi) 한국경영과학회 2008 한국경영과학회 학술대회논문집 Vol.2008 No.5

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. 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 and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

동적 블록수송환경을 위한 네트워크 흐름모형 기반의 트랜스포터 일정계획

이운식(Woon-Seek Lee),임원일(Won-Il Lim),구평회(Pyung-Hoi Koo) 대한산업공학회 2008 대한산업공학회 추계학술대회논문집 Vol.2008 No.11

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. 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 and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

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

이운식(Lee, Woon-Seek),임원일(Lim, Won-Il),구평회(Koo, Pyung-Hoi) 대한산업공학회 2008 대한산업공학회 춘계학술대회논문집 Vol.2008 No.5

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. 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 and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

Berth allocation and scheduling at marine container terminals: A state-of-the-art review of solution approaches and relevant scheduling attributes

Li Bokang,Elmi Zeinab,Manske Ashley,Jacobs Edwina,Lau Yui-yip,Chen Qiong,Dulebenets Maxim A 한국CDE학회 2023 Journal of computational design and engineering Vol.10 No.4

Marine container terminals play a significant role for international trade networks and global market. To cope with the rapid and steady growth of the seaborne trade market, marine container terminal operators must address the operational challenges with appropriate analytical methods to meet the needs of the market. The berth allocation and scheduling problem is one of the important decisions faced by operators during operations planning. The optimization of a berth schedule is strongly associated with the allocation of spatial and temporal resources. An optimal and robust berth schedule remarkably improves the productivity and competitiveness of a seaport. A significant number of berth allocation and scheduling studies have been conducted over the last years. Thus, there is an existing need for a comprehensive and critical literature survey to analyze the state-of-the-art research progress, developing tendencies, current shortcomings, and potential future research directions. Therefore, this study thoroughly selected scientific manuscripts dedicated to the berth allocation and scheduling problem. The identified studies were categorized based on spatial attributes, including discrete, continuous, and hybrid berth allocation and scheduling problems. A detailed review was performed for the identified study categories. A representative mathematical formulation for each category was presented along with a detailed summary of various considerations and characteristics of every study. A specific emphasis was given to the solution methods adopted. The current research shortcomings and important research needs were outlined based on the review of the state-of-the-art. This study was conducted with the expectation of assisting the scientific community and relevant stakeholders with berth allocation and scheduling.

트랜스포터 결합을 고려한 조선소 블록 운반 일정계획

신재영,박나현 한국항해항만학회 2014 한국항해항만학회지 Vol.38 No.3

트랜스포터란 조선소에서 작업장 간에 조선 블록을 운반하는 장비이다. 트랜스포터 일정 계획을 효율적으로 하는 것은 선박 건조 과정에서 매우 중요한 역할을 한다. 블록 운반에 있어서의 트랜스포터 일정 계획에 관한 몇몇 연구들이 수행되었다. 이러한 연구들은 트랜스 포터 결합을 고려하지 않았다. 본 논문에서는 결합을 고려한 효율적인 트랜스포터 일정 계획 모형을 제안한다. 수리적 모형에서는 운영 비용 을 최소화하면서 트랜스포터 간의 작업 부하를 가능한 균등하게 하는 것을 목적으로 하였다. 또한 본 모형의 해를 탐색하기 위해 타부 서치 기반의 세 가지 휴리스틱 알고리즘을 제시하였으며 컴퓨터 실험을 통해 제안된 휴리스틱들의 효율성을 검증하였다. In a ship-building, a transporter is the moving equipment to transport ship blocks from a workshop to another in a shipyard. The efficient scheduling of transporters has an important role for the operation of a building ship to be completed on schedule. There are the previous studies on the transporter scheduling for moving blocks in a shipyard. These studies have no consideration for the transporter combination to increase the productivity of moving blocks. This paper presents an efficient transporter scheduling model considering transporter combination explicitly. The objective of this model is to minimize the operational cost and maintain the workload balance among transporters. we also present three heuristics algorithms based on tabu search for finding the solution of the model. The efficiency of the proposed heuristics are verified with several computational tests.