IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v204y2018icp244-263.html
   My bibliography  Save this article

Process flexibility and the chaining principle in lot sizing problems

Author

Listed:
  • Fiorotto, Diego Jacinto
  • Jans, Raf
  • Alexandre de Araujo, Silvio

Abstract

We analyse the value of process flexibility in the context of a short-term deterministic lot sizing problem with backlogging, where several types of products can be made on several alternative resources. It may be very costly in practice to install resources that have complete flexibility. Therefore, it might be interesting to only implement a limited amount of flexibility so that each resource can produce only certain types of items. The flexibility decision is taken at the start of the horizon. In order to study the value of such process flexibility, we perform several analyses. First, for a standard formulation we analyse the benefits of a long chain configuration and compare this to several other configurations (such as the case with no flexibility, clustered flexibility and complete flexibility). To further analyse the benefits of the long chain, we propose a new model to determine the best long chain (given that many alternative long chain configurations exist with a different total cost). Second, we propose a new optimization model that considers the possibility of investing in flexibility and determines the best flexibility configuration for a given budget. Our computational results show that almost all benefits of process flexibility are found by adding a limited number of links, but not necessarily according to the chain principle. Further analyses also indicate that backlog cost heterogeneity, demand heterogeneity and the presence of setup times have a large impact on the value of flexibility.

Suggested Citation

  • Fiorotto, Diego Jacinto & Jans, Raf & Alexandre de Araujo, Silvio, 2018. "Process flexibility and the chaining principle in lot sizing problems," International Journal of Production Economics, Elsevier, vol. 204(C), pages 244-263.
  • Handle: RePEc:eee:proeco:v:204:y:2018:i:c:p:244-263
    DOI: 10.1016/j.ijpe.2018.07.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527318302962
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2018.07.030?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jose Juan Carreno, 1990. "Economic Lot Scheduling for Multiple Products on Parallel Identical Processors," Management Science, INFORMS, vol. 36(3), pages 348-358, March.
    2. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    3. William W. Trigeiro & L. Joseph Thomas & John O. McClain, 1989. "Capacitated Lot Sizing with Setup Times," Management Science, INFORMS, vol. 35(3), pages 353-366, March.
    4. Wancheng Feng & Chen Wang & Zuo-Jun Max Shen, 2017. "Process flexibility design in heterogeneous and unbalanced networks: A stochastic programming approach," IISE Transactions, Taylor & Francis Journals, vol. 49(8), pages 781-799, August.
    5. VAN VYVE, Matthieu & WOLSEY, Laurence A., 2006. "Approximate extended formulations," LIDAM Reprints CORE 1807, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Seyed M. Iravani & Mark P. Van Oyen & Katharine T. Sims, 2005. "Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations," Management Science, INFORMS, vol. 51(2), pages 151-166, February.
    7. Diego Fiorotto & Silvio Araujo, 2014. "Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines," Annals of Operations Research, Springer, vol. 217(1), pages 213-231, June.
    8. Rowshannahad, M. & Dauzère-Pérès, S. & Cassini, B., 2015. "Capacitated qualification management in semiconductor manufacturing," Omega, Elsevier, vol. 54(C), pages 50-59.
    9. Ana Muriel & Anand Somasundaram & Yongmei Zhang, 2006. "Impact of Partial Manufacturing Flexibility on Production Variability," Manufacturing & Service Operations Management, INFORMS, vol. 8(2), pages 192-205, April.
    10. Fabrizio Marinelli & Maria Nenni & Antonio Sforza, 2007. "Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company," Annals of Operations Research, Springer, vol. 150(1), pages 177-192, March.
    11. L. S. Lasdon & R. C. Terjung, 1971. "An Efficient Algorithm for Multi-Item Scheduling," Operations Research, INFORMS, vol. 19(4), pages 946-969, August.
    12. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    13. William C. Jordan & Stephen C. Graves, 1995. "Principles on the Benefits of Manufacturing Process Flexibility," Management Science, INFORMS, vol. 41(4), pages 577-594, April.
    14. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
    15. Zeger Degraeve & Raf Jans, 2007. "A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times," Operations Research, INFORMS, vol. 55(5), pages 909-920, October.
    16. David Simchi-Levi & Yehua Wei, 2012. "Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility," Operations Research, INFORMS, vol. 60(5), pages 1125-1141, October.
    17. BELVAUX, Gaëtan & WOLSEY, Laurence A., 2000. "bc-prod: A specialized branch-and-cut system for lot-sizing problems," LIDAM Reprints CORE 1455, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    18. Suri Gurumurthi & Saif Benjaafar, 2004. "Modeling and analysis of flexible queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(5), pages 755-782, August.
    19. Aubry, A. & Rossi, A. & Espinouse, M.-L. & Jacomino, M., 2008. "Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1115-1125, June.
    20. Stephen C. Graves & Brian T. Tomlin, 2003. "Process Flexibility in Supply Chains," Management Science, INFORMS, vol. 49(7), pages 907-919, July.
    21. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    22. Renato de Matta & Monique Guignard, 1994. "Dynamic Production Scheduling for a Process Industry," Operations Research, INFORMS, vol. 42(3), pages 492-503, June.
    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. Perraudat, Antoine & Dauzère-Pérès, Stéphane & Vialletelle, Philippe, 2022. "Robust tactical qualification decisions in flexible manufacturing systems," Omega, Elsevier, vol. 106(C).
    2. Gabriel Amaro & Diego Jacinto Fiorotto & Washington Alves Oliveira, 2023. "Impact analysis of flexibility on the integrated lot sizing and supplier selection problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 236-266, April.
    3. Verma, Nishant Kumar & Chatterjee, Ashish K., 2023. "Process flexibility in the presence of product modularity: Does modularity help?," International Journal of Production Economics, Elsevier, vol. 256(C).

    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. Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.
    2. Diego Fiorotto & Silvio Araujo, 2014. "Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines," Annals of Operations Research, Springer, vol. 217(1), pages 213-231, June.
    3. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    4. Mabel C. Chou & Geoffrey A. Chua & Huan Zheng, 2014. "On the Performance of Sparse Process Structures in Partial Postponement Production Systems," Operations Research, INFORMS, vol. 62(2), pages 348-365, April.
    5. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    6. Timothy C. Y. Chan & Daniel Letourneau & Benjamin G. Potter, 2022. "Sparse flexible design: a machine learning approach," Flexible Services and Manufacturing Journal, Springer, vol. 34(4), pages 1066-1116, December.
    7. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
    8. Ioannis Fragkos & Zeger Degraeve & Bert De Reyck, 2016. "A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 465-482, August.
    9. Timothy C. Y. Chan & Douglas Fearing, 2019. "Process Flexibility in Baseball: The Value of Positional Flexibility," Management Science, INFORMS, vol. 65(4), pages 1642-1666, April.
    10. David Simchi-Levi & Yehua Wei, 2012. "Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility," Operations Research, INFORMS, vol. 60(5), pages 1125-1141, October.
    11. Tianhu Deng & Zuo-Jun Max Shen, 2013. "Process Flexibility Design in Unbalanced Networks," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 24-32, April.
    12. Zhen Xu & Hailun Zhang & Jiheng Zhang & Rachel Q. Zhang, 2020. "Online Demand Fulfillment Under Limited Flexibility," Management Science, INFORMS, vol. 66(10), pages 4667-4685, October.
    13. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    14. Dipankar Bose & A. K. Chatterjee & Samir Barman, 2016. "Towards dominant flexibility configurations in strategic capacity planning under demand uncertainty," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 604-619, September.
    15. Tao Wu, 2022. "Predictive Search for Capacitated Multi-Item Lot Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 385-406, January.
    16. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    17. Nascimento, Mariá C.V. & Resende, Mauricio G.C. & Toledo, Franklina M.B., 2010. "GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem," European Journal of Operational Research, Elsevier, vol. 200(3), pages 747-754, February.
    18. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    19. Andrea Raiconi & Julia Pahl & Monica Gentili & Stefan Voß & Raffaele Cerulli, 2017. "Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-24, October.
    20. Rujeerapaiboon, Napat & Zhong, Yuanguang & Zhu, Dan, 2023. "Resilience of long chain under disruption," European Journal of Operational Research, Elsevier, vol. 309(2), pages 597-615.

    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:eee:proeco:v:204:y:2018:i:c:p:244-263. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.