IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v45y2015i4p358-362.html

Practice Summary: Capacity Planning in the Presence of Sequence-Dependent Setups at AstraZeneca Pharmaceuticals

Author

Listed:
  • Adam Fleischhacker

    (Department of Business Administration, University of Delaware, Newark, Delaware 19716)

  • Bintong Chen

    (Department of Business Administration, University of Delaware, Newark, Delaware 19716)

  • Hemant Kher

    (Department of Business Administration, University of Delaware, Newark, Delaware 19716)

  • Mariano Mazal

    (Formulation Operations, AstraZeneca Pharmaceuticals LP, Newark, Delaware 19702)

  • Bob Pfender

    (Formulation Operations, AstraZeneca Pharmaceuticals LP, Newark, Delaware 19702)

Abstract

We implemented a capacity planning tool for AstraZeneca Pharmaceuticals LP(AZPLP), a U.S. subsidiary of a global innovative biopharmaceutical company specializing in the discovery, development, manufacturing, and marketing of prescription medicines. In this paper, we discuss the challenges of estimating capacity in this setting and use them to bring attention to the importance of minor setups. To aid capacity planning in this environment of nonlinear sequence-dependent setup times, we solve a linearized formulation of the problem using a Microsoft Excel-based optimization tool that we developed. The tool has contributed to significant reductions in planning time at AstraZeneca and greater confidence by management in any particular capacity plan’s efficiency and feasibility.

Suggested Citation

  • Adam Fleischhacker & Bintong Chen & Hemant Kher & Mariano Mazal & Bob Pfender, 2015. "Practice Summary: Capacity Planning in the Presence of Sequence-Dependent Setups at AstraZeneca Pharmaceuticals," Interfaces, INFORMS, vol. 45(4), pages 358-362, August.
    • Handle: RePEc:inm:orinte:v:45:y:2015:i:4:p:358-362
    DOI: 10.1287/inte.2015.0801
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2015.0801
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2015.0801?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. Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), 2012. "Operations Research Proceedings 2011," Operations Research Proceedings, Springer, edition 127, number 978-3-642-29210-1, March.
    2. 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.
    3. Subhash C. Sarin & Hanif D. Sherali & Lingrui Liao, 2014. "Primary pharmaceutical manufacturing scheduling problem," IISE Transactions, Taylor & Francis Journals, vol. 46(12), pages 1298-1314, December.
    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. Wang, Julong & Liu, Zhixue & Li, Feng, 2024. "Integrated production and transportation scheduling problem under nonlinear cost structures," European Journal of Operational Research, Elsevier, vol. 313(3), pages 883-904.

    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. 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.
    2. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    3. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    4. Alexander Y. Kruger, 2016. "Nonlinear Metric Subregularity," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 820-855, December.
    5. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    6. Haase, Knut & Kimms, Alf, 2000. "Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities," International Journal of Production Economics, Elsevier, vol. 66(2), pages 159-169, June.
    7. Rossi, Tommaso & Pozzi, Rossella & Testa, Mariapaola, 2017. "EOQ-based inventory management in single-machine multi-item systems," Omega, Elsevier, vol. 71(C), pages 106-113.
    8. 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.
    9. Hadi Farhangi, 2021. "Multi-Echelon Supply Chains with Lead Times and Uncertain Demands," SN Operations Research Forum, Springer, vol. 2(3), pages 1-25, September.
    10. Jing Wu & Lijie Su & Gongshu Wang & Yang Yang, 2024. "Approximated Dynamic Programming for Production and Inventory Planning Problem in Cold Rolling Process of Steel Production," Mathematics, MDPI, vol. 12(24), pages 1-17, December.
    11. Drexl, Andreas & Jordan, Carsten & Kimms, Alf, 1997. "Gruppierungs- und Reihenfolgeprobleme in der Fertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 447, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Kayse Lee Maass & Vera Mann Hey Lo & Anna Weiss & Mark S. Daskin, 2015. "Maximizing Diversity in the Engineering Global Leadership Cultural Families," Interfaces, INFORMS, vol. 45(4), pages 293-304, August.
    13. Bollapragada, Ramesh & Croce, Federico Della & Ghirardi, Marco, 2011. "Discrete-time, economic lot scheduling problem on multiple, non-identical production lines," European Journal of Operational Research, Elsevier, vol. 215(1), pages 89-96, November.
    14. 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.
    15. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    16. Andresson Silva Firmino & Ricardo Martins Abreu Silva & Valéria Cesário Times, 2019. "A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time," Journal of Heuristics, Springer, vol. 25(2), pages 141-173, April.
    17. Gabriel Frahm, 2018. "An Intersection–Union Test for the Sharpe Ratio," Risks, MDPI, vol. 6(2), pages 1-13, April.
    18. Jürgen Fleiß & Stefan Palan, 2013. "Of Coordinators and Dictators: A Public Goods Experiment," Games, MDPI, vol. 4(4), pages 1-24, October.
    19. 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.
    20. 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.

    More about this item

    Keywords

    ;
    ;

    Statistics

    Access and download statistics

    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:orinte:v:45:y:2015:i:4:p:358-362. 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.