DocumentCode
3503502
Title
Minimizing makespan at module assembly shop in shipbuilding
Author
Zheng, Junli ; Jiang, Zhibin ; Chen, Feng ; Chen, Qiang
Author_Institution
Dept. of Ind. Eng. & Logistics, Shanghai Jiao Tong Univ., Shanghai
Volume
2
fYear
2008
fDate
12-15 Oct. 2008
Firstpage
1794
Lastpage
1799
Abstract
With the wide application of module shipbuilding mode, module spatial scheduling problems occur in various working areas and constrain the productivity of shipbuilding. It is a NP-hard problem to obtain optimum scheduling due to the complex constraints. On the basis of investigation on the characteristics of module shape and processing technique, a heuristic module spatial scheduling algorithm meeting due dates, maximizing utilization of work plates and minimizing makespan is developed with the consideration of spatial and time constraints. Also, a target of spatiotemporal utilization ratio is proposed and used in improving the algorithm. With the algorithm, visual results of daily layouts and work orders can be easily obtained. The operation results using real shipyard data show that the module spatial scheduling performance and efficiency are satisfactory.
Keywords
assembling; optimisation; scheduling; shipbuilding industry; NP-hard problem; makespan; module assembly shop; module spatial scheduling problems; optimum scheduling; real shipyard data; shipbuilding; spatiotemporal utilization ratio; Makespan; Shipbuilding; Spatial scheduling; Spatiotemporal utilization ratio;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-2012-4
Electronic_ISBN
978-1-4244-2013-1
Type
conf
DOI
10.1109/SOLI.2008.4682821
Filename
4682821
Link To Document