A matheuristic approach for the multi-level capacitated lot-sizing problem with substitution and backorder.
Saved in:
| Title: | A matheuristic approach for the multi-level capacitated lot-sizing problem with substitution and backorder. |
|---|---|
| Authors: | Qin, Hu1 (AUTHOR), Zhuang, Haocheng1 (AUTHOR), Yu, Chunlong2 (AUTHOR) chunlong_yu@tongji.edu.cn, Li, Jiliu3 (AUTHOR) |
| Source: | International Journal of Production Research. Jul2024, Vol. 62 Issue 13, p4645-4673. 29p. |
| Subjects: | Back orders, Production planning, Mathematical programming, Factorial experiment designs, Industrial capacity |
| Abstract: | The lot-sizing problem aims at determining the products to be produced and their quantities for each time period, which is a difficult problem in production planning. This problem becomes even more complicated when practical aspects such as limited production capacity, bill of materials, and item substitution are considered. In this paper, we study a new variant of the lot-sizing problem, called the multi-level capacitated lot-sizing problem with substitution and backorder. Unlike previous studies, this variant considers substitutions at both the product and component levels, which is based on the real needs of manufacturers to increase planning flexibility. Backorders are allowed, but should be delivered within a certain time limitation. We formulate this problem using a mathematical programming model. A matheuristic approach is proposed to solve the problem. This first generates an initial feasible solution using a relax-and-fix algorithm, and then improves it using a hybrid fix-and-optimise algorithm. The proposed algorithm is calibrated with a full factorial design of experiments, and its efficiency is well validated. Finally, through extensive numerical experiments, we analyse the properties of this new lot-sizing problem, such as the effect of substitution options, and the influence of backorder time limitation, and provide several useful managerial insights for manufacturing companies to save costs in production planning. [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: 177117498 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A matheuristic approach for the multi-level capacitated lot-sizing problem with substitution and backorder. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Qin%2C+Hu%22">Qin, Hu</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Zhuang%2C+Haocheng%22">Zhuang, Haocheng</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Yu%2C+Chunlong%22">Yu, Chunlong</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> chunlong_yu@tongji.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Li%2C+Jiliu%22">Li, Jiliu</searchLink><relatesTo>3</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>. Jul2024, Vol. 62 Issue 13, p4645-4673. 29p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Back+orders%22">Back orders</searchLink><br /><searchLink fieldCode="DE" term="%22Production+planning%22">Production planning</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+programming%22">Mathematical programming</searchLink><br /><searchLink fieldCode="DE" term="%22Factorial+experiment+designs%22">Factorial experiment designs</searchLink><br /><searchLink fieldCode="DE" term="%22Industrial+capacity%22">Industrial capacity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The lot-sizing problem aims at determining the products to be produced and their quantities for each time period, which is a difficult problem in production planning. This problem becomes even more complicated when practical aspects such as limited production capacity, bill of materials, and item substitution are considered. In this paper, we study a new variant of the lot-sizing problem, called the multi-level capacitated lot-sizing problem with substitution and backorder. Unlike previous studies, this variant considers substitutions at both the product and component levels, which is based on the real needs of manufacturers to increase planning flexibility. Backorders are allowed, but should be delivered within a certain time limitation. We formulate this problem using a mathematical programming model. A matheuristic approach is proposed to solve the problem. This first generates an initial feasible solution using a relax-and-fix algorithm, and then improves it using a hybrid fix-and-optimise algorithm. The proposed algorithm is calibrated with a full factorial design of experiments, and its efficiency is well validated. Finally, through extensive numerical experiments, we analyse the properties of this new lot-sizing problem, such as the effect of substitution options, and the influence of backorder time limitation, and provide several useful managerial insights for manufacturing companies to save costs in production planning. [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=177117498 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/00207543.2023.2270076 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 29 StartPage: 4645 Subjects: – SubjectFull: Back orders Type: general – SubjectFull: Production planning Type: general – SubjectFull: Mathematical programming Type: general – SubjectFull: Factorial experiment designs Type: general – SubjectFull: Industrial capacity Type: general Titles: – TitleFull: A matheuristic approach for the multi-level capacitated lot-sizing problem with substitution and backorder. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Qin, Hu – PersonEntity: Name: NameFull: Zhuang, Haocheng – PersonEntity: Name: NameFull: Yu, Chunlong – PersonEntity: Name: NameFull: Li, Jiliu IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 07 Text: Jul2024 Type: published Y: 2024 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 62 – Type: issue Value: 13 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |
