IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v52y2021i14p2904-2917.html
   My bibliography  Save this article

Using two metaheuristic algorithms for scheduling parallel machines with sequence dependent set-up times in job shop industries

Author

Listed:
  • Ghorbanali Mohammadi
  • Erfan Moaddabi

Abstract

Nowadays, scheduling problem in the field of production planning has been considered by many researchers and this issue is used in various industries. Using the same parallel machines reduces the queue of WIP behind the machine and also increases production. Since scheduling problems in large scale are NP-hard, to solve them, metaheuristic algorithms are used. In this paper, Ant colony optimisation and Harmony Search algorithm are used to solve the problem as well as comparison with two other algorithms and finally, their performance is analysed and the efficient algorithm is investigated.

Suggested Citation

  • Ghorbanali Mohammadi & Erfan Moaddabi, 2021. "Using two metaheuristic algorithms for scheduling parallel machines with sequence dependent set-up times in job shop industries," International Journal of Systems Science, Taylor & Francis Journals, vol. 52(14), pages 2904-2917, October.
    • Handle: RePEc:taf:tsysxx:v:52:y:2021:i:14:p:2904-2917
    DOI: 10.1080/00207721.2021.1913534
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2021.1913534
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2021.1913534?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.

    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:taf:tsysxx:v:52:y:2021:i:14:p:2904-2917. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.