An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory
A production shop in Royal Ordnance contains machines which in many cases can be converted to manufacture any of the main products passing through the shop. The task of periodically reconfiguring the lines to match more nearly a given set of demands is a classic mathematical programming problem. A s...
Gespeichert in:
| Veröffentlicht in: | The Journal of the Operational Research Society 1993-10, Vol.44 (10), p.973-981 |
|---|---|
| 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 | 981 |
|---|---|
| container_issue | 10 |
| container_start_page | 973 |
| container_title | The Journal of the Operational Research Society |
| container_volume | 44 |
| creator | Smith, V. L. Pickard, N. B. |
| description | A production shop in Royal Ordnance contains machines which in many cases can be converted to manufacture any of the main products passing through the shop. The task of periodically reconfiguring the lines to match more nearly a given set of demands is a classic mathematical programming problem. A solution and some of its uses are presented as a case study. |
| doi_str_mv | 10.1057/jors.1993.166 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_231235113</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>2584232</jstor_id><sourcerecordid>2584232</sourcerecordid><originalsourceid>FETCH-LOGICAL-c418t-5def53ba7ec0a8214848394da7cd1a56de6ee9e1372fc45fb908286ff39e519a3</originalsourceid><addsrcrecordid>eNp1kUtr3DAURk1podO0y-7Vx9ZTXT1saTkMTRMINNDHVtyxpcGDLU0lDWH-fWWchBSalRb33O-7HFXVe6BroLL9cggxrUFrvoameVGtQLRNrXlDX1YrCg2tZaPY6-pNSgdKqaagV9XvjSfXPtu9jeQ2hn3EaRr8nvwI4ykPwZMcCJItHrEb8pncjuj9PC_sbrQTGTxBTzZxwsn6nMgldjnE89vqlcMx2Xf370X16_Lrz-1VffP92_V2c1N3AlSuZW-d5DtsbUdRMRBKKK5Fj23XA8qmt4212gJvmeuEdDtNFVONc1xbCRr5RfVxyT3G8OdkUzaHcIq-VBrGgXEJwAv06TkIONUMpGpFoeqF6mJIKVpnjnGYMJ4NUDP7NbNfM_s1xW_hP9-nYupwdBF9N6THJaFBaqkLtl6wVCa-aH5S_kzuh2XBYz5F-xg4UzP0T_chFdtPD2WctoZJJRhnBVMLNngXyhfdhTj2JuN5DPHhXv7_K_4Ct4Sz9g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1309215874</pqid></control><display><type>article</type><title>An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory</title><source>Periodicals Index Online</source><source>JSTOR Archive Collection A-Z Listing</source><creator>Smith, V. L. ; Pickard, N. B.</creator><creatorcontrib>Smith, V. L. ; Pickard, N. B.</creatorcontrib><description>A production shop in Royal Ordnance contains machines which in many cases can be converted to manufacture any of the main products passing through the shop. The task of periodically reconfiguring the lines to match more nearly a given set of demands is a classic mathematical programming problem. A solution and some of its uses are presented as a case study.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/jors.1993.166</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor & Francis</publisher><subject>Applied sciences ; Bullets ; Business and Management ; Capacity Planning ; Capital costs ; Case-Oriented Paper ; Case-Oriented Papers ; Exact sciences and technology ; Factories ; Histograms ; Integer Programming ; Machinery ; Management ; Marginal costs ; Mathematical models ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; Planning. Forecasting ; Production ; Production capacity ; Production costs ; Production planning ; Scheduling ; Spreadsheets</subject><ispartof>The Journal of the Operational Research Society, 1993-10, Vol.44 (10), p.973-981</ispartof><rights>Copyright © 1993, Operational Research Society 1993</rights><rights>Copyright 1993 The Operational Research Society Limited</rights><rights>Operational Research Society 1993</rights><rights>1993 INIST-CNRS</rights><rights>Copyright Palgrave Macmillan Limited Oct 1993</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/2584232$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/2584232$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,780,784,803,27869,27924,27925,58017,58250</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4915959$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Smith, V. L.</creatorcontrib><creatorcontrib>Pickard, N. B.</creatorcontrib><title>An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>A production shop in Royal Ordnance contains machines which in many cases can be converted to manufacture any of the main products passing through the shop. The task of periodically reconfiguring the lines to match more nearly a given set of demands is a classic mathematical programming problem. A solution and some of its uses are presented as a case study.</description><subject>Applied sciences</subject><subject>Bullets</subject><subject>Business and Management</subject><subject>Capacity Planning</subject><subject>Capital costs</subject><subject>Case-Oriented Paper</subject><subject>Case-Oriented Papers</subject><subject>Exact sciences and technology</subject><subject>Factories</subject><subject>Histograms</subject><subject>Integer Programming</subject><subject>Machinery</subject><subject>Management</subject><subject>Marginal costs</subject><subject>Mathematical models</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Planning. Forecasting</subject><subject>Production</subject><subject>Production capacity</subject><subject>Production costs</subject><subject>Production planning</subject><subject>Scheduling</subject><subject>Spreadsheets</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><sourceid>K30</sourceid><recordid>eNp1kUtr3DAURk1podO0y-7Vx9ZTXT1saTkMTRMINNDHVtyxpcGDLU0lDWH-fWWchBSalRb33O-7HFXVe6BroLL9cggxrUFrvoameVGtQLRNrXlDX1YrCg2tZaPY6-pNSgdKqaagV9XvjSfXPtu9jeQ2hn3EaRr8nvwI4ykPwZMcCJItHrEb8pncjuj9PC_sbrQTGTxBTzZxwsn6nMgldjnE89vqlcMx2Xf370X16_Lrz-1VffP92_V2c1N3AlSuZW-d5DtsbUdRMRBKKK5Fj23XA8qmt4212gJvmeuEdDtNFVONc1xbCRr5RfVxyT3G8OdkUzaHcIq-VBrGgXEJwAv06TkIONUMpGpFoeqF6mJIKVpnjnGYMJ4NUDP7NbNfM_s1xW_hP9-nYupwdBF9N6THJaFBaqkLtl6wVCa-aH5S_kzuh2XBYz5F-xg4UzP0T_chFdtPD2WctoZJJRhnBVMLNngXyhfdhTj2JuN5DPHhXv7_K_4Ct4Sz9g</recordid><startdate>19931001</startdate><enddate>19931001</enddate><creator>Smith, V. L.</creator><creator>Pickard, N. B.</creator><general>Taylor & Francis</general><general>Macmillan Press</general><general>Palgrave Macmillan UK</general><general>Palgrave</general><general>Pergamon Press</general><general>Taylor & Francis Ltd</general><scope>IQODW</scope><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></search><sort><creationdate>19931001</creationdate><title>An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory</title><author>Smith, V. L. ; Pickard, N. B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c418t-5def53ba7ec0a8214848394da7cd1a56de6ee9e1372fc45fb908286ff39e519a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Applied sciences</topic><topic>Bullets</topic><topic>Business and Management</topic><topic>Capacity Planning</topic><topic>Capital costs</topic><topic>Case-Oriented Paper</topic><topic>Case-Oriented Papers</topic><topic>Exact sciences and technology</topic><topic>Factories</topic><topic>Histograms</topic><topic>Integer Programming</topic><topic>Machinery</topic><topic>Management</topic><topic>Marginal costs</topic><topic>Mathematical models</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Planning. Forecasting</topic><topic>Production</topic><topic>Production capacity</topic><topic>Production costs</topic><topic>Production planning</topic><topic>Scheduling</topic><topic>Spreadsheets</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Smith, V. L.</creatorcontrib><creatorcontrib>Pickard, N. B.</creatorcontrib><collection>Pascal-Francis</collection><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><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Smith, V. L.</au><au>Pickard, N. B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>1993-10-01</date><risdate>1993</risdate><volume>44</volume><issue>10</issue><spage>973</spage><epage>981</epage><pages>973-981</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>JORSDZ</coden><abstract>A production shop in Royal Ordnance contains machines which in many cases can be converted to manufacture any of the main products passing through the shop. The task of periodically reconfiguring the lines to match more nearly a given set of demands is a classic mathematical programming problem. A solution and some of its uses are presented as a case study.</abstract><cop>London</cop><pub>Taylor & Francis</pub><doi>10.1057/jors.1993.166</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0160-5682 |
| ispartof | The Journal of the Operational Research Society, 1993-10, Vol.44 (10), p.973-981 |
| issn | 0160-5682 1476-9360 |
| language | eng |
| recordid | cdi_proquest_journals_231235113 |
| source | Periodicals Index Online; JSTOR Archive Collection A-Z Listing |
| subjects | Applied sciences Bullets Business and Management Capacity Planning Capital costs Case-Oriented Paper Case-Oriented Papers Exact sciences and technology Factories Histograms Integer Programming Machinery Management Marginal costs Mathematical models Operational research and scientific management Operational research. Management science Operations research Operations Research/Decision Theory Planning. Forecasting Production Production capacity Production costs Production planning Scheduling Spreadsheets |
| title | An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T12%3A37%3A27IST&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=An%20Integer%20Programming%20Solution%20to%20a%20Capacity%20Planning%20Problem%20in%20an%20Armaments%20Factory&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Smith,%20V.%20L.&rft.date=1993-10-01&rft.volume=44&rft.issue=10&rft.spage=973&rft.epage=981&rft.pages=973-981&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/jors.1993.166&rft_dat=%3Cjstor_proqu%3E2584232%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=1309215874&rft_id=info:pmid/&rft_jstor_id=2584232&rfr_iscdi=true |