IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i11p1906-1918.html
   My bibliography  Save this article

A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity

Author

Listed:
  • Wen-Chiung Lee

    (Feng Chia University, Taichung, Taiwan (R.O.C.))

  • Jen-Ya Wang

    (Hungkuang University, Taichung, Taiwan (R.O.C.))

  • Lin-Yo Lee

    (Feng Chia University, Taichung, Taiwan (R.O.C.))

Abstract

The scheduling of maintenance activities has been extensively studied, with most studies focusing on single-machine problems. In real-world applications, however, multiple machines or assembly lines process numerous jobs simultaneously. In this paper, we study a parallel-machine scheduling problem in which the objective is to minimize the total tardiness given that there is a maintenance activity on each machine. We develop a branch-and-bound algorithm to solve the problem with a small problem size. In addition, we propose a hybrid genetic algorithm to obtain the approximate solutions when the number of jobs is large. The performance of the proposed algorithms is evaluated based mainly on computational results.

Suggested Citation

  • Wen-Chiung Lee & Jen-Ya Wang & Lin-Yo Lee, 2015. "A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(11), pages 1906-1918, November.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:11:p:1906-1918
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n11/pdf/jors201519a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n11/full/jors201519a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Michael Geurtsen & Jelle Adan & Alp Akçay, 2024. "Integrated maintenance and production scheduling for unrelated parallel machines with setup times," Flexible Services and Manufacturing Journal, Springer, vol. 36(3), pages 1046-1079, September.
    2. Kangzhou Wang & Shulin Lan & Yingxue Zhao, 2017. "A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1409-1421, November.
    3. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    4. Delgado Sobrino Daynier Rolando & Díaz Cazañas Ronald & Ružarovský Roman & Holubek Radovan, 2018. "Integrative Programming of Production and Preventive Maintenance Tasks in an Environment of Identical Parallel Machines: Proposal of a Construction Heuristic," Research Papers Faculty of Materials Science and Technology Slovak University of Technology, Sciendo, vol. 26(42), pages 127-134, June.
    5. Yang-Kuei Lin & Yin-Yi Chou, 2020. "A hybrid genetic algorithm for operating room scheduling," Health Care Management Science, Springer, vol. 23(2), pages 249-263, June.
    6. Chung-Ho Su & Jen-Ya Wang, 2022. "A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers," Mathematics, MDPI, vol. 10(7), pages 1-24, April.
    7. Sandeep Kumar & Bhupesh Kumar Lad, 2017. "Integrated production and maintenance planning for parallel machine system considering cost of rejection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 834-846, July.

    More about this item

    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:pal:jorsoc:v:66:y:2015:i:11:p:1906-1918. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.palgrave-journals.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.