IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v23y2017i4d10.1007_s10732-017-9338-9.html
   My bibliography  Save this article

A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production

Author

Listed:
  • Folarin B. Oyebolu

    (University of Warwick)

  • Jeroen Lidth de Jeude

    (University of Warwick)

  • Cyrus Siganporia

    (University College London)

  • Suzanne S. Farid

    (University College London)

  • Richard Allmendinger

    (University of Manchester)

  • Juergen Branke

    (University of Warwick)

Abstract

Biopharmaceutical manufacturing requires high investments and long-term production planning. For large biopharmaceutical companies, planning typically involves multiple products and several production facilities. Production is usually done in batches with a substantial set-up cost and time for switching between products. The goal is to satisfy demand while minimising manufacturing, set-up and inventory costs. The resulting production planning problem is thus a variant of the capacitated lot-sizing and scheduling problem, and a complex combinatorial optimisation problem. Inspired by genetic algorithm approaches to job shop scheduling, this paper proposes a tailored construction heuristic that schedules demands of multiple products sequentially across several facilities to build a multi-year production plan (solution). The sequence in which the construction heuristic schedules the different demands is optimised by a genetic algorithm. We demonstrate the effectiveness of the approach on a biopharmaceutical lot sizing problem and compare it with a mathematical programming model from the literature. We show that the genetic algorithm can outperform the mathematical programming model for certain scenarios because the discretisation of time in mathematical programming artificially restricts the solution space.

Suggested Citation

  • Folarin B. Oyebolu & Jeroen Lidth de Jeude & Cyrus Siganporia & Suzanne S. Farid & Richard Allmendinger & Juergen Branke, 2017. "A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production," Journal of Heuristics, Springer, vol. 23(4), pages 231-256, August.
    • Handle: RePEc:spr:joheur:v:23:y:2017:i:4:d:10.1007_s10732-017-9338-9
    DOI: 10.1007/s10732-017-9338-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9338-9
    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/s10732-017-9338-9?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. Almeder, Christian, 2010. "A hybrid optimization approach for multi-level capacitated lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 200(2), pages 599-606, January.
    2. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    3. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    4. Edmund K Burke & Michel Gendreau & Matthew Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & Rong Qu, 2013. "Hyper-heuristics: a survey of the state of the art," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(12), pages 1695-1724, December.
    5. Ravi Ramya & Chandrasekharan Rajendran & Hans Ziegler, 2016. "Capacitated lot-sizing problem with production carry-over and set-up splitting: mathematical models," International Journal of Production Research, Taylor & Francis Journals, vol. 54(8), pages 2332-2344, April.
    6. 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.
    7. 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.
    8. Ozdamar, Linet & Birbil, Sevket Ilker, 1998. "Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions," European Journal of Operational Research, Elsevier, vol. 110(3), pages 525-547, November.
    9. J C Ho & Y-L Chang & A O Solis, 2006. "Two modifications of the least cost per period heuristic for dynamic lot-sizing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(8), pages 1005-1013, August.
    10. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    11. 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.
    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. Dziuba, Daryna & Almeder, Christian, 2023. "New construction heuristic for capacitated lot sizing problems," European Journal of Operational Research, Elsevier, vol. 311(3), pages 906-920.
    2. Sahling, Florian & Hahn, Gerd J., 2019. "Dynamic lot sizing in biopharmaceutical manufacturing," International Journal of Production Economics, Elsevier, vol. 207(C), pages 96-106.

    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. 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.
    2. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    3. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    4. Almeder, Christian & Klabjan, Diego & Traxler, Renate & Almada-Lobo, Bernardo, 2015. "Lead time considerations for the multi-level capacitated lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 727-738.
    5. Marcos Mansano Furlan & Maristela Oliveira Santos, 2017. "BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 929-944, April.
    6. Dziuba, Daryna & Almeder, Christian, 2023. "New construction heuristic for capacitated lot sizing problems," European Journal of Operational Research, Elsevier, vol. 311(3), pages 906-920.
    7. 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.
    8. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    9. Weidenhiller, Andreas & Jodlbauer, Herbert, 2009. "Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 139-149, November.
    10. 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.
    11. Bruno, Giuseppe & Genovese, Andrea & Piccolo, Carmela, 2014. "The capacitated Lot Sizing model: A powerful tool for logistics decision making," International Journal of Production Economics, Elsevier, vol. 155(C), pages 380-390.
    12. Petering, Matthew E.H. & Chen, Xi & Hsieh, Wen-Huan, 2019. "Inventory control with flexible demand: Cyclic case with multiple batch supply and demand processes," International Journal of Production Economics, Elsevier, vol. 212(C), pages 60-77.
    13. Taş, Duygu & Gendreau, Michel & Jabali, Ola & Jans, Raf, 2019. "A capacitated lot sizing problem with stochastic setup times and overtime," European Journal of Operational Research, Elsevier, vol. 273(1), pages 146-159.
    14. 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.
    15. Abdolreza Roshani & Massimo Paolucci & Davide Giglio & Melissa Demartini & Flavio Tonelli & Maxim A. Dulebenets, 2023. "The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network," Annals of Operations Research, Springer, vol. 321(1), pages 469-505, February.
    16. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    17. Kaczmarczyk, Waldemar, 2020. "Valid inequalities for proportional lot-sizing and scheduling problem with fictitious microperiods," International Journal of Production Economics, Elsevier, vol. 219(C), pages 236-247.
    18. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
    19. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    20. Wolter, Anja & Helber, Stefan, 2013. "Simultaneous Production and Maintenance Planning for a Single Capacitated Resource facing both a Dynamic Demand and Intensive Wear and Tear," Hannover Economic Papers (HEP) dp-522, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.

    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:joheur:v:23:y:2017:i:4:d:10.1007_s10732-017-9338-9. 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.