Parallel algorithm for setting WIP levels for multi-product CONWIP systems
Reducing work-in-process (WIP) inventory is continuing to be an important business need because of several factors including the need to reduce working capital. Numerous techniques have been suggested for WIP reduction, and CONWIP is a competitive algorithm for WIP reduction. Prior CONWIP algorithms...
Uložené v:
| Vydané v: | International journal of production research Ročník 44; číslo 21; s. 4681 - 4693 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
London
Taylor & Francis Group
01.11.2006
Washington, DC Taylor & Francis Taylor & Francis LLC |
| Predmet: | |
| ISSN: | 0020-7543, 1366-588X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Reducing work-in-process (WIP) inventory is continuing to be an important business need because of several factors including the need to reduce working capital. Numerous techniques have been suggested for WIP reduction, and CONWIP is a competitive algorithm for WIP reduction. Prior CONWIP algorithms have been primarily sequential algorithms and can be potentially incur significant computing time, especially when dealing with inventories for multiple products. The paper proposes a card-setting algorithm for multiple product types subject to routing and throughput requirements. The proposed algorithm searches the WIP space iteratively and the step-size is adaptively selected based on the known properties of multi-chain, multi-class, closed queuing networks. Furthermore, parallelization of this search algorithm across multiple processors is proposed where each processor searches a different segment of the WIP space while adaptively adjusting its step size for all product types to ensure fast convergence. The proposed parallel algorithm can take advantage of distributed computing architectures to speed-up the overall computation. An experimental implementation of the parallel algorithm using Message Passing Interface (MPI) over a high-speed network is described. Computational results demonstrate that the proposed parallel algorithm can be parallelized over eight to ten processors to obtain a speed-up of three to five. |
|---|---|
| AbstractList | Reducing work-in-process (WIP) inventory is continuing to be an important business need because of several factors including the need to reduce working capital. Numerous techniques have been suggested for WIP reduction, and CONWIP is a competitive algorithm for WIP reduction. Prior CONWIP algorithms have been primarily sequential algorithms and can be potentially incur significant computing time, especially when dealing with inventories for multiple products. The paper proposes a card-setting algorithm for multiple product types subject to routing and throughput requirements. The proposed algorithm searches the WIP space iteratively and the step-size is adaptively selected based on the known properties of multi-chain, multi-class, closed queuing networks. Furthermore, parallelization of this search algorithm across multiple processors is proposed where each processor searches a different segment of the WIP space while adaptively adjusting its step size for all product types to ensure fast convergence. The proposed parallel algorithm can take advantage of distributed computing architectures to speed-up the overall computation. An experimental implementation of the parallel algorithm using Message Passing Interface (MPI) over a high-speed network is described. Computational results demonstrate that the proposed parallel algorithm can be parallelized over eight to ten processors to obtain a speed-up of three to five. Reducing work-in-process (WIP) inventory is continuing to be an important business need because of several factors including the need to reduce working capital. Numerous techniques have been suggested for WIP reduction, and CONWIP is a competitive algorithm for WIP reduction. Prior CONWIP algorithms have been primarily sequential algorithms and can be potentially incur significant computing time, especially when dealing with inventories for multiple products. The paper proposes a card-setting algorithm for multiple product types subject to routing and throughput requirements. The proposed algorithm searches the WIP space iteratively and the step-size is adaptively selected based on the known properties of multi-chain, multi-class, closed queuing networks. Furthermore, parallelization of this search algorithm across multiple processors is proposed where each processor searches a different segment of the WIP space while adaptively adjusting its step size for all product types to ensure fast convergence. The proposed parallel algorithm can take advantage of distributed computing architectures to speed-up the overall computation. An experimental implementation of the parallel algorithm using Message Passing Interface (MPI) over a high-speed network is described. Computational results demonstrate that the proposed parallel algorithm can be parallelized over eight to ten processors to obtain a speed-up of three to five. [PUBLICATION ABSTRACT] |
| Author | Prabhu, V. Wang, L. |
| Author_xml | – sequence: 1 givenname: L. surname: Wang fullname: Wang, L. email: lzw115@psu.edu organization: The Harold and Inge Marcus Department of Industrial and Manufacturing Engineering – sequence: 2 givenname: V. surname: Prabhu fullname: Prabhu, V. organization: The Harold and Inge Marcus Department of Industrial and Manufacturing Engineering |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18109988$$DView record in Pascal Francis |
| BookMark | eNqFkcFu1DAQhi1UJLaFB-AWIcEtMJPYiS1xQatSiiraAwhu1sTrFFdOXGwH2Levly4cWgG-WPJ838wvzyE7mMNsGXuK8BJBwiuABnrBQQBwBaqHB2yFbdfVQsovB2y1q9cFaB-xw5SuoBwh-Yq9v6BI3ltfkb8M0eWvUzWGWCWbs5svq8-nF5W3361Pv56nxWdXX8ewWUyu1ucfdvW0TdlO6TF7OJJP9sn-PmKf3h5_XL-rz85PTtdvzmrDW55rRDN2nZC9MEo1Yhwa2_OBoNm0HQyoEOwwNkQGbI-E2HEcOuhHqThve27aI_bitm-J8W2xKevJJWO9p9mGJelGCY4osIDP7oBXYYlzyaYblJ0QQvECPd9DlAz5MdJsXNLX0U0UtxolglJSFq6_5UwMKUU7auMyZRfmHMl5jaB3i9D3FlFMvGP-af4PZz_NzeXbJ_oRot_oTFsf4u-I9yydf-Zivv6v2f598A0JWK57 |
| CODEN | IJPRB8 |
| CitedBy_id | crossref_primary_10_1080_00207540701324168 crossref_primary_10_1080_00207540902998323 crossref_primary_10_1080_10170669_2010_536633 crossref_primary_10_1080_00207543_2017_1420922 crossref_primary_10_1016_j_ijpe_2013_02_021 crossref_primary_10_1016_j_cor_2022_105854 crossref_primary_10_1080_23270012_2017_1344938 crossref_primary_10_1016_j_cie_2010_05_003 crossref_primary_10_1108_17410380810847945 crossref_primary_10_1080_00207543_2017_1333649 |
| Cites_doi | 10.1080/07408170304387 10.1080/00207540050205523 10.1080/002075498193435 10.1016/S0167-8191(97)00016-1 10.1287/opre.42.6.1162 10.1080/0953728031000102595 10.1016/S0167-8191(03)00045-0 10.1080/0020754042000268875 10.1145/322186.322195 10.1111/j.1475-3995.1998.tb00103.x 10.1080/00207549008942761 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 2006 2006 INIST-CNRS Copyright Taylor & Francis Group Nov 1, 2006 |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 2006 – notice: 2006 INIST-CNRS – notice: Copyright Taylor & Francis Group Nov 1, 2006 |
| DBID | AAYXX CITATION IQODW 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| DOI | 10.1080/00207540500490970 |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1366-588X |
| EndPage | 4693 |
| ExternalDocumentID | 1161194341 18109988 10_1080_00207540500490970 149080 |
| Genre | Feature |
| GroupedDBID | -~X .7F .QJ 0BK 0R~ 29J 2DF 30N 4.4 5GY 5VS 8VB A8Z AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABRLO ABTAI ABXUL ABXYU ACGEJ ACGFO ACGFS ACGOD ACIWK ACNCT ACTIO ACTTO ADCVX ADGTB ADXPE AEGXH AEISY AEMOZ AENEX AEOZL AEPSL AEYOC AFBWG AFFNX AFION AFKVX AFRVT AGDLA AGMYJ AGVKY AGWUF AHDZW AHQJS AIAGR AIJEM AIYEW AJWEG AKBVH AKOOK AKVCP ALMA_UNASSIGNED_HOLDINGS ALQZU ALRRR AQRUH AQTUD AVBZW AWYRJ BLEHA BWMZZ CAG CCCUG CE4 COF CS3 CYRSC DAOYK DGEBU DKSSO DU5 EBD EBE EBO EBR EBS EBU EJD EMK EPL ESTFP E~A E~B GTTXZ H13 HZ~ H~9 H~P I-F IPNFZ J.P K1G KYCEM M4Z ML~ NA5 NX~ O9- OPCYK P2P PQQKQ QWB RIG RNANH RNS ROSJB RTWRZ S-T SNACF TAJZE TASJS TBQAZ TDBHL TEN TFL TFT TFW TH9 TN5 TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ZL0 ZY4 ~S~ 07I 1OL 1TA 4B5 AAYXX ABDPE ACKIV ADUMR ADXEU AEHZU AEZBV AGBKS AGBLW AGYFW AI. AKHJE AKMBP ALXIB BGSSV C0- C5H CITATION DEXXA FETWF HF~ IFELN L8C LJTGL NUSFT TAP UB6 VH1 ZCG ADYSH IQODW 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c434t-11cf665875c9925fb2e74ba02d360b1910ebf2aac0e71a11641b607f8944374c3 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000241265800013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-7543 |
| IngestDate | Mon Sep 08 11:22:03 EDT 2025 Mon Nov 10 03:04:17 EST 2025 Mon Jul 21 09:13:53 EDT 2025 Tue Nov 18 22:36:43 EST 2025 Sat Nov 29 03:54:31 EST 2025 Mon Oct 20 23:43:10 EDT 2025 Mon May 13 12:08:27 EDT 2019 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 21 |
| Keywords | Multi-product CONWIP systems Parallel algorithm Distributed computer memory system Speed-up Message Passing Interface (MPI) Message passing interface Distributed memory systems In-process inventory Competitive algorithms Message transmission Search algorithm |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c434t-11cf665875c9925fb2e74ba02d360b1910ebf2aac0e71a11641b607f8944374c3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 218655594 |
| PQPubID | 30924 |
| PageCount | 13 |
| ParticipantIDs | pascalfrancis_primary_18109988 informaworld_taylorfrancis_310_1080_00207540500490970 crossref_citationtrail_10_1080_00207540500490970 crossref_primary_10_1080_00207540500490970 proquest_miscellaneous_29541151 proquest_journals_218655594 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-11-01 |
| PublicationDateYYYYMMDD | 2006-11-01 |
| PublicationDate_xml | – month: 11 year: 2006 text: 2006-11-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | London Washington, DC |
| PublicationPlace_xml | – name: London – name: Washington, DC |
| PublicationTitle | International journal of production research |
| PublicationYear | 2006 |
| Publisher | Taylor & Francis Group Taylor & Francis Taylor & Francis LLC |
| Publisher_xml | – name: Taylor & Francis Group – name: Taylor & Francis – name: Taylor & Francis LLC |
| References | Hopp WJ (CIT0008) 1996 Bertsekas DP (CIT0001) 1989 CIT0012 CIT0011 Phua KH (CIT0010) 1998; 51 Ryan SM (CIT0014) 2000; 32 Buzacott JA (CIT0002) 1993 CIT0003 CIT0013 CIT0005 CIT0016 CIT0004 CIT0015 CIT0007 CIT0006 CIT0017 CIT0009 |
| References_xml | – ident: CIT0015 doi: 10.1080/07408170304387 – volume-title: Parallel and Distributed Computing year: 1989 ident: CIT0001 – ident: CIT0006 doi: 10.1080/00207540050205523 – volume-title: Stochastic Models of Manufacturing Systems year: 1993 ident: CIT0002 – ident: CIT0013 – ident: CIT0007 doi: 10.1080/002075498193435 – volume-title: Factory Physics year: 1996 ident: CIT0008 – ident: CIT0009 doi: 10.1016/S0167-8191(97)00016-1 – ident: CIT0003 doi: 10.1287/opre.42.6.1162 – ident: CIT0005 doi: 10.1080/0953728031000102595 – ident: CIT0011 doi: 10.1016/S0167-8191(03)00045-0 – volume: 32 start-page: 105 year: 2000 ident: CIT0014 publication-title: IIE Trans. – ident: CIT0004 – ident: CIT0016 doi: 10.1080/0020754042000268875 – ident: CIT0012 doi: 10.1145/322186.322195 – volume: 51 start-page: 67 year: 1998 ident: CIT0010 publication-title: J. Int. Trans. Oper. Res. doi: 10.1111/j.1475-3995.1998.tb00103.x – ident: CIT0017 doi: 10.1080/00207549008942761 |
| SSID | ssj0000584 |
| Score | 1.8442261 |
| Snippet | Reducing work-in-process (WIP) inventory is continuing to be an important business need because of several factors including the need to reduce working... |
| SourceID | proquest pascalfrancis crossref informaworld |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 4681 |
| SubjectTerms | Algorithms Applied sciences Computer science; control theory; systems Distributed computer memory system Distributed processing Exact sciences and technology Inventory control, production control. Distribution Memory and file management (including protection and security) Memory organisation. Data processing Message Passing Interface (MPI) Multi-product CONWIP systems Operational research and scientific management Operational research. Management science Parallel algorithm Queuing theory Queuing theory. Traffic theory Software Speed-up Studies Work in process |
| Title | Parallel algorithm for setting WIP levels for multi-product CONWIP systems |
| URI | https://www.tandfonline.com/doi/abs/10.1080/00207540500490970 https://www.proquest.com/docview/218655594 https://www.proquest.com/docview/29541151 |
| Volume | 44 |
| WOSCitedRecordID | wos000241265800013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Journals Complete customDbUrl: eissn: 1366-588X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000584 issn: 0020-7543 databaseCode: TFW dateStart: 19610101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED4hxAADb0QolAxMSJacxInjEVVUgFDpUARb5Lg2VCotagLi53N20kIp6gBrfE4c2_fynb8DOBNcaiMNJWkc9wmTPCESFScJFZofRqKKMQ5n9pZ3Ounjo-jWuTlFnVZpfWhTAUU4WW2ZW-bFNCPO3uBGRYeWhgtbCW49dlT7tn5Br_3wJYfjtMZgpgTJo2lM87c3zGmlOcxSmywpC5wvUxW6WJDZThG1t_75C9uwWVug_kW1ZXZgRY92YeMbLuEe3HTlxNZYGfpy-DSeDMrnFx_H6hfaZUn7D9ddf2izjQr32CUlktcKO9Zv3XVsewURXezDffuy17oiddEFoljEShIEyiRolvBYCRHGJg81Z7mkYT9KaI7eHdW5CaVUVPNABuhtBXlCuUkFYxFnKjqA1dF4pA_Bz5lBH9UkqcE39xWTNoYn-rY0UpLwXHhAp5OeqRqR3BbGGGbBDLj0xzR5cD7r8lrBcSwjpt9XMivdGUi9jovkWflRehAv6RIt-VRzbpd8DS61occ09aAx3TZZLSWKzNYDi9GlYx6czlqRvW3MRo70-A1JRMyQa4KjPw6sAevu0MjdnjyG1XLypk9gTb2Xg2LSdAzzCfE8DrE |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NT9swFH9CDIlxYGwMEdhoDpyQLDmJHcdHhFaVUUoPneAWOa49kEqLmoD483l20tKuUw_bNbYTx34ffh_-PYBTKZSxylKScT4kTImUKFScJNZ4_LAKVYz1OLNd0etld3ey3zjcyiat0tnQtgaK8LLaMbdzRs9S4twVbtR0eNTwcSsp0GT_wFHPOgoftG_fJTHPGhRmSrB_Motq_u0VS3ppCbXUpUuqElfM1qUuVqS2V0XtT__7E3uw2xxCw_Oaaj7Dhhl_gZ0FaMJ9-NlXU1dmZRSq0e_J9KG6fwxxsmFpfKJ0eHvZD0cu4aj0j31eInmq4WPDi5uea69Rosuv8Kv9Y3DRIU3dBaJZwioSRdqmeDIRXEsZc1vERrBC0XiYpLRAA4-awsZKaWpEpCI0uKIipcJmkrFEMJ0cwOZ4MjaHEBbMoplq08zim4eaKRfGk0NXHSlNRSEDoLNVz3UDSu5qY4zyaI5d-scyBXA2H_JUI3Ks60wXtzKvvBuk2cjV7nn1WgXA1wxJ1nzqZIlM3ieXuehjlgVwPKObvBEUZe5KgnG06lgArXkrcrgL26ixmTxjF8kZMk509I8Ta8F2Z3DdzbuXvatj-Oh9SP4y5TfYrKbP5jts6ZfqoZyeeO55AxnpEtw |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NT9swFH9CBU3jwNgHIjDaHHaaZMlJnDg-IqDio-p66ERvkePYG1LXVk1A_Pk8O2lLV9TDdo2fE8f2-_J7_j2Ab4JLbaShJI3jgjDJEyJRcZJQoflhJKoY43Bme7zfT0cjMWhyc8omrdL60KYGinCy2jL3rDCLjDh7gxsVHVoaLmwlOHrsu2g2J9b3GnbvV4I4ThsQZkqQPloENd96xZpaWgMttdmSssQJM3Wliw2h7TRR98N__sMhHDQmqH9e75mPsKMnn2D_FTDhZ7gdyLktsjL25fjXdP5Q_f7j41j9Urs0af_-ZuCPbbpR6R67rEQyq8Fj_YsffdteY0SXX-Bn92p4cU2aqgtEsYhVJAiUSdAu4bESIoxNHmrOcknDIkpoju4d1bkJpVRU80AG6G4FeUK5SQVjEWcqOoLWZDrRx-DnzKCTapLU4JsLxaQN4onC1kbC1cqFB3Qx6ZlqIMltZYxxFiyRS_-aJg--L7vMajyObcT09UpmlTsEadZxkzyrnisP4i1doi2faq_tktXgUht7TFMPThfbJmvERJnZgmAx-nTMg86yFfnbBm3kRE8fkUTEDNkmOPnHgXXg3eCym_Vu-nen8N4dILmblF-hVc0f9RnsqafqoZy3He-8AMB-EY0 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+algorithm+for+setting+WIP+levels+for+multi-product+CONWIP+systems&rft.jtitle=International+journal+of+production+research&rft.au=WANG%2C+L&rft.au=PRABHU%2C+V&rft.date=2006-11-01&rft.pub=Taylor+%26+Francis&rft.issn=0020-7543&rft.volume=44&rft.issue=21&rft.spage=4681&rft.epage=4693&rft_id=info:doi/10.1080%2F00207540500490970&rft.externalDBID=n%2Fa&rft.externalDocID=18109988 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon |