IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v27y2024i5d10.1007_s10951-024-00804-1.html
   My bibliography  Save this article

Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing

Author

Listed:
  • Junying He

    (Zhejiang Cainiao Supply Chain Management Co., Ltd.)

  • Soon-Ik Hong

    (Korea Shipbuilding & Offshore Engineering Co., Ltd.)

  • Seong-Hee Kim

    (Georgia Institute of Technology)

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.

Suggested Citation

  • Junying He & Soon-Ik Hong & Seong-Hee Kim, 2024. "Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing," Journal of Scheduling, Springer, vol. 27(5), pages 409-422, October.
    • Handle: RePEc:spr:jsched:v:27:y:2024:i:5:d:10.1007_s10951-024-00804-1
    DOI: 10.1007/s10951-024-00804-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-024-00804-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-024-00804-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C.D. Rose & J.M.G. Coenen, 2016. "Automatic generation of a section building planning for constructing complex ships in European shipyards," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6848-6859, November.
    2. Silvano Martello & David Pisinger & Daniele Vigo, 2000. "The Three-Dimensional Bin Packing Problem," Operations Research, INFORMS, vol. 48(2), pages 256-267, April.
    3. Roland Braune, 2022. "Packing-based branch-and-bound for discrete malleable task scheduling," Journal of Scheduling, Springer, vol. 25(6), pages 675-704, December.
    4. Q. Su, 2007. "Applying case-based reasoning in assembly sequence planning," International Journal of Production Research, Taylor & Francis Journals, vol. 45(1), pages 29-47, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David Pisinger, 2007. "Denser Packings Obtained in O ( n log log n ) Time," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 395-405, August.
    2. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    3. Gregory S. Taylor & Yupo Chan & Ghulam Rasool, 2017. "A three-dimensional bin-packing model: exact multicriteria solution and computational complexity," Annals of Operations Research, Springer, vol. 251(1), pages 397-427, April.
    4. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    5. Kalantari, Joakim & Sternberg, Henrik, 2009. "Research Outlook on a Mixed Model Transportation Network," European Transport \ Trasporti Europei, ISTIEE, Institute for the Study of Transport within the European Economic Integration, issue 41, pages 62-79.
    6. Li, Yanzhi & Tao, Yi & Wang, Fan, 2009. "A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning," European Journal of Operational Research, Elsevier, vol. 199(2), pages 553-560, December.
    7. Giorgio Fasano, 2013. "A global optimization point of view to handle non-standard object packing problems," Journal of Global Optimization, Springer, vol. 55(2), pages 279-299, February.
    8. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 2002. "Heuristic algorithms for the three-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 410-420, September.
    9. Hu, Qian & Wei, Lijun & Lim, Andrew, 2018. "The two-dimensional vector packing problem with general costs," Omega, Elsevier, vol. 74(C), pages 59-69.
    10. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    11. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2017. "Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints," Operational Research, Springer, vol. 17(1), pages 115-143, April.
    12. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2012. "The Pallet-Packing Vehicle Routing Problem," Transportation Science, INFORMS, vol. 46(3), pages 341-358, August.
    13. H-L Li & J-F Tsai & N-Z Hu, 2003. "A distributed global optimization method for packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 419-425, April.
    14. Sciomachen, Anna & Tanfani, Elena, 2007. "A 3D-BPP approach for optimising stowage plans and terminal productivity," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1433-1446, December.
    15. Shraga Shoval & Mahmoud Efatmaneshnik & Michael J. Ryan, 2017. "Assembly sequence planning for processes with heterogeneous reliabilities," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2806-2828, May.
    16. Zhu, Wenbin & Huang, Weili & Lim, Andrew, 2012. "A prototype column generation strategy for the multiple container loading problem," European Journal of Operational Research, Elsevier, vol. 223(1), pages 27-39.
    17. Liu, Weimiao & Deng, Tianhu & Li, Jianbin, 2019. "Product packing and stacking under uncertainty: A robust approach," European Journal of Operational Research, Elsevier, vol. 277(3), pages 903-917.
    18. Krzysztof Pieńkosz, 2024. "Graph models for identifying robot-packable patterns of pallet loading," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(4), pages 141-155.
    19. Hu, Qian & Zhu, Wenbin & Qin, Hu & Lim, Andrew, 2017. "A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function," European Journal of Operational Research, Elsevier, vol. 260(1), pages 70-80.
    20. Tian, Tian & Zhu, Wenbin & Lim, Andrew & Wei, Lijun, 2016. "The multiple container loading problem with preference," European Journal of Operational Research, Elsevier, vol. 248(1), pages 84-94.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:27:y:2024:i:5:d:10.1007_s10951-024-00804-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.