IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v29y2021i4d10.1007_s10100-020-00687-5.html
   My bibliography  Save this article

Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with strokes

Author

Listed:
  • G. Rius-Sorolla

    (Universitat Politècnica de València)

  • J. Maheut

    (Universitat Politècnica de València)

  • S. Estellés-Miguel

    (Universitat Politècnica de València)

  • J. P. García-Sabater

    (Universitat Politècnica de València)

Abstract

One of the problems when conducting research in mathematical programming models for operations planning is having an adequate database of experiments that can be used to verify advances and developments with enough factors to understand different consequences. This paper presents a test bed generator and instances database for a rolling horizons analysis for multiechelon planning, multiproduct with alternatives processes, multistroke, multicapacity with different stochastic demand patterns to be used with a stroke-like bill of materials considering production costs, setup, storage and delays for operations management. From the analysis of the operations planning obtained from this test bed, it is concluded that a product structure with an alternative process obtains the lowest total cost and the highest service level. In addition, decreasing seasonal demand could present a lower total cost than constant demand, but would generate a worse service level. This test bed will allow researchers further investigation so as to verify improvements in forecast methods, rolling horizons parameters, employed software, etc.

Suggested Citation

  • G. Rius-Sorolla & J. Maheut & S. Estellés-Miguel & J. P. García-Sabater, 2021. "Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with strokes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1289-1315, December.
    • Handle: RePEc:spr:cejnor:v:29:y:2021:i:4:d:10.1007_s10100-020-00687-5
    DOI: 10.1007/s10100-020-00687-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-020-00687-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-020-00687-5?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. Stadtler, Hartmut, 2003. "Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20204, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    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. Stadtler, Hartmut, 2000. "Improved rolling schedules for the dynamic single level lot sizing problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 14079, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Peter J. Billington & John O. McClain & L. Joseph Thomas, 1983. "Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction," Management Science, INFORMS, vol. 29(10), pages 1126-1141, October.
    5. Tiacci, Lorenzo & Saetta, Stefano, 2012. "Demand forecasting, lot sizing and scheduling on a rolling horizon basis," International Journal of Production Economics, Elsevier, vol. 140(2), pages 803-814.
    6. WOLSEY, Laurence A., 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Reprints CORE 1605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Narayanan, Arunachalam & Robinson, Powell, 2010. "Evaluation of joint replenishment lot-sizing procedures in rolling horizon planning systems," International Journal of Production Economics, Elsevier, vol. 127(1), pages 85-94, September.
    8. WOLSEY, Laurence, 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Discussion Papers CORE 2002012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Cattani, Kyle D., 2016. "Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling systemAuthor-Name: DeYong, Gregory D," European Journal of Operational Research, Elsevier, vol. 251(1), pages 85-95.
    10. Hartmut Stadtler, 2003. "Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows," Operations Research, INFORMS, vol. 51(3), pages 487-502, June.
    11. Marshall Fisher & Kamalini Ramdas & Yu-Sheng Zheng, 2001. "Ending Inventory Valuation in Multiperiod Production Scheduling," Management Science, INFORMS, vol. 47(5), pages 679-692, May.
    12. Paul Kleindorfer & Howard Kunreuther, 1978. "Stochastic Horizons for the Aggregate Planning Problem," Management Science, INFORMS, vol. 24(5), pages 485-497, January.
    13. de Sampaio, Raimundo J.B. & Wollmann, Rafael R.G. & Vieira, Paula F.G., 2017. "A flexible production planning for rolling-horizons," International Journal of Production Economics, Elsevier, vol. 190(C), pages 31-36.
    14. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    15. Suresh Chand & Vernon Ning Hsu & Suresh Sethi, 2002. "Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 25-43, September.
    16. Hartmut Stadtler, 2000. "Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem," Management Science, INFORMS, vol. 46(2), pages 318-326, February.
    17. Meyr, H., 2002. "Simultaneous Lotsizing and Scheduling on Parallel Machines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36065, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    18. Idris Lalami & Yannick Frein & Jean-Philippe Gayon, 2017. "Production planning in automotive powertrain plants: a case study," International Journal of Production Research, Taylor & Francis Journals, vol. 55(18), pages 5378-5393, September.
    19. Awi Federgruen & Michal Tzur, 1994. "Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited," Operations Research, INFORMS, vol. 42(3), pages 456-468, June.
    20. Xie, Jinxing & Zhao, Xiande & Lee, T. S., 2003. "Freezing the master production schedule under single resource constraint and demand uncertainty," International Journal of Production Economics, Elsevier, vol. 83(1), pages 65-84, January.
    21. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    22. Jose P. Garcia-Sabater & Julien Maheut & Juan A. Marin-Garcia, 2013. "A new formulation technique to model materials and operations planning: the generic materials and operations planning (GMOP) problem," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(2), pages 119-147.
    23. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, 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. Josefa Mula & Marija Bogataj, 2021. "OR in the industrial engineering of Industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1163-1184, December.

    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. Hartmut Stadtler & Malte Meistering, 2019. "Model formulations for the capacitated lot-sizing problem with service-level constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 1025-1056, December.
    2. Jans, R.F., 2006. "Solving Lotsizing Problems on Parallel Identical Machines Using Symmetry Breaking Constraints," ERIM Report Series Research in Management ERS-2006-051-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    3. 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.
    4. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    5. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    6. Daniel Quadt & Heinrich Kuhn, 2009. "Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(4), pages 366-384, June.
    7. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
    8. Charles, Mehdi & Dauzère-Pérès, Stéphane & Kedad-Sidhoum, Safia & Mazhoud, Issam, 2022. "Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 203-220.
    9. 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.
    10. Francesco Gaglioppa & Lisa A. Miller & Saif Benjaafar, 2008. "Multitask and Multistage Production Planning and Scheduling for Process Industries," Operations Research, INFORMS, vol. 56(4), pages 1010-1025, August.
    11. Christopher Suerie & Hartmut Stadtler, 2003. "The Capacitated Lot-Sizing Problem with Linked Lot Sizes," Management Science, INFORMS, vol. 49(8), pages 1039-1054, August.
    12. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    13. Guimarães, Luis & Klabjan, Diego & Almada-Lobo, Bernardo, 2013. "Pricing, relaxing and fixing under lot sizing and scheduling," European Journal of Operational Research, Elsevier, vol. 230(2), pages 399-411.
    14. Minjiao Zhang & Simge Küçükyavuz & Hande Yaman, 2012. "A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands," Operations Research, INFORMS, vol. 60(4), pages 918-935, August.
    15. 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.
    16. 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.
    17. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    18. Tiacci, Lorenzo & Saetta, Stefano, 2012. "Demand forecasting, lot sizing and scheduling on a rolling horizon basis," International Journal of Production Economics, Elsevier, vol. 140(2), pages 803-814.
    19. Meixell, Mary J., 2005. "The impact of setup costs, commonality, and capacity on schedule stability: An exploratory study," International Journal of Production Economics, Elsevier, vol. 95(1), pages 95-107, January.
    20. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.

    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:spr:cejnor:v:29:y:2021:i:4:d:10.1007_s10100-020-00687-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.