{"title":"Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing","authors":"Junying He, Soon-Ik Hong, Seong-Hee Kim","doi":"10.1007/s10951-024-00804-1","DOIUrl":null,"url":null,"abstract":"<p>Spatiotemporal scheduling of the block assembly process in shipbuilding is to determine temporal information including a time period when each block is under assembly and spatial information including an assigned bay and the placement of the block within the assigned bay. Due to a large number of discrete variables to optimize, finding an optimal schedule in a reasonably short time is almost impossible. Instead, we divide the problem into two phases where the first phase determines the bay assignment and processing start date for each block and the second phase determines the coordinates and rotation of each block in its assigned bay. Our objective is to find a block assembly schedule that minimizes the number of blocks that fail to be processed on time and unfairness in workloads across bays and days. The proposed algorithm is tested on six datasets of block information provided by Korea Shipbuilding & Offshore Engineering Co., Ltd. (KSOE). Our algorithm speeds up the scheduling process and finds schedules of higher quality compared to the original schedules that are manually planned by KSOE.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scheduling","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s10951-024-00804-1","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0
Abstract
Spatiotemporal scheduling of the block assembly process in shipbuilding is to determine temporal information including a time period when each block is under assembly and spatial information including an assigned bay and the placement of the block within the assigned bay. Due to a large number of discrete variables to optimize, finding an optimal schedule in a reasonably short time is almost impossible. Instead, we divide the problem into two phases where the first phase determines the bay assignment and processing start date for each block and the second phase determines the coordinates and rotation of each block in its assigned bay. Our objective is to find a block assembly schedule that minimizes the number of blocks that fail to be processed on time and unfairness in workloads across bays and days. The proposed algorithm is tested on six datasets of block information provided by Korea Shipbuilding & Offshore Engineering Co., Ltd. (KSOE). Our algorithm speeds up the scheduling process and finds schedules of higher quality compared to the original schedules that are manually planned by KSOE.
期刊介绍:
The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.