Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times
In this paper, we study a lot-sizing and scheduling problem apparent in the food industry that stemmed originally from the Brazilian meat production sector. More specifically, we consider a production environment in which various production lines share a set of scarce production resources. Therefore...
Gespeichert in:
Veröffentlicht in: | Journal of heuristics 2025-03, Vol.31 (1), p.1, Article 1 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 1 |
container_start_page | 1 |
container_title | Journal of heuristics |
container_volume | 31 |
creator | Soler, Willy A. Oliveira Santos, Maristela O. Akartunalı, Kerem |
description | In this paper, we study a lot-sizing and scheduling problem apparent in the food industry that stemmed originally from the Brazilian meat production sector. More specifically, we consider a production environment in which various production lines share a set of scarce production resources. Therefore, only a subset of the existing production lines can simultaneously operate in each period under the limitations of the availability of resources. Moreover, we consider sequence-dependent setup times and costs, significant inventory holding costs, backlogging, and perishable products. The problem is formulated as a mixed integer programming model, and we propose four Lagrangian-based heuristics to find high-quality solutions for challenging instances. A computational study shows that proposed approaches are very competitive in solving the problem, outperforming methods already established in the literature. |
doi_str_mv | 10.1007/s10732-024-09539-w |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3125876668</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3125876668</sourcerecordid><originalsourceid>FETCH-LOGICAL-c200t-e774bc1d82f794e774ad775f2e458a8aede242ba9b02899323fa74218f711e613</originalsourceid><addsrcrecordid>eNp9kDtPwzAUhS0EEqXwB5gssWLwI6ntEVW8pEosMFtOcpO6ap1gO6pY-eW4BMTGdB_6zr1HB6FLRm8YpfI2MioFJ5QXhOpSaLI_QjNWSk600PI490Ixwrhgp-gsxg2lVKtSzNDnynbB-s5ZTyobocFrGIOLydURt33AQ-ibsU6u93jYWu-d7_DepTUeIGNrW23hl4nXONY21IADxH7MTd5Y3-AI7yP4GkgDA_gGfMqrNA44uR3Ec3TS2m2Ei586R28P96_LJ7J6eXxe3q1IzSlNBKQsqpo1irdSF4fJNlKWLYeiVFZZaIAXvLK6olxpLbhorSw4U61kDBZMzNHVdDfbzX5iMpts0ueXRjBeKrlYLFSm-ETVoY8xQGuG4HY2fBhGzSFrM2VtctbmO2uzzyIxiWKGfQfh7_Q_qi81OIVQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3125876668</pqid></control><display><type>article</type><title>Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times</title><source>SpringerLink Journals - AutoHoldings</source><creator>Soler, Willy A. Oliveira ; Santos, Maristela O. ; Akartunalı, Kerem</creator><creatorcontrib>Soler, Willy A. Oliveira ; Santos, Maristela O. ; Akartunalı, Kerem</creatorcontrib><description>In this paper, we study a lot-sizing and scheduling problem apparent in the food industry that stemmed originally from the Brazilian meat production sector. More specifically, we consider a production environment in which various production lines share a set of scarce production resources. Therefore, only a subset of the existing production lines can simultaneously operate in each period under the limitations of the availability of resources. Moreover, we consider sequence-dependent setup times and costs, significant inventory holding costs, backlogging, and perishable products. The problem is formulated as a mixed integer programming model, and we propose four Lagrangian-based heuristics to find high-quality solutions for challenging instances. A computational study shows that proposed approaches are very competitive in solving the problem, outperforming methods already established in the literature.</description><identifier>ISSN: 1381-1231</identifier><identifier>EISSN: 1572-9397</identifier><identifier>DOI: 10.1007/s10732-024-09539-w</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Artificial Intelligence ; Assembly lines ; Calculus of Variations and Optimal Control; Optimization ; Dynamic programming ; Heuristic ; Integer programming ; Literature reviews ; Lot sizing ; Management Science ; Mathematics ; Mathematics and Statistics ; Mixed integer ; Operations Research ; Operations Research/Decision Theory ; Production lines ; Production planning ; Production scheduling ; Resource scheduling ; Scheduling ; Setup times</subject><ispartof>Journal of heuristics, 2025-03, Vol.31 (1), p.1, Article 1</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><rights>Copyright Springer Nature B.V. Mar 2025</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c200t-e774bc1d82f794e774ad775f2e458a8aede242ba9b02899323fa74218f711e613</cites><orcidid>0000-0002-7467-2307</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10732-024-09539-w$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10732-024-09539-w$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27915,27916,41479,42548,51310</link.rule.ids></links><search><creatorcontrib>Soler, Willy A. Oliveira</creatorcontrib><creatorcontrib>Santos, Maristela O.</creatorcontrib><creatorcontrib>Akartunalı, Kerem</creatorcontrib><title>Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times</title><title>Journal of heuristics</title><addtitle>J Heuristics</addtitle><description>In this paper, we study a lot-sizing and scheduling problem apparent in the food industry that stemmed originally from the Brazilian meat production sector. More specifically, we consider a production environment in which various production lines share a set of scarce production resources. Therefore, only a subset of the existing production lines can simultaneously operate in each period under the limitations of the availability of resources. Moreover, we consider sequence-dependent setup times and costs, significant inventory holding costs, backlogging, and perishable products. The problem is formulated as a mixed integer programming model, and we propose four Lagrangian-based heuristics to find high-quality solutions for challenging instances. A computational study shows that proposed approaches are very competitive in solving the problem, outperforming methods already established in the literature.</description><subject>Artificial Intelligence</subject><subject>Assembly lines</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Dynamic programming</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>Literature reviews</subject><subject>Lot sizing</subject><subject>Management Science</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Mixed integer</subject><subject>Operations Research</subject><subject>Operations Research/Decision Theory</subject><subject>Production lines</subject><subject>Production planning</subject><subject>Production scheduling</subject><subject>Resource scheduling</subject><subject>Scheduling</subject><subject>Setup times</subject><issn>1381-1231</issn><issn>1572-9397</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2025</creationdate><recordtype>article</recordtype><recordid>eNp9kDtPwzAUhS0EEqXwB5gssWLwI6ntEVW8pEosMFtOcpO6ap1gO6pY-eW4BMTGdB_6zr1HB6FLRm8YpfI2MioFJ5QXhOpSaLI_QjNWSk600PI490Ixwrhgp-gsxg2lVKtSzNDnynbB-s5ZTyobocFrGIOLydURt33AQ-ibsU6u93jYWu-d7_DepTUeIGNrW23hl4nXONY21IADxH7MTd5Y3-AI7yP4GkgDA_gGfMqrNA44uR3Ec3TS2m2Ei586R28P96_LJ7J6eXxe3q1IzSlNBKQsqpo1irdSF4fJNlKWLYeiVFZZaIAXvLK6olxpLbhorSw4U61kDBZMzNHVdDfbzX5iMpts0ueXRjBeKrlYLFSm-ETVoY8xQGuG4HY2fBhGzSFrM2VtctbmO2uzzyIxiWKGfQfh7_Q_qi81OIVQ</recordid><startdate>20250301</startdate><enddate>20250301</enddate><creator>Soler, Willy A. Oliveira</creator><creator>Santos, Maristela O.</creator><creator>Akartunalı, Kerem</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><orcidid>https://orcid.org/0000-0002-7467-2307</orcidid></search><sort><creationdate>20250301</creationdate><title>Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times</title><author>Soler, Willy A. Oliveira ; Santos, Maristela O. ; Akartunalı, Kerem</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c200t-e774bc1d82f794e774ad775f2e458a8aede242ba9b02899323fa74218f711e613</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2025</creationdate><topic>Artificial Intelligence</topic><topic>Assembly lines</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Dynamic programming</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>Literature reviews</topic><topic>Lot sizing</topic><topic>Management Science</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Mixed integer</topic><topic>Operations Research</topic><topic>Operations Research/Decision Theory</topic><topic>Production lines</topic><topic>Production planning</topic><topic>Production scheduling</topic><topic>Resource scheduling</topic><topic>Scheduling</topic><topic>Setup times</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Soler, Willy A. Oliveira</creatorcontrib><creatorcontrib>Santos, Maristela O.</creatorcontrib><creatorcontrib>Akartunalı, Kerem</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>Journal of heuristics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Soler, Willy A. Oliveira</au><au>Santos, Maristela O.</au><au>Akartunalı, Kerem</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times</atitle><jtitle>Journal of heuristics</jtitle><stitle>J Heuristics</stitle><date>2025-03-01</date><risdate>2025</risdate><volume>31</volume><issue>1</issue><spage>1</spage><pages>1-</pages><artnum>1</artnum><issn>1381-1231</issn><eissn>1572-9397</eissn><abstract>In this paper, we study a lot-sizing and scheduling problem apparent in the food industry that stemmed originally from the Brazilian meat production sector. More specifically, we consider a production environment in which various production lines share a set of scarce production resources. Therefore, only a subset of the existing production lines can simultaneously operate in each period under the limitations of the availability of resources. Moreover, we consider sequence-dependent setup times and costs, significant inventory holding costs, backlogging, and perishable products. The problem is formulated as a mixed integer programming model, and we propose four Lagrangian-based heuristics to find high-quality solutions for challenging instances. A computational study shows that proposed approaches are very competitive in solving the problem, outperforming methods already established in the literature.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10732-024-09539-w</doi><orcidid>https://orcid.org/0000-0002-7467-2307</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1381-1231 |
ispartof | Journal of heuristics, 2025-03, Vol.31 (1), p.1, Article 1 |
issn | 1381-1231 1572-9397 |
language | eng |
recordid | cdi_proquest_journals_3125876668 |
source | SpringerLink Journals - AutoHoldings |
subjects | Artificial Intelligence Assembly lines Calculus of Variations and Optimal Control Optimization Dynamic programming Heuristic Integer programming Literature reviews Lot sizing Management Science Mathematics Mathematics and Statistics Mixed integer Operations Research Operations Research/Decision Theory Production lines Production planning Production scheduling Resource scheduling Scheduling Setup times |
title | Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T01%3A37%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Lagrangian-based%20heuristics%20for%20production%20planning%20with%20perishable%20products,%20scarce%20resources,%20and%20sequence-dependent%20setup%20times&rft.jtitle=Journal%20of%20heuristics&rft.au=Soler,%20Willy%20A.%20Oliveira&rft.date=2025-03-01&rft.volume=31&rft.issue=1&rft.spage=1&rft.pages=1-&rft.artnum=1&rft.issn=1381-1231&rft.eissn=1572-9397&rft_id=info:doi/10.1007/s10732-024-09539-w&rft_dat=%3Cproquest_cross%3E3125876668%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3125876668&rft_id=info:pmid/&rfr_iscdi=true |