An effective method to reduce inventory in job shops
Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (WIP) inventory. In this paper, the "constant work-in-process" (CONWIP) concept is applied to job shop schedulin...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 792 vol.1 |
|---|---|
| container_issue | |
| container_start_page | 787 |
| container_title | |
| container_volume | 1 |
| creator | Luh, P.B. Xiaohui Zhou Tomastik, R.N. |
| description | Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (WIP) inventory. In this paper, the "constant work-in-process" (CONWIP) concept is applied to job shop scheduling to effectively control WIP inventory. A new mathematical formulation of CONWIP-based job shop scheduling with a separable structure is presented. By using a synergistic combination of Lagrangian relaxation, dynamic programming, and heuristic methods, good schedules are obtained in a reasonable amount of computation time. Results show that the new method can directly control WIP levels while maintaining good on-time delivery performance. |
| doi_str_mv | 10.1109/ROBOT.1999.770070 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_6IE</sourceid><recordid>TN_cdi_ieee_primary_770070</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>770070</ieee_id><sourcerecordid>26945683</sourcerecordid><originalsourceid>FETCH-LOGICAL-i118t-93fce93ddde19ec65baea71789d72e429dfa9dc95539e44469811739ce84b6423</originalsourceid><addsrcrecordid>eNotkEtrwkAUhYc-oNb6A9rVrLqLvZN53qUV-wBBKBa6C3HmBiMxYzNR8N83YOHAdxYfZ3EYexQwFQLw5Wv1ulpPBSJOrQWwcMVGubY2A2d_rtkErYMhUgsH5oaNBGjIlM3xjt2ntAMAKY0ZMTVrOVUV-b4-Ed9Tv42B95F3FI6eeN2eqO1jdx4a38UNT9t4SA_stiqbRJN_jtn322I9_8iWq_fP-WyZ1UK4PkNZeUIZQiCB5I3elFRaYR0Gm5PKMVQlBo9aSySllEEnhJXoyamNUbkcs-fL7qGLv0dKfbGvk6emKVuKx1TkBpU2Tg7i00Wsiag4dPW-7M7F5Rj5B40lVFc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>26945683</pqid></control><display><type>conference_proceeding</type><title>An effective method to reduce inventory in job shops</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Luh, P.B. ; Xiaohui Zhou ; Tomastik, R.N.</creator><creatorcontrib>Luh, P.B. ; Xiaohui Zhou ; Tomastik, R.N.</creatorcontrib><description>Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (WIP) inventory. In this paper, the "constant work-in-process" (CONWIP) concept is applied to job shop scheduling to effectively control WIP inventory. A new mathematical formulation of CONWIP-based job shop scheduling with a separable structure is presented. By using a synergistic combination of Lagrangian relaxation, dynamic programming, and heuristic methods, good schedules are obtained in a reasonable amount of computation time. Results show that the new method can directly control WIP levels while maintaining good on-time delivery performance.</description><identifier>ISSN: 1050-4729</identifier><identifier>ISBN: 9780780351806</identifier><identifier>ISBN: 0780351800</identifier><identifier>EISSN: 2577-087X</identifier><identifier>DOI: 10.1109/ROBOT.1999.770070</identifier><language>eng</language><publisher>IEEE</publisher><subject>Capacity planning ; Costs ; Job shop scheduling ; Lagrangian functions ; Manufacturing ; Materials requirements planning ; Processor scheduling ; Production systems ; Raw materials ; Throughput</subject><ispartof>Proceedings - IEEE International Conference on Robotics and Automation, 1999, Vol.1, p.787-792 vol.1</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/770070$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/770070$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Luh, P.B.</creatorcontrib><creatorcontrib>Xiaohui Zhou</creatorcontrib><creatorcontrib>Tomastik, R.N.</creatorcontrib><title>An effective method to reduce inventory in job shops</title><title>Proceedings - IEEE International Conference on Robotics and Automation</title><addtitle>ROBOT</addtitle><description>Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (WIP) inventory. In this paper, the "constant work-in-process" (CONWIP) concept is applied to job shop scheduling to effectively control WIP inventory. A new mathematical formulation of CONWIP-based job shop scheduling with a separable structure is presented. By using a synergistic combination of Lagrangian relaxation, dynamic programming, and heuristic methods, good schedules are obtained in a reasonable amount of computation time. Results show that the new method can directly control WIP levels while maintaining good on-time delivery performance.</description><subject>Capacity planning</subject><subject>Costs</subject><subject>Job shop scheduling</subject><subject>Lagrangian functions</subject><subject>Manufacturing</subject><subject>Materials requirements planning</subject><subject>Processor scheduling</subject><subject>Production systems</subject><subject>Raw materials</subject><subject>Throughput</subject><issn>1050-4729</issn><issn>2577-087X</issn><isbn>9780780351806</isbn><isbn>0780351800</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkEtrwkAUhYc-oNb6A9rVrLqLvZN53qUV-wBBKBa6C3HmBiMxYzNR8N83YOHAdxYfZ3EYexQwFQLw5Wv1ulpPBSJOrQWwcMVGubY2A2d_rtkErYMhUgsH5oaNBGjIlM3xjt2ntAMAKY0ZMTVrOVUV-b4-Ed9Tv42B95F3FI6eeN2eqO1jdx4a38UNT9t4SA_stiqbRJN_jtn322I9_8iWq_fP-WyZ1UK4PkNZeUIZQiCB5I3elFRaYR0Gm5PKMVQlBo9aSySllEEnhJXoyamNUbkcs-fL7qGLv0dKfbGvk6emKVuKx1TkBpU2Tg7i00Wsiag4dPW-7M7F5Rj5B40lVFc</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Luh, P.B.</creator><creator>Xiaohui Zhou</creator><creator>Tomastik, R.N.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1999</creationdate><title>An effective method to reduce inventory in job shops</title><author>Luh, P.B. ; Xiaohui Zhou ; Tomastik, R.N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i118t-93fce93ddde19ec65baea71789d72e429dfa9dc95539e44469811739ce84b6423</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Capacity planning</topic><topic>Costs</topic><topic>Job shop scheduling</topic><topic>Lagrangian functions</topic><topic>Manufacturing</topic><topic>Materials requirements planning</topic><topic>Processor scheduling</topic><topic>Production systems</topic><topic>Raw materials</topic><topic>Throughput</topic><toplevel>online_resources</toplevel><creatorcontrib>Luh, P.B.</creatorcontrib><creatorcontrib>Xiaohui Zhou</creatorcontrib><creatorcontrib>Tomastik, R.N.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Luh, P.B.</au><au>Xiaohui Zhou</au><au>Tomastik, R.N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An effective method to reduce inventory in job shops</atitle><btitle>Proceedings - IEEE International Conference on Robotics and Automation</btitle><stitle>ROBOT</stitle><date>1999</date><risdate>1999</risdate><volume>1</volume><spage>787</spage><epage>792 vol.1</epage><pages>787-792 vol.1</pages><issn>1050-4729</issn><eissn>2577-087X</eissn><isbn>9780780351806</isbn><isbn>0780351800</isbn><abstract>Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (WIP) inventory. In this paper, the "constant work-in-process" (CONWIP) concept is applied to job shop scheduling to effectively control WIP inventory. A new mathematical formulation of CONWIP-based job shop scheduling with a separable structure is presented. By using a synergistic combination of Lagrangian relaxation, dynamic programming, and heuristic methods, good schedules are obtained in a reasonable amount of computation time. Results show that the new method can directly control WIP levels while maintaining good on-time delivery performance.</abstract><pub>IEEE</pub><doi>10.1109/ROBOT.1999.770070</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1050-4729 |
| ispartof | Proceedings - IEEE International Conference on Robotics and Automation, 1999, Vol.1, p.787-792 vol.1 |
| issn | 1050-4729 2577-087X |
| language | eng |
| recordid | cdi_ieee_primary_770070 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Capacity planning Costs Job shop scheduling Lagrangian functions Manufacturing Materials requirements planning Processor scheduling Production systems Raw materials Throughput |
| title | An effective method to reduce inventory in job shops |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T00%3A03%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20effective%20method%20to%20reduce%20inventory%20in%20job%20shops&rft.btitle=Proceedings%20-%20IEEE%20International%20Conference%20on%20Robotics%20and%20Automation&rft.au=Luh,%20P.B.&rft.date=1999&rft.volume=1&rft.spage=787&rft.epage=792%20vol.1&rft.pages=787-792%20vol.1&rft.issn=1050-4729&rft.eissn=2577-087X&rft.isbn=9780780351806&rft.isbn_list=0780351800&rft_id=info:doi/10.1109/ROBOT.1999.770070&rft_dat=%3Cproquest_6IE%3E26945683%3C/proquest_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26945683&rft_id=info:pmid/&rft_ieee_id=770070&rfr_iscdi=true |