A constraint programming-based decomposition strategy for the block assembly scheduling problem in shipbuilding.
Saved in:
| Title: | A constraint programming-based decomposition strategy for the block assembly scheduling problem in shipbuilding. |
|---|---|
| Authors: | Pernas-Álvarez, Javier1 (AUTHOR) javier.pernas2@udc.es, Becerra, José-A.2 (AUTHOR), Crespo-Pereira, Diego1 (AUTHOR) |
| Source: | International Journal of Production Research. Oct2025, Vol. 63 Issue 20, p7617-7636. 20p. |
| Subjects: | Constraint programming, Shipbuilding, Production planning, Buffer storage (Computer science), Resource allocation, Production scheduling, Scheduling |
| Abstract: | This study presents a novel Constraint Programming-based decomposition strategy to optimise block assembly scheduling in shipbuilding, addressing the complex Flexible Job-Shop Scheduling Problem with Assemblies, Limited Buffer Capacity, Block Erection Strategy, and Due Dates (FJSP-A-LBC-BE-DD). The proposed approach integrates buffer constraints and block erection strategies into a comprehensive CP formulation while introducing an innovative decomposition method that optimises makespan and resource allocation. Through experimental validation, the results demonstrate the effectiveness of this strategy, revealing that buffer capacity constraints play a critical role in scheduling efficiency, whereas the block erection strategy has a limited influence on makespan optimisation. The developed monolithic CP model for resource usage optimisation, combined with the decomposition strategy for makespan minimisation, provides a scalable and practical solution for industrial-scale shipbuilding scheduling. By outperforming existing models that overlook buffer limitations, this methodology establishes a structured framework for enhancing production planning. Future directions involve real-world applications and integration with simulation models for real-time re-optimisation. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 188477957 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A constraint programming-based decomposition strategy for the block assembly scheduling problem in shipbuilding. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Pernas-Álvarez%2C+Javier%22">Pernas-Álvarez, Javier</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> javier.pernas2@udc.es</i><br /><searchLink fieldCode="AR" term="%22Becerra%2C+José-A%2E%22">Becerra, José-A.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Crespo-Pereira%2C+Diego%22">Crespo-Pereira, Diego</searchLink><relatesTo>1</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Oct2025, Vol. 63 Issue 20, p7617-7636. 20p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Constraint+programming%22">Constraint programming</searchLink><br /><searchLink fieldCode="DE" term="%22Shipbuilding%22">Shipbuilding</searchLink><br /><searchLink fieldCode="DE" term="%22Production+planning%22">Production planning</searchLink><br /><searchLink fieldCode="DE" term="%22Buffer+storage+%28Computer+science%29%22">Buffer storage (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Resource+allocation%22">Resource allocation</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This study presents a novel Constraint Programming-based decomposition strategy to optimise block assembly scheduling in shipbuilding, addressing the complex Flexible Job-Shop Scheduling Problem with Assemblies, Limited Buffer Capacity, Block Erection Strategy, and Due Dates (FJSP-A-LBC-BE-DD). The proposed approach integrates buffer constraints and block erection strategies into a comprehensive CP formulation while introducing an innovative decomposition method that optimises makespan and resource allocation. Through experimental validation, the results demonstrate the effectiveness of this strategy, revealing that buffer capacity constraints play a critical role in scheduling efficiency, whereas the block erection strategy has a limited influence on makespan optimisation. The developed monolithic CP model for resource usage optimisation, combined with the decomposition strategy for makespan minimisation, provides a scalable and practical solution for industrial-scale shipbuilding scheduling. By outperforming existing models that overlook buffer limitations, this methodology establishes a structured framework for enhancing production planning. Future directions involve real-world applications and integration with simulation models for real-time re-optimisation. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=188477957 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/00207543.2025.2503465 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 20 StartPage: 7617 Subjects: – SubjectFull: Constraint programming Type: general – SubjectFull: Shipbuilding Type: general – SubjectFull: Production planning Type: general – SubjectFull: Buffer storage (Computer science) Type: general – SubjectFull: Resource allocation Type: general – SubjectFull: Production scheduling Type: general – SubjectFull: Scheduling Type: general Titles: – TitleFull: A constraint programming-based decomposition strategy for the block assembly scheduling problem in shipbuilding. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Pernas-Álvarez, Javier – PersonEntity: Name: NameFull: Becerra, José-A. – PersonEntity: Name: NameFull: Crespo-Pereira, Diego IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 10 Text: Oct2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 63 – Type: issue Value: 20 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |
