A heuristic approach for big bucket multi-level production planning problems
Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2009-03, Vol.193 (2), p.396-411 |
|---|---|
| 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 | 411 |
|---|---|
| container_issue | 2 |
| container_start_page | 396 |
| container_title | European journal of operational research |
| container_volume | 193 |
| creator | Akartunalı, Kerem Miller, Andrew J. |
| description | Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems. |
| doi_str_mv | 10.1016/j.ejor.2007.11.033 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00387052v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221707011307</els_id><sourcerecordid>1591906191</sourcerecordid><originalsourceid>FETCH-LOGICAL-c557t-c94fa337a5dfee4adc75cff898fe280070c6aa4ce920f27388341766b42692f63</originalsourceid><addsrcrecordid>eNp9kEFr3DAQhUVpodu0f6AnU-ihBzsjybYs6GUJaVOy0Et7Flp5lJXrtV3JXsi_7xiHPVYwGjF883h6jH3kUHDg9W1XYDfGQgCogvMCpHzFdrxRIq-bGl6zHUilciG4esvepdQBAK94tWOHfXbCJYY0B5fZaYqjdafMjzE7hqfsuLg_OGfnpZ9D3uMF-4yIdnFzGIds6u0whOFpnR17PKf37I23fcIPL_2G_f52_-vuIT_8_P7jbn_IXVWpOXe69FZKZavWI5a2dapy3je68Sga-gK42trSoRbghZJNI0uu6vpYiloLX8sb9mXTPdneTDGcbXw2ow3mYX8w6wxANgoqceHEftpYMvl3wTSbblziQPaMgFIKrmGFxAa5OKYU0V9VOZg1YNOZNWCzBmw4NxQwLT1uSxEndNcNpEMoJnMx0nIt6X6molVNLaxPqolK6tqUpHaaz6T2-cWnTc72PtrBhXRVFVySD10S93XjkAK-BIwmuYCDwzZEdLNpx_A_0_8AoLapdQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204321901</pqid></control><display><type>article</type><title>A heuristic approach for big bucket multi-level production planning problems</title><source>RePEc</source><source>ScienceDirect Journals (5 years ago - present)</source><creator>Akartunalı, Kerem ; Miller, Andrew J.</creator><creatorcontrib>Akartunalı, Kerem ; Miller, Andrew J.</creatorcontrib><description>Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2007.11.033</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Computer Science ; Exact sciences and technology ; Heuristic ; Heuristics ; Integer programming ; Integer programming Production planning Heuristics Relax-and-fix Strong formulations ; Inventory control, production control. Distribution ; Mathematical models ; Operational research and scientific management ; Operational research. Management science ; Operations Research ; Production planning ; Relax-and-fix ; Strong formulations ; Studies</subject><ispartof>European journal of operational research, 2009-03, Vol.193 (2), p.396-411</ispartof><rights>2007 Elsevier B.V.</rights><rights>2009 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 1, 2009</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c557t-c94fa337a5dfee4adc75cff898fe280070c6aa4ce920f27388341766b42692f63</citedby><cites>FETCH-LOGICAL-c557t-c94fa337a5dfee4adc75cff898fe280070c6aa4ce920f27388341766b42692f63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ejor.2007.11.033$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,780,784,885,3550,4008,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21310194$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a193_3ay_3a2009_3ai_3a2_3ap_3a396-411.htm$$DView record in RePEc$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00387052$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Akartunalı, Kerem</creatorcontrib><creatorcontrib>Miller, Andrew J.</creatorcontrib><title>A heuristic approach for big bucket multi-level production planning problems</title><title>European journal of operational research</title><description>Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems.</description><subject>Applied sciences</subject><subject>Computer Science</subject><subject>Exact sciences and technology</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Integer programming</subject><subject>Integer programming Production planning Heuristics Relax-and-fix Strong formulations</subject><subject>Inventory control, production control. Distribution</subject><subject>Mathematical models</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations Research</subject><subject>Production planning</subject><subject>Relax-and-fix</subject><subject>Strong formulations</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kEFr3DAQhUVpodu0f6AnU-ihBzsjybYs6GUJaVOy0Et7Flp5lJXrtV3JXsi_7xiHPVYwGjF883h6jH3kUHDg9W1XYDfGQgCogvMCpHzFdrxRIq-bGl6zHUilciG4esvepdQBAK94tWOHfXbCJYY0B5fZaYqjdafMjzE7hqfsuLg_OGfnpZ9D3uMF-4yIdnFzGIds6u0whOFpnR17PKf37I23fcIPL_2G_f52_-vuIT_8_P7jbn_IXVWpOXe69FZKZavWI5a2dapy3je68Sga-gK42trSoRbghZJNI0uu6vpYiloLX8sb9mXTPdneTDGcbXw2ow3mYX8w6wxANgoqceHEftpYMvl3wTSbblziQPaMgFIKrmGFxAa5OKYU0V9VOZg1YNOZNWCzBmw4NxQwLT1uSxEndNcNpEMoJnMx0nIt6X6molVNLaxPqolK6tqUpHaaz6T2-cWnTc72PtrBhXRVFVySD10S93XjkAK-BIwmuYCDwzZEdLNpx_A_0_8AoLapdQ</recordid><startdate>20090301</startdate><enddate>20090301</enddate><creator>Akartunalı, Kerem</creator><creator>Miller, Andrew J.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope></search><sort><creationdate>20090301</creationdate><title>A heuristic approach for big bucket multi-level production planning problems</title><author>Akartunalı, Kerem ; Miller, Andrew J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c557t-c94fa337a5dfee4adc75cff898fe280070c6aa4ce920f27388341766b42692f63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Applied sciences</topic><topic>Computer Science</topic><topic>Exact sciences and technology</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Integer programming</topic><topic>Integer programming Production planning Heuristics Relax-and-fix Strong formulations</topic><topic>Inventory control, production control. Distribution</topic><topic>Mathematical models</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations Research</topic><topic>Production planning</topic><topic>Relax-and-fix</topic><topic>Strong formulations</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Akartunalı, Kerem</creatorcontrib><creatorcontrib>Miller, Andrew J.</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Akartunalı, Kerem</au><au>Miller, Andrew J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A heuristic approach for big bucket multi-level production planning problems</atitle><jtitle>European journal of operational research</jtitle><date>2009-03-01</date><risdate>2009</risdate><volume>193</volume><issue>2</issue><spage>396</spage><epage>411</epage><pages>396-411</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2007.11.033</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2009-03, Vol.193 (2), p.396-411 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_00387052v1 |
| source | RePEc; ScienceDirect Journals (5 years ago - present) |
| subjects | Applied sciences Computer Science Exact sciences and technology Heuristic Heuristics Integer programming Integer programming Production planning Heuristics Relax-and-fix Strong formulations Inventory control, production control. Distribution Mathematical models Operational research and scientific management Operational research. Management science Operations Research Production planning Relax-and-fix Strong formulations Studies |
| title | A heuristic approach for big bucket multi-level production planning problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T07%3A59%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20heuristic%20approach%20for%20big%20bucket%20multi-level%20production%20planning%20problems&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Akartunal%C4%B1,%20Kerem&rft.date=2009-03-01&rft.volume=193&rft.issue=2&rft.spage=396&rft.epage=411&rft.pages=396-411&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2007.11.033&rft_dat=%3Cproquest_hal_p%3E1591906191%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204321901&rft_id=info:pmid/&rft_els_id=S0377221707011307&rfr_iscdi=true |