IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i3p485-d1581314.html
   My bibliography  Save this article

Population-Based Search Algorithms for Biopharmaceutical Manufacturing Scheduling Problem with Heterogeneous Parallel Mixed Flowshops

Author

Listed:
  • Yong Jae Kim

    (Department of Industrial and Management Engineering, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon 22012, Republic of Korea)

  • Hyun Joo Kim

    (Department of Industrial and Management Engineering, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon 22012, Republic of Korea)

  • Byung Soo Kim

    (Department of Industrial and Management Engineering, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon 22012, Republic of Korea)

Abstract

In this paper, we address biopharmaceutical manufacturing scheduling problems with heterogeneous parallel mixed flowshops. The mixed flowshop consists of three stages, one batch process and two continuous processes. The objective function is to minimize the total tardiness. We formulated a mixed-integer linear programming model for the problem to obtain optimal solutions to small-size problems. We present a genetic algorithm and particle swarm optimization, which are used to find efficient solutions for large-size problems. We show that the particle swarm optimization outperforms the genetic algorithm in large-size problems. We conduct a sensitivity analysis to obtain managerial insights using the particle swarm optimization algorithm.

Suggested Citation

  • Yong Jae Kim & Hyun Joo Kim & Byung Soo Kim, 2025. "Population-Based Search Algorithms for Biopharmaceutical Manufacturing Scheduling Problem with Heterogeneous Parallel Mixed Flowshops," Mathematics, MDPI, vol. 13(3), pages 1-20, January.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:3:p:485-:d:1581314
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/3/485/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/3/485/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
    2. Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
    Full references (including those not matched with items on IDEAS)

    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. Xiao, Yiyong & Yuan, Yingying & Zhang, Ren-Qian & Konak, Abdullah, 2015. "Non-permutation flow shop scheduling with order acceptance and weighted tardiness," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 312-333.
    2. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    3. Groflin, Heinz & Klinkert, Andreas, 2007. "Feasible insertions in job shop scheduling, short cycles and stable sets," European Journal of Operational Research, Elsevier, vol. 177(2), pages 763-785, March.
    4. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
    5. Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2021. "Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates," Journal of Scheduling, Springer, vol. 24(6), pages 553-567, December.
    6. Camila Ramos & Alejandro Cataldo & Juan–Carlos Ferrer, 2020. "Appointment and patient scheduling in chemotherapy: a case study in Chilean hospitals," Annals of Operations Research, Springer, vol. 286(1), pages 411-439, March.
    7. Raaymakers, W. H. M. & Weijters, A. J. M. M., 2003. "Makespan estimation in batch process industries: A comparison between regression analysis and neural networks," European Journal of Operational Research, Elsevier, vol. 145(1), pages 14-30, February.
    8. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    9. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    10. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    11. Peter Bodnar & René de Koster & Kaveh Azadeh, 2017. "Scheduling Trucks in a Cross-Dock with Mixed Service Mode Dock Doors," Transportation Science, INFORMS, vol. 51(1), pages 112-131, February.
    12. Xin Chen & Sergey Kovalev & Małgorzata Sterna & Jacek Błażewicz, 2021. "Mirror scheduling problems with early work and late work criteria," Journal of Scheduling, Springer, vol. 24(5), pages 483-487, October.
    13. A. G. Leeftink & R. J. Boucherie & E. W. Hans & M. A. M. Verdaasdonk & I. M. H. Vliegen & P. J. Diest, 2018. "Batch scheduling in the histopathology laboratory," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 171-197, June.
    14. Fernández, Elena & Munoz-Marquez, Manuel, 2022. "New formulations and solutions for the strategic berth template problem," European Journal of Operational Research, Elsevier, vol. 298(1), pages 99-117.
    15. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
    16. Li, Xin & Ventura, Jose A., 2020. "Exact algorithms for a joint order acceptance and scheduling problem," International Journal of Production Economics, Elsevier, vol. 223(C).
    17. Christos Koulamas, 1997. "Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 109-125, February.
    18. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
    19. Wan, Long & Mei, Jiajie & Du, Jiangze, 2021. "Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 290(1), pages 26-35.
    20. Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.

    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:gam:jmathe:v:13:y:2025:i:3:p:485-:d:1581314. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.