IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v47y1999i4p601-618.html
   My bibliography  Save this article

Optimal Variance Structures and Performance Improvement of Synchronous Assembly Lines

Author

Listed:
  • Steven J. Erlebacher

    (John M. Olin School of Business, Washington University, St. Louis, Missouri 63130-4899)

  • Medini R. Singh

    (The Amos Tuck School of Business Administration, Dartmouth College, Hanover, New Hampshire 03755-9000)

Abstract

Contemporary management theories such as Just-in-Time and Total Quality Management emphasize variance reduction as a critical step in improving system performance. But little is said about how such efforts should be directed. Suppose a manager has only limited resources for variance reduction efforts. How should she allocate them among a set of competing activities? Which activity should receive the highest priority? We explore such questions in the context of a synchronous assembly line where processing times are variable, incomplete jobs are reworked at the end of the line, and the objective is to minimize the total expected work overload. Our results indicate that the station with the highest variance may not always be the best choice for variance reduction. Identifying the set of stations that should receive variance reduction in an optimal solution is not trivial. Moreover, the variances at these stations may not be reduced by the same amount or to the same level. We establish that the remaining variances among stations that receive variance reduction must conform to one of two preferred structures: equal variance or spike-shaped. Dominance results are presented to identify the set of stations and the amount of reduction in an optimal solution.

Suggested Citation

  • Steven J. Erlebacher & Medini R. Singh, 1999. "Optimal Variance Structures and Performance Improvement of Synchronous Assembly Lines," Operations Research, INFORMS, vol. 47(4), pages 601-618, August.
  • Handle: RePEc:inm:oropre:v:47:y:1999:i:4:p:601-618
    DOI: 10.1287/opre.47.4.601
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.47.4.601
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.47.4.601?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hanan Luss & Shiv K. Gupta, 1975. "Technical Note—Allocation of Effort Resources among Competing Activities," Operations Research, INFORMS, vol. 23(2), pages 360-366, April.
    2. Paul H. Zipkin, 1980. "Simple Ranking Methods for Allocation of One Resource," Management Science, INFORMS, vol. 26(1), pages 34-43, January.
    3. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    4. Candace Arai Yano & Ram Rachamadugu, 1991. "Sequencing to Minimize Work Overload in Assembly Lines with Product Options," Management Science, INFORMS, vol. 37(5), pages 572-586, May.
    5. Lau, Hon-Shiang, 1992. "On balancing variances of station processing times in unpaced lines," European Journal of Operational Research, Elsevier, vol. 61(3), pages 345-356, September.
    6. Eginhard J. Muth, 1979. "The Reversibility Property of Production Lines," Management Science, INFORMS, vol. 25(2), pages 152-158, February.
    7. Gerchak, Yigal & Parlar, Mahmut, 1991. "Investing in reducing lead-time randomness in continuous-review inventory models," Engineering Costs and Production Economics, Elsevier, vol. 21(2), pages 191-197, May.
    8. Debashish Sarkar & Willard I. Zangwill, 1991. "Variance Effects in Cyclic Production Systems," Management Science, INFORMS, vol. 37(4), pages 444-453, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ahi, Payman & Searcy, Cory & Jaber, Mohamad Y., 2018. "A Quantitative Approach for Assessing Sustainability Performance of Corporations," Ecological Economics, Elsevier, vol. 152(C), pages 336-346.
    2. Guiffrida, Alfred L. & Nagi, Rakesh, 2006. "Cost characterizations of supply chain delivery performance," International Journal of Production Economics, Elsevier, vol. 102(1), pages 22-36, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David M. Markowitz & Lawrence M. Wein, 2001. "Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem," Operations Research, INFORMS, vol. 49(2), pages 246-270, April.
    2. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "The selection allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 707-725, September.
    3. Alexandre Belloni & Giuseppe Lopomo & Shouqiang Wang, 2017. "Resource Allocation Under Demand Uncertainty and Private Information," Management Science, INFORMS, vol. 63(12), pages 4219-4235, December.
    4. Michelle Opp & Kevin Glazebrook & Vidyadhar G. Kulkarni, 2005. "Outsourcing warranty repairs: Dynamic allocation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 381-398, August.
    5. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
    6. Bajwa, Naeem & Sox, Charles R. & Ishfaq, Rafay, 2016. "Coordinating pricing and production decisions for multiple products," Omega, Elsevier, vol. 64(C), pages 86-101.
    7. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    8. Wu, Zhengping & Zhai, Xin & Liu, Zhongyi, 2015. "The inventory billboard effect on the lead-time decision," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 45-53.
    9. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    10. Mohammadivojdan, Roshanak & Geunes, Joseph, 2018. "The newsvendor problem with capacitated suppliers and quantity discounts," European Journal of Operational Research, Elsevier, vol. 271(1), pages 109-119.
    11. Shiono, Naoshi & Suzuki, Hisatoshi & Saruwatari, Yasufumi, 2019. "A dynamic programming approach for the pipe network layout problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 52-61.
    12. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    13. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    14. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    15. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    16. Xiao, Yiyong & Kaku, Ikou & Zhao, Qiuhong & Zhang, Renqian, 2011. "A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 214(2), pages 223-231, October.
    17. Leng, Mingming & Parlar, Mahmut, 2009. "Lead-time reduction in a two-level supply chain: Non-cooperative equilibria vs. coordination with a profit-sharing contract," International Journal of Production Economics, Elsevier, vol. 118(2), pages 521-544, April.
    18. Julie A. Ward, 1999. "Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 106-129, February.
    19. Bautista, Joaquín & Alfaro, Rocío & Batalla, Cristina, 2015. "Modeling and solving the mixed-model sequencing problem to improve productivity," International Journal of Production Economics, Elsevier, vol. 161(C), pages 83-95.
    20. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:47:y:1999:i:4:p:601-618. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.