Setup cost reduction in the dynamic lot-size model

Recently, one primary focus of Operations Management has turned to setup reduction because of the growth of Just-in-Time(JIT) manufacturing. Porteus [1] and Billington [2] have developed optimal policies for calculating investment in setup reduction and lot-size in the EOQ model when setup cost is s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of operations management 1993-03, Vol.11 (1), p.35-43
1. Verfasser: Mekler, Victoria A.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 43
container_issue 1
container_start_page 35
container_title Journal of operations management
container_volume 11
creator Mekler, Victoria A.
description Recently, one primary focus of Operations Management has turned to setup reduction because of the growth of Just-in-Time(JIT) manufacturing. Porteus [1] and Billington [2] have developed optimal policies for calculating investment in setup reduction and lot-size in the EOQ model when setup cost is some function of investment. Zangwill [3] has examined the effects of incremental setup cost reductions in the multi-factility dynamic demand environment on costs and zeroinventory facilities. His focus is on obtaining zero-inventory facilities and maximizing savings from lower setup costs without including the cost of such an event. As an extension of these developments, we model the Wagner-Whitin problem with a one-time oportunity to invest in setup reduction. Setup cost is treated as a policy variable and defined as a function of the decision variable representing the annual amortized investment in setup cost reduction. We use an exponential setup reduction function, but speculate that the results also hold for other functions as well. In contrast to Zangwill, we take a direct approach by explicitly finding the optimal investment in setup cost reduction while generating an optimal lot-sizing schedule. Solving a model that incorporates the trade-off between investment and savings results in more realistic solutions. We use a golden section search and the Wagner-Whitin algorithm to obtain solutions for lot-size, setup cost, and the investment in setup reduction. This model is also formulated as a network to better illustrate the interaction between the decision variables. The network formulation can also be exploited to solve the problem with linear programming or network techniques. Finally, we state and prove two theorems that hold for all setup reduction models whether they assume constant or dynamic demand. The first theorem asserts that optimal values for setupt cost and lot-sizes stay fixed over a particular range of holding costs. The second theorem states that the optimal setup cost is independent of initial setup cost.
doi_str_mv 10.1016/0272-6963(93)90031-J
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_219568333</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>027269639390031J</els_id><sourcerecordid>1178845</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2955-5babcab778346f28ca9af7a352f9ddad6d84a61b7bcb0a4b89ca80fd301f23f63</originalsourceid><addsrcrecordid>eNqNkEtLxDAUhYMoOFb_gYviShfVPNo8NoIMvoaRWajrkOaBGTrNmLTK-OttqbgULxfu5nz3cA4ApwheIojoFcQMF1RQci7IhYCQoGKxB2aIM1Iggtg-mP1KDsFRSmsIISoZngH8bLt-m-uQujxa0-vOhzb3bd692dzsWrXxOm9CVyT_ZfNNMLY5BgdONcme_NwMvN7dvswfiuXq_nF-syw0FlVVVLWqtaoZ46SkDnOthHJMkQo7YYwy1PBSUVSzWtdQlTUXWnHoDIHIYeIoycDZ9Hcbw3tvUyfXoY_tYCkxEhXlZJgMlJNIx5BStE5uo9-ouJMIyrEcOSaXY3Iphh3LkYsB4xP26Ru7-xcjF6vVE6kG9HpC7ZD9w9sok_a21db4aHUnTfB_e38DKuB7uw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>219568333</pqid></control><display><type>article</type><title>Setup cost reduction in the dynamic lot-size model</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Mekler, Victoria A.</creator><creatorcontrib>Mekler, Victoria A.</creatorcontrib><description>Recently, one primary focus of Operations Management has turned to setup reduction because of the growth of Just-in-Time(JIT) manufacturing. Porteus [1] and Billington [2] have developed optimal policies for calculating investment in setup reduction and lot-size in the EOQ model when setup cost is some function of investment. Zangwill [3] has examined the effects of incremental setup cost reductions in the multi-factility dynamic demand environment on costs and zeroinventory facilities. His focus is on obtaining zero-inventory facilities and maximizing savings from lower setup costs without including the cost of such an event. As an extension of these developments, we model the Wagner-Whitin problem with a one-time oportunity to invest in setup reduction. Setup cost is treated as a policy variable and defined as a function of the decision variable representing the annual amortized investment in setup cost reduction. We use an exponential setup reduction function, but speculate that the results also hold for other functions as well. In contrast to Zangwill, we take a direct approach by explicitly finding the optimal investment in setup cost reduction while generating an optimal lot-sizing schedule. Solving a model that incorporates the trade-off between investment and savings results in more realistic solutions. We use a golden section search and the Wagner-Whitin algorithm to obtain solutions for lot-size, setup cost, and the investment in setup reduction. This model is also formulated as a network to better illustrate the interaction between the decision variables. The network formulation can also be exploited to solve the problem with linear programming or network techniques. Finally, we state and prove two theorems that hold for all setup reduction models whether they assume constant or dynamic demand. The first theorem asserts that optimal values for setupt cost and lot-sizes stay fixed over a particular range of holding costs. The second theorem states that the optimal setup cost is independent of initial setup cost.</description><identifier>ISSN: 0272-6963</identifier><identifier>EISSN: 1873-1317</identifier><identifier>DOI: 10.1016/0272-6963(93)90031-J</identifier><language>eng</language><publisher>Chicago: Elsevier B.V</publisher><subject>Algorithms ; Functions ; Linear programming ; Mathematical models ; Operations research ; Studies ; Theory</subject><ispartof>Journal of operations management, 1993-03, Vol.11 (1), p.35-43</ispartof><rights>1993</rights><rights>1993 APICS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 1993</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2955-5babcab778346f28ca9af7a352f9ddad6d84a61b7bcb0a4b89ca80fd301f23f63</citedby><cites>FETCH-LOGICAL-c2955-5babcab778346f28ca9af7a352f9ddad6d84a61b7bcb0a4b89ca80fd301f23f63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/027269639390031J$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65534</link.rule.ids></links><search><creatorcontrib>Mekler, Victoria A.</creatorcontrib><title>Setup cost reduction in the dynamic lot-size model</title><title>Journal of operations management</title><description>Recently, one primary focus of Operations Management has turned to setup reduction because of the growth of Just-in-Time(JIT) manufacturing. Porteus [1] and Billington [2] have developed optimal policies for calculating investment in setup reduction and lot-size in the EOQ model when setup cost is some function of investment. Zangwill [3] has examined the effects of incremental setup cost reductions in the multi-factility dynamic demand environment on costs and zeroinventory facilities. His focus is on obtaining zero-inventory facilities and maximizing savings from lower setup costs without including the cost of such an event. As an extension of these developments, we model the Wagner-Whitin problem with a one-time oportunity to invest in setup reduction. Setup cost is treated as a policy variable and defined as a function of the decision variable representing the annual amortized investment in setup cost reduction. We use an exponential setup reduction function, but speculate that the results also hold for other functions as well. In contrast to Zangwill, we take a direct approach by explicitly finding the optimal investment in setup cost reduction while generating an optimal lot-sizing schedule. Solving a model that incorporates the trade-off between investment and savings results in more realistic solutions. We use a golden section search and the Wagner-Whitin algorithm to obtain solutions for lot-size, setup cost, and the investment in setup reduction. This model is also formulated as a network to better illustrate the interaction between the decision variables. The network formulation can also be exploited to solve the problem with linear programming or network techniques. Finally, we state and prove two theorems that hold for all setup reduction models whether they assume constant or dynamic demand. The first theorem asserts that optimal values for setupt cost and lot-sizes stay fixed over a particular range of holding costs. The second theorem states that the optimal setup cost is independent of initial setup cost.</description><subject>Algorithms</subject><subject>Functions</subject><subject>Linear programming</subject><subject>Mathematical models</subject><subject>Operations research</subject><subject>Studies</subject><subject>Theory</subject><issn>0272-6963</issn><issn>1873-1317</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><recordid>eNqNkEtLxDAUhYMoOFb_gYviShfVPNo8NoIMvoaRWajrkOaBGTrNmLTK-OttqbgULxfu5nz3cA4ApwheIojoFcQMF1RQci7IhYCQoGKxB2aIM1Iggtg-mP1KDsFRSmsIISoZngH8bLt-m-uQujxa0-vOhzb3bd692dzsWrXxOm9CVyT_ZfNNMLY5BgdONcme_NwMvN7dvswfiuXq_nF-syw0FlVVVLWqtaoZ46SkDnOthHJMkQo7YYwy1PBSUVSzWtdQlTUXWnHoDIHIYeIoycDZ9Hcbw3tvUyfXoY_tYCkxEhXlZJgMlJNIx5BStE5uo9-ouJMIyrEcOSaXY3Iphh3LkYsB4xP26Ru7-xcjF6vVE6kG9HpC7ZD9w9sok_a21db4aHUnTfB_e38DKuB7uw</recordid><startdate>199303</startdate><enddate>199303</enddate><creator>Mekler, Victoria A.</creator><general>Elsevier B.V</general><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7TA</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope></search><sort><creationdate>199303</creationdate><title>Setup cost reduction in the dynamic lot-size model</title><author>Mekler, Victoria A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2955-5babcab778346f28ca9af7a352f9ddad6d84a61b7bcb0a4b89ca80fd301f23f63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Algorithms</topic><topic>Functions</topic><topic>Linear programming</topic><topic>Mathematical models</topic><topic>Operations research</topic><topic>Studies</topic><topic>Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mekler, Victoria A.</creatorcontrib><collection>CrossRef</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><jtitle>Journal of operations management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mekler, Victoria A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Setup cost reduction in the dynamic lot-size model</atitle><jtitle>Journal of operations management</jtitle><date>1993-03</date><risdate>1993</risdate><volume>11</volume><issue>1</issue><spage>35</spage><epage>43</epage><pages>35-43</pages><issn>0272-6963</issn><eissn>1873-1317</eissn><abstract>Recently, one primary focus of Operations Management has turned to setup reduction because of the growth of Just-in-Time(JIT) manufacturing. Porteus [1] and Billington [2] have developed optimal policies for calculating investment in setup reduction and lot-size in the EOQ model when setup cost is some function of investment. Zangwill [3] has examined the effects of incremental setup cost reductions in the multi-factility dynamic demand environment on costs and zeroinventory facilities. His focus is on obtaining zero-inventory facilities and maximizing savings from lower setup costs without including the cost of such an event. As an extension of these developments, we model the Wagner-Whitin problem with a one-time oportunity to invest in setup reduction. Setup cost is treated as a policy variable and defined as a function of the decision variable representing the annual amortized investment in setup cost reduction. We use an exponential setup reduction function, but speculate that the results also hold for other functions as well. In contrast to Zangwill, we take a direct approach by explicitly finding the optimal investment in setup cost reduction while generating an optimal lot-sizing schedule. Solving a model that incorporates the trade-off between investment and savings results in more realistic solutions. We use a golden section search and the Wagner-Whitin algorithm to obtain solutions for lot-size, setup cost, and the investment in setup reduction. This model is also formulated as a network to better illustrate the interaction between the decision variables. The network formulation can also be exploited to solve the problem with linear programming or network techniques. Finally, we state and prove two theorems that hold for all setup reduction models whether they assume constant or dynamic demand. The first theorem asserts that optimal values for setupt cost and lot-sizes stay fixed over a particular range of holding costs. The second theorem states that the optimal setup cost is independent of initial setup cost.</abstract><cop>Chicago</cop><pub>Elsevier B.V</pub><doi>10.1016/0272-6963(93)90031-J</doi><tpages>9</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0272-6963
ispartof Journal of operations management, 1993-03, Vol.11 (1), p.35-43
issn 0272-6963
1873-1317
language eng
recordid cdi_proquest_journals_219568333
source Elsevier ScienceDirect Journals Complete
subjects Algorithms
Functions
Linear programming
Mathematical models
Operations research
Studies
Theory
title Setup cost reduction in the dynamic lot-size model
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T08%3A55%3A40IST&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=Setup%20cost%20reduction%20in%20the%20dynamic%20lot-size%20model&rft.jtitle=Journal%20of%20operations%20management&rft.au=Mekler,%20Victoria%20A.&rft.date=1993-03&rft.volume=11&rft.issue=1&rft.spage=35&rft.epage=43&rft.pages=35-43&rft.issn=0272-6963&rft.eissn=1873-1317&rft_id=info:doi/10.1016/0272-6963(93)90031-J&rft_dat=%3Cproquest_cross%3E1178845%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=219568333&rft_id=info:pmid/&rft_els_id=027269639390031J&rfr_iscdi=true