Lexicographic bi-objective scheduling under budget constraints in distributed production-transportation-assembly systems.
Saved in:
| Title: | Lexicographic bi-objective scheduling under budget constraints in distributed production-transportation-assembly systems. |
|---|---|
| Authors: | Xiong, Fuli1 (AUTHOR) xiongfuli@xauat.edu.cn, Jing, Lin1 (AUTHOR), Hou, Shuyu1 (AUTHOR), Han, Yitong1 (AUTHOR) |
| Source: | International Journal of Production Research. Jul2026, Vol. 64 Issue 14, p5970-6001. 32p. |
| Subjects: | Multi-objective optimization, Decomposition method, Branch & bound algorithms, Mixed integer linear programming, Assembly machines, Flexible manufacturing systems, Transportation costs, Resource allocation |
| Abstract: | In response to the demand for integrated and cost-efficient production systems, this study addresses a lexicographic bi-objective scheduling problem with budget constraints in distributed production–transportation–assembly flow shop systems. The first objective is to minimise makespan under heterogeneous resource and budget limitations across multiple sites; the second is to minimise total transportation and assembly costs without exceeding the optimal makespan. This yields a two-stage sequential scheduling framework. In Stage 1, a reduced mixed-integer linear programming (MILP) model is first solved to determine the minimum feasible budget, followed by three alternative formulations – Manne-based MILP, position-based MILP, and constraint programming (CP) While exact models solve small instances, they are intractable for realistic scales. To enhance scalability, we develop logic-based Benders decomposition (LBBD) and branch-and-check (BCH) variants with bound-strengthening strategies. In Stage 2, MILP, CP, and LBBD methods minimise costs subject to the makespan. Here, a CP warm start is embedded in LBBD to accelerate convergence. Computational experiments show that decomposition-based methods substantially outperform monolithic models. In Stage 1, LBBD achieves clear advantages over MILP and CP; in Stage 2, LBBD reduces costs by 4.04% and 13.26% on small and large instances, respectively. Sensitivity analyses further provide managerial insights for budget-aware scheduling in distributed networks. [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: 195127054 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Lexicographic bi-objective scheduling under budget constraints in distributed production-transportation-assembly systems. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Xiong%2C+Fuli%22">Xiong, Fuli</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> xiongfuli@xauat.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Jing%2C+Lin%22">Jing, Lin</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Hou%2C+Shuyu%22">Hou, Shuyu</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Han%2C+Yitong%22">Han, Yitong</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>. Jul2026, Vol. 64 Issue 14, p5970-6001. 32p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Multi-objective+optimization%22">Multi-objective optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Decomposition+method%22">Decomposition method</searchLink><br /><searchLink fieldCode="DE" term="%22Branch+%26+bound+algorithms%22">Branch & bound algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Mixed+integer+linear+programming%22">Mixed integer linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Assembly+machines%22">Assembly machines</searchLink><br /><searchLink fieldCode="DE" term="%22Flexible+manufacturing+systems%22">Flexible manufacturing systems</searchLink><br /><searchLink fieldCode="DE" term="%22Transportation+costs%22">Transportation costs</searchLink><br /><searchLink fieldCode="DE" term="%22Resource+allocation%22">Resource allocation</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: In response to the demand for integrated and cost-efficient production systems, this study addresses a lexicographic bi-objective scheduling problem with budget constraints in distributed production–transportation–assembly flow shop systems. The first objective is to minimise makespan under heterogeneous resource and budget limitations across multiple sites; the second is to minimise total transportation and assembly costs without exceeding the optimal makespan. This yields a two-stage sequential scheduling framework. In Stage 1, a reduced mixed-integer linear programming (MILP) model is first solved to determine the minimum feasible budget, followed by three alternative formulations – Manne-based MILP, position-based MILP, and constraint programming (CP) While exact models solve small instances, they are intractable for realistic scales. To enhance scalability, we develop logic-based Benders decomposition (LBBD) and branch-and-check (BCH) variants with bound-strengthening strategies. In Stage 2, MILP, CP, and LBBD methods minimise costs subject to the makespan. Here, a CP warm start is embedded in LBBD to accelerate convergence. Computational experiments show that decomposition-based methods substantially outperform monolithic models. In Stage 1, LBBD achieves clear advantages over MILP and CP; in Stage 2, LBBD reduces costs by 4.04% and 13.26% on small and large instances, respectively. Sensitivity analyses further provide managerial insights for budget-aware scheduling in distributed networks. [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=195127054 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/00207543.2026.2619571 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 32 StartPage: 5970 Subjects: – SubjectFull: Multi-objective optimization Type: general – SubjectFull: Decomposition method Type: general – SubjectFull: Branch & bound algorithms Type: general – SubjectFull: Mixed integer linear programming Type: general – SubjectFull: Assembly machines Type: general – SubjectFull: Flexible manufacturing systems Type: general – SubjectFull: Transportation costs Type: general – SubjectFull: Resource allocation Type: general Titles: – TitleFull: Lexicographic bi-objective scheduling under budget constraints in distributed production-transportation-assembly systems. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Xiong, Fuli – PersonEntity: Name: NameFull: Jing, Lin – PersonEntity: Name: NameFull: Hou, Shuyu – PersonEntity: Name: NameFull: Han, Yitong IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 07 Text: Jul2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 64 – Type: issue Value: 14 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |
