Heuristics for Multistage Production Planning Problems
Several heuristics for the capacitated multistage production planning problem with concave production costs, based on traditional production planning techniques and linear programming, are stated and empirically evaluated using a new capacity relaxation of the problem to furnish lower bounds on cost...
Gespeichert in:
| Veröffentlicht in: | The Journal of the Operational Research Society 1983-01, Vol.34 (1), p.61-70 |
|---|---|
| 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 | 70 |
|---|---|
| container_issue | 1 |
| container_start_page | 61 |
| container_title | The Journal of the Operational Research Society |
| container_volume | 34 |
| creator | Ramsay, Thomas E. Rardin, Ronald R. |
| description | Several heuristics for the capacitated multistage production planning problem with concave production costs, based on traditional production planning techniques and linear programming, are stated and empirically evaluated using a new capacity relaxation of the problem to furnish lower bounds on cost. |
| doi_str_mv | 10.1057/jors.1983.8 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_23201662</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>2581604</jstor_id><sourcerecordid>2581604</sourcerecordid><originalsourceid>FETCH-LOGICAL-c493t-cb084b8fe5a9abd50836e4d56ef392b6866b508414e91d962b495d63bc41c2d33</originalsourceid><addsrcrecordid>eNqN0U1r3DAQBmBRWsh2k1P-gGlLc0i8HX14LB3Dki9IyR7as5BlefHitRLJJuTfV8Y9LCUJPYkZHl5GvIScUlhRKMofOx_iiirJV_IDWVBRYq44wkeyAIqQFyjZEfkc4w4AFFC1IHjrxtDGobUxa3zIfo7dkEazddkm-Hq0Q-v7bNOZvm_77bSrOrePx-RTY7roTv6-S_L7-urX-ja_f7i5W1_e51YoPuS2Aikq2bjCKFPVBUiOTtQFuoYrVqFErNJSUOEUrRWySqiiRl5ZQS2rOV-Sszn3Mfin0cVB79toXZfucX6MuhQIShYlJPn9Xck4AyGw_C9IEVmCX_6BOz-GPn03GZruZ5Im9PUtRDkoRrFUkzqflQ0-xuAa_RjavQkvmoKemtNTc3pqTsukL2Ydk-q3Lhxkvsq_zXwXBx8OkxmHUrNCpu5FYjiztk9F782zD12tB_PS-dAE09s2av5a_h9kSbcO</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1309216791</pqid></control><display><type>article</type><title>Heuristics for Multistage Production Planning Problems</title><source>Jstor Complete Legacy</source><source>Periodicals Index Online</source><creator>Ramsay, Thomas E. ; Rardin, Ronald R.</creator><creatorcontrib>Ramsay, Thomas E. ; Rardin, Ronald R.</creatorcontrib><description>Several heuristics for the capacitated multistage production planning problem with concave production costs, based on traditional production planning techniques and linear programming, are stated and empirically evaluated using a new capacity relaxation of the problem to furnish lower bounds on cost.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/jors.1983.8</identifier><identifier>CODEN: OPRQAK</identifier><language>eng</language><publisher>London: Taylor & Francis</publisher><subject>Business and Management ; Capacity costs ; Capital costs ; Carrying costs ; Case-Oriented Paper ; Case-Oriented Papers ; cost benefit analysis ; Fixed charges ; Heuristic ; Heuristics ; Linear programming ; Management ; Mathematical models ; Multiple ; operations research ; Operations Research/Decision Theory ; Optimal solutions ; Production capacity ; Production costs ; Production planning ; Stages ; Variable costs</subject><ispartof>The Journal of the Operational Research Society, 1983-01, Vol.34 (1), p.61-70</ispartof><rights>Copyright © 1983, Operational Research Society 1983</rights><rights>Copyright 1983 Operational Research Society Limited</rights><rights>Operational Research Society 1983</rights><rights>Copyright Palgrave Macmillan Limited Jan 1983</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c493t-cb084b8fe5a9abd50836e4d56ef392b6866b508414e91d962b495d63bc41c2d33</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/2581604$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/2581604$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,776,780,799,27846,27901,27902,57992,58225</link.rule.ids></links><search><creatorcontrib>Ramsay, Thomas E.</creatorcontrib><creatorcontrib>Rardin, Ronald R.</creatorcontrib><title>Heuristics for Multistage Production Planning Problems</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>Several heuristics for the capacitated multistage production planning problem with concave production costs, based on traditional production planning techniques and linear programming, are stated and empirically evaluated using a new capacity relaxation of the problem to furnish lower bounds on cost.</description><subject>Business and Management</subject><subject>Capacity costs</subject><subject>Capital costs</subject><subject>Carrying costs</subject><subject>Case-Oriented Paper</subject><subject>Case-Oriented Papers</subject><subject>cost benefit analysis</subject><subject>Fixed charges</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Linear programming</subject><subject>Management</subject><subject>Mathematical models</subject><subject>Multiple</subject><subject>operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimal solutions</subject><subject>Production capacity</subject><subject>Production costs</subject><subject>Production planning</subject><subject>Stages</subject><subject>Variable costs</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1983</creationdate><recordtype>article</recordtype><sourceid>K30</sourceid><recordid>eNqN0U1r3DAQBmBRWsh2k1P-gGlLc0i8HX14LB3Dki9IyR7as5BlefHitRLJJuTfV8Y9LCUJPYkZHl5GvIScUlhRKMofOx_iiirJV_IDWVBRYq44wkeyAIqQFyjZEfkc4w4AFFC1IHjrxtDGobUxa3zIfo7dkEazddkm-Hq0Q-v7bNOZvm_77bSrOrePx-RTY7roTv6-S_L7-urX-ja_f7i5W1_e51YoPuS2Aikq2bjCKFPVBUiOTtQFuoYrVqFErNJSUOEUrRWySqiiRl5ZQS2rOV-Sszn3Mfin0cVB79toXZfucX6MuhQIShYlJPn9Xck4AyGw_C9IEVmCX_6BOz-GPn03GZruZ5Im9PUtRDkoRrFUkzqflQ0-xuAa_RjavQkvmoKemtNTc3pqTsukL2Ydk-q3Lhxkvsq_zXwXBx8OkxmHUrNCpu5FYjiztk9F782zD12tB_PS-dAE09s2av5a_h9kSbcO</recordid><startdate>19830101</startdate><enddate>19830101</enddate><creator>Ramsay, Thomas E.</creator><creator>Rardin, Ronald R.</creator><general>Taylor & Francis</general><general>Pergamon Press</general><general>Palgrave Macmillan UK</general><general>Taylor & Francis Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JXBYG</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope><scope>JQ2</scope><scope>K9.</scope><scope>U9A</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>7SC</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7TC</scope></search><sort><creationdate>19830101</creationdate><title>Heuristics for Multistage Production Planning Problems</title><author>Ramsay, Thomas E. ; Rardin, Ronald R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c493t-cb084b8fe5a9abd50836e4d56ef392b6866b508414e91d962b495d63bc41c2d33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1983</creationdate><topic>Business and Management</topic><topic>Capacity costs</topic><topic>Capital costs</topic><topic>Carrying costs</topic><topic>Case-Oriented Paper</topic><topic>Case-Oriented Papers</topic><topic>cost benefit analysis</topic><topic>Fixed charges</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Linear programming</topic><topic>Management</topic><topic>Mathematical models</topic><topic>Multiple</topic><topic>operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimal solutions</topic><topic>Production capacity</topic><topic>Production costs</topic><topic>Production planning</topic><topic>Stages</topic><topic>Variable costs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ramsay, Thomas E.</creatorcontrib><creatorcontrib>Rardin, Ronald R.</creatorcontrib><collection>CrossRef</collection><collection>Periodicals Index Online Segment 40</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access & Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access & Build (Plan A) - APAC</collection><collection>Primary Sources Access & Build (Plan A) - Canada</collection><collection>Primary Sources Access & Build (Plan A) - West</collection><collection>Primary Sources Access & Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - Midwest</collection><collection>Primary Sources Access & Build (Plan A) - North Central</collection><collection>Primary Sources Access & Build (Plan A) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Computer and Information Systems Abstracts</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>Mechanical Engineering Abstracts</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ramsay, Thomas E.</au><au>Rardin, Ronald R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Heuristics for Multistage Production Planning Problems</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>1983-01-01</date><risdate>1983</risdate><volume>34</volume><issue>1</issue><spage>61</spage><epage>70</epage><pages>61-70</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>OPRQAK</coden><abstract>Several heuristics for the capacitated multistage production planning problem with concave production costs, based on traditional production planning techniques and linear programming, are stated and empirically evaluated using a new capacity relaxation of the problem to furnish lower bounds on cost.</abstract><cop>London</cop><pub>Taylor & Francis</pub><doi>10.1057/jors.1983.8</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0160-5682 |
| ispartof | The Journal of the Operational Research Society, 1983-01, Vol.34 (1), p.61-70 |
| issn | 0160-5682 1476-9360 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_23201662 |
| source | Jstor Complete Legacy; Periodicals Index Online |
| subjects | Business and Management Capacity costs Capital costs Carrying costs Case-Oriented Paper Case-Oriented Papers cost benefit analysis Fixed charges Heuristic Heuristics Linear programming Management Mathematical models Multiple operations research Operations Research/Decision Theory Optimal solutions Production capacity Production costs Production planning Stages Variable costs |
| title | Heuristics for Multistage 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-02-10T22%3A20%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Heuristics%20for%20Multistage%20Production%20Planning%20Problems&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Ramsay,%20Thomas%20E.&rft.date=1983-01-01&rft.volume=34&rft.issue=1&rft.spage=61&rft.epage=70&rft.pages=61-70&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=OPRQAK&rft_id=info:doi/10.1057/jors.1983.8&rft_dat=%3Cjstor_proqu%3E2581604%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1309216791&rft_id=info:pmid/&rft_jstor_id=2581604&rfr_iscdi=true |