Optimal and heuristic solutions for a scheduling problem arising in a foundry
A scheduling problem for an engineer-to-order foundry that manufactures propeller blades for ships is outlined. The main objective for the foundry is to find an efficient production plan that minimizes the total number of days orders are late. This has to be done subject to a set of relatively commo...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2005-09, Vol.32 (9), p.2351-2382 |
|---|---|
| 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 | 2382 |
|---|---|
| container_issue | 9 |
| container_start_page | 2351 |
| container_title | Computers & operations research |
| container_volume | 32 |
| creator | Nonås, Sigrid Lise Olsen, Kai A. |
| description | A scheduling problem for an engineer-to-order foundry that manufactures propeller blades for ships is outlined. The main objective for the foundry is to find an efficient production plan that minimizes the total number of days orders are late. This has to be done subject to a set of relatively common constraints related to the scheduling of the present jobs and resources. The constraints on the resources are quantified by a capacity matrix. A mixed integer linear programming formulation for the scheduling problem is proposed together with a set of corresponding heuristic strategies. The heuristic strategies perform very well compared to previously scheduling policies used in the company, and in comparison to optimal solutions where they can be found. Numerical results are presented to demonstrate the performance of these strategies. |
| doi_str_mv | 10.1016/j.cor.2004.03.007 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29563791</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054804000590</els_id><sourcerecordid>29563791</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-d6bf6d9c12d64b0f16ef62562fb4cf1224e4bcb64bad2580c268b9755d918b123</originalsourceid><addsrcrecordid>eNp9kEtLAzEQgIMoWKs_wFsQ9LZrkt1kd_EkxRcovSh4C3nalG1Sk12h_97UFgQPzmUY5psHHwDnGJUYYXa9LFWIJUGoLlFVItQcgAlum6poGH0_BBNUIVogWrfH4CSlJcrREDwBL_P14Faih8JruDBjdGlwCqbQj4MLPkEbIhQwqYXRY-_8B1zHIHuzgiKj29r53Ldh9DpuTsGRFX0yZ_s8BW_3d6-zx-J5_vA0u30uVNXSodBMWqY7hYlmtUQWM2MZoYxYWSuLCalNLZXMPaEJbZEirJVdQ6nucCsxqabgarc3P_M5mjTwlUvK9L3wJoyJk46yqulwBi_-gMswRp9_47ijbd3QHwjvIBVDStFYvo7ZSdxwjPjWLl_ybJdv7XJU8awuz1zuF4ukRG-j8Mql30FGWd11NHM3O85kHV_ORJ6UM14Z7aJRA9fB_XPlG0tAjzU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195847591</pqid></control><display><type>article</type><title>Optimal and heuristic solutions for a scheduling problem arising in a foundry</title><source>Access via ScienceDirect (Elsevier)</source><creator>Nonås, Sigrid Lise ; Olsen, Kai A.</creator><creatorcontrib>Nonås, Sigrid Lise ; Olsen, Kai A.</creatorcontrib><description>A scheduling problem for an engineer-to-order foundry that manufactures propeller blades for ships is outlined. The main objective for the foundry is to find an efficient production plan that minimizes the total number of days orders are late. This has to be done subject to a set of relatively common constraints related to the scheduling of the present jobs and resources. The constraints on the resources are quantified by a capacity matrix. A mixed integer linear programming formulation for the scheduling problem is proposed together with a set of corresponding heuristic strategies. The heuristic strategies perform very well compared to previously scheduling policies used in the company, and in comparison to optimal solutions where they can be found. Numerical results are presented to demonstrate the performance of these strategies.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2004.03.007</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Applied sciences ; Exact sciences and technology ; Foundries ; Heuristic ; Linear programming ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization ; Order acceptance ; Production scheduling ; Scheduling ; Scheduling, sequencing ; Studies</subject><ispartof>Computers & operations research, 2005-09, Vol.32 (9), p.2351-2382</ispartof><rights>2004 Elsevier Ltd</rights><rights>2005 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Sept 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-d6bf6d9c12d64b0f16ef62562fb4cf1224e4bcb64bad2580c268b9755d918b123</citedby><cites>FETCH-LOGICAL-c385t-d6bf6d9c12d64b0f16ef62562fb4cf1224e4bcb64bad2580c268b9755d918b123</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cor.2004.03.007$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16564995$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Nonås, Sigrid Lise</creatorcontrib><creatorcontrib>Olsen, Kai A.</creatorcontrib><title>Optimal and heuristic solutions for a scheduling problem arising in a foundry</title><title>Computers & operations research</title><description>A scheduling problem for an engineer-to-order foundry that manufactures propeller blades for ships is outlined. The main objective for the foundry is to find an efficient production plan that minimizes the total number of days orders are late. This has to be done subject to a set of relatively common constraints related to the scheduling of the present jobs and resources. The constraints on the resources are quantified by a capacity matrix. A mixed integer linear programming formulation for the scheduling problem is proposed together with a set of corresponding heuristic strategies. The heuristic strategies perform very well compared to previously scheduling policies used in the company, and in comparison to optimal solutions where they can be found. Numerical results are presented to demonstrate the performance of these strategies.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Foundries</subject><subject>Heuristic</subject><subject>Linear programming</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Order acceptance</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Studies</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEQgIMoWKs_wFsQ9LZrkt1kd_EkxRcovSh4C3nalG1Sk12h_97UFgQPzmUY5psHHwDnGJUYYXa9LFWIJUGoLlFVItQcgAlum6poGH0_BBNUIVogWrfH4CSlJcrREDwBL_P14Faih8JruDBjdGlwCqbQj4MLPkEbIhQwqYXRY-_8B1zHIHuzgiKj29r53Ldh9DpuTsGRFX0yZ_s8BW_3d6-zx-J5_vA0u30uVNXSodBMWqY7hYlmtUQWM2MZoYxYWSuLCalNLZXMPaEJbZEirJVdQ6nucCsxqabgarc3P_M5mjTwlUvK9L3wJoyJk46yqulwBi_-gMswRp9_47ijbd3QHwjvIBVDStFYvo7ZSdxwjPjWLl_ybJdv7XJU8awuz1zuF4ukRG-j8Mql30FGWd11NHM3O85kHV_ORJ6UM14Z7aJRA9fB_XPlG0tAjzU</recordid><startdate>20050901</startdate><enddate>20050901</enddate><creator>Nonås, Sigrid Lise</creator><creator>Olsen, Kai A.</creator><general>Elsevier Ltd</general><general>Elsevier Science</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20050901</creationdate><title>Optimal and heuristic solutions for a scheduling problem arising in a foundry</title><author>Nonås, Sigrid Lise ; Olsen, Kai A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-d6bf6d9c12d64b0f16ef62562fb4cf1224e4bcb64bad2580c268b9755d918b123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Foundries</topic><topic>Heuristic</topic><topic>Linear programming</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Order acceptance</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nonås, Sigrid Lise</creatorcontrib><creatorcontrib>Olsen, Kai A.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology 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><jtitle>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nonås, Sigrid Lise</au><au>Olsen, Kai A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal and heuristic solutions for a scheduling problem arising in a foundry</atitle><jtitle>Computers & operations research</jtitle><date>2005-09-01</date><risdate>2005</risdate><volume>32</volume><issue>9</issue><spage>2351</spage><epage>2382</epage><pages>2351-2382</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>A scheduling problem for an engineer-to-order foundry that manufactures propeller blades for ships is outlined. The main objective for the foundry is to find an efficient production plan that minimizes the total number of days orders are late. This has to be done subject to a set of relatively common constraints related to the scheduling of the present jobs and resources. The constraints on the resources are quantified by a capacity matrix. A mixed integer linear programming formulation for the scheduling problem is proposed together with a set of corresponding heuristic strategies. The heuristic strategies perform very well compared to previously scheduling policies used in the company, and in comparison to optimal solutions where they can be found. Numerical results are presented to demonstrate the performance of these strategies.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2004.03.007</doi><tpages>32</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2005-09, Vol.32 (9), p.2351-2382 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29563791 |
| source | Access via ScienceDirect (Elsevier) |
| subjects | Applied sciences Exact sciences and technology Foundries Heuristic Linear programming Mathematical programming Operational research and scientific management Operational research. Management science Operations research Optimization Order acceptance Production scheduling Scheduling Scheduling, sequencing Studies |
| title | Optimal and heuristic solutions for a scheduling problem arising in a foundry |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T02%3A14%3A17IST&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=Optimal%20and%20heuristic%20solutions%20for%20a%20scheduling%20problem%20arising%20in%20a%20foundry&rft.jtitle=Computers%20&%20operations%20research&rft.au=Non%C3%A5s,%20Sigrid%20Lise&rft.date=2005-09-01&rft.volume=32&rft.issue=9&rft.spage=2351&rft.epage=2382&rft.pages=2351-2382&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2004.03.007&rft_dat=%3Cproquest_cross%3E29563791%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=195847591&rft_id=info:pmid/&rft_els_id=S0305054804000590&rfr_iscdi=true |