Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups
A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for r...
Gespeichert in:
| Veröffentlicht in: | Journal of heuristics 2007-08, Vol.13 (4), p.337-358 |
|---|---|
| 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 | 358 |
|---|---|
| container_issue | 4 |
| container_start_page | 337 |
| container_title | Journal of heuristics |
| container_volume | 13 |
| creator | de Araujo, Silvio A. Arenales, Marcos N. Clark, Alistair R. |
| description | A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry. [PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1007/s10732-007-9011-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_199275960</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1308527141</sourcerecordid><originalsourceid>FETCH-LOGICAL-c272t-fc228a45f7fd9259c58856cfb294d8c409000c45598fdcffeb33fff9f344740f3</originalsourceid><addsrcrecordid>eNotUMtOwzAQtBBIlMIHcIu4G_yIa-8RVTxViQucrdTx0lRpHGxHCL4eR-W0s6PZ2dEQcs3ZLWdM3yXOtBS0QAqMcwonZMGVFhQk6NOCpeGUC8nPyUVKe8YYGCUXBF9DN-Qqhr7vhk-6C7H7DUOV3M6300xVAatDk33smj5VYwzOpzTzzdBWfcg0db_z-t3lXZX81-QH52nrRz-0vjgnn6cxXZIzLPf-6n8uycfjw_v6mW7enl7W9xvqhBaZohPCNLVCjS0IBU4Zo1YOtwLq1riaQQnuaqXAYOsQ_VZKRASUda1rhnJJbo6-JWiJkrLdhykO5aXlAEIrWLEi4keRiyGl6NGOsTs08cdyZuc27bFNO8O5TQvyDz59ajM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199275960</pqid></control><display><type>article</type><title>Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups</title><source>Springer Nature - Complete Springer Journals</source><creator>de Araujo, Silvio A. ; Arenales, Marcos N. ; Clark, Alistair R.</creator><creatorcontrib>de Araujo, Silvio A. ; Arenales, Marcos N. ; Clark, Alistair R.</creatorcontrib><description>A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 1381-1231</identifier><identifier>EISSN: 1572-9397</identifier><identifier>DOI: 10.1007/s10732-007-9011-9</identifier><language>eng</language><publisher>Boston: Springer Nature B.V</publisher><subject>Algorithms ; Decomposition ; Foundries ; Heuristic ; Integer programming ; Linear programming ; Manufacturing ; Mathematical models ; Mathematical programming ; Problem solving ; Production planning ; Production scheduling ; Proposals ; Scheduling ; Statistical analysis ; Studies</subject><ispartof>Journal of heuristics, 2007-08, Vol.13 (4), p.337-358</ispartof><rights>Springer Science+Business Media, LLC 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c272t-fc228a45f7fd9259c58856cfb294d8c409000c45598fdcffeb33fff9f344740f3</citedby><cites>FETCH-LOGICAL-c272t-fc228a45f7fd9259c58856cfb294d8c409000c45598fdcffeb33fff9f344740f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>de Araujo, Silvio A.</creatorcontrib><creatorcontrib>Arenales, Marcos N.</creatorcontrib><creatorcontrib>Clark, Alistair R.</creatorcontrib><title>Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups</title><title>Journal of heuristics</title><description>A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Decomposition</subject><subject>Foundries</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Manufacturing</subject><subject>Mathematical models</subject><subject>Mathematical programming</subject><subject>Problem solving</subject><subject>Production planning</subject><subject>Production scheduling</subject><subject>Proposals</subject><subject>Scheduling</subject><subject>Statistical analysis</subject><subject>Studies</subject><issn>1381-1231</issn><issn>1572-9397</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNotUMtOwzAQtBBIlMIHcIu4G_yIa-8RVTxViQucrdTx0lRpHGxHCL4eR-W0s6PZ2dEQcs3ZLWdM3yXOtBS0QAqMcwonZMGVFhQk6NOCpeGUC8nPyUVKe8YYGCUXBF9DN-Qqhr7vhk-6C7H7DUOV3M6300xVAatDk33smj5VYwzOpzTzzdBWfcg0db_z-t3lXZX81-QH52nrRz-0vjgnn6cxXZIzLPf-6n8uycfjw_v6mW7enl7W9xvqhBaZohPCNLVCjS0IBU4Zo1YOtwLq1riaQQnuaqXAYOsQ_VZKRASUda1rhnJJbo6-JWiJkrLdhykO5aXlAEIrWLEi4keRiyGl6NGOsTs08cdyZuc27bFNO8O5TQvyDz59ajM</recordid><startdate>200708</startdate><enddate>200708</enddate><creator>de Araujo, Silvio A.</creator><creator>Arenales, Marcos N.</creator><creator>Clark, Alistair R.</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>200708</creationdate><title>Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups</title><author>de Araujo, Silvio A. ; Arenales, Marcos N. ; Clark, Alistair R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c272t-fc228a45f7fd9259c58856cfb294d8c409000c45598fdcffeb33fff9f344740f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Decomposition</topic><topic>Foundries</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Manufacturing</topic><topic>Mathematical models</topic><topic>Mathematical programming</topic><topic>Problem solving</topic><topic>Production planning</topic><topic>Production scheduling</topic><topic>Proposals</topic><topic>Scheduling</topic><topic>Statistical analysis</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>de Araujo, Silvio A.</creatorcontrib><creatorcontrib>Arenales, Marcos N.</creatorcontrib><creatorcontrib>Clark, Alistair R.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of heuristics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>de Araujo, Silvio A.</au><au>Arenales, Marcos N.</au><au>Clark, Alistair R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups</atitle><jtitle>Journal of heuristics</jtitle><date>2007-08</date><risdate>2007</risdate><volume>13</volume><issue>4</issue><spage>337</spage><epage>358</epage><pages>337-358</pages><issn>1381-1231</issn><eissn>1572-9397</eissn><abstract>A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry. [PUBLICATION ABSTRACT]</abstract><cop>Boston</cop><pub>Springer Nature B.V</pub><doi>10.1007/s10732-007-9011-9</doi><tpages>22</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1381-1231 |
| ispartof | Journal of heuristics, 2007-08, Vol.13 (4), p.337-358 |
| issn | 1381-1231 1572-9397 |
| language | eng |
| recordid | cdi_proquest_journals_199275960 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Algorithms Decomposition Foundries Heuristic Integer programming Linear programming Manufacturing Mathematical models Mathematical programming Problem solving Production planning Production scheduling Proposals Scheduling Statistical analysis Studies |
| title | Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T21%3A00%3A32IST&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=Joint%20rolling-horizon%20scheduling%20of%20materials%20processing%20and%20lot-sizing%20with%20sequence-dependent%20setups&rft.jtitle=Journal%20of%20heuristics&rft.au=de%20Araujo,%20Silvio%20A.&rft.date=2007-08&rft.volume=13&rft.issue=4&rft.spage=337&rft.epage=358&rft.pages=337-358&rft.issn=1381-1231&rft.eissn=1572-9397&rft_id=info:doi/10.1007/s10732-007-9011-9&rft_dat=%3Cproquest_cross%3E1308527141%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=199275960&rft_id=info:pmid/&rfr_iscdi=true |