IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/409486.html
   My bibliography  Save this article

Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates

Author

Listed:
  • Yang-Kuei Lin

Abstract

We consider the NP-hard problem of minimizing makespan for jobs on unrelated parallel machines with release dates in this research. A heuristic and a very effective particle swarm optimization (PSO) algorithm have been proposed to tackle the problem. Two lower bounds have been proposed to serve as a basis for comparison for large problem instances. Computational results show that the proposed PSO is very accurate and that it outperforms the existing metaheuristic.

Suggested Citation

  • Yang-Kuei Lin, 2013. "Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-9, February.
    • Handle: RePEc:hin:jnlmpe:409486
    DOI: 10.1155/2013/409486
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2013/409486.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2013/409486.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/409486?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
    ---><---

    Citations

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


    Cited by:

    1. Jianfu Chen & Kai Li & Chengbin Chu & Abderrahim Sahli, 2024. "A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints," Operational Research, Springer, vol. 24(2), pages 1-27, June.

    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:hin:jnlmpe:409486. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.