IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v44y2023i4p515-531.html
   My bibliography  Save this article

A lion optimisation algorithm for a two-agent single-machine scheduling with periodic maintenance to minimise the sum of maximum earliness and tardiness

Author

Listed:
  • Reza Yazdani
  • Mirpouya Mirmozaffari
  • Elham Shadkam
  • Seyed Mohammad Khalili

Abstract

The multi-agent scheduling with periodic maintenance concerns has received little attention till recently. The focus of this research is on the single machine scheduling problem that the machine goes under periodic maintenance, for two agents with the aim of minimising the sum of maximum earliness and tardiness of jobs from the first agent, while ensuring that the sum of maximum earliness and tardiness of jobs from the second agent does not exceed an upper bound. For this NP-hard problem, the lion optimisation algorithm is employed to find the optimal solutions. Experimental results show that the suggested lion optimisation algorithm outperforms dragonfly algorithm (DA), grasshopper optimisation algorithm (GOA), sine cosine algorithm (SCA) and Salp swarm algorithm (SSA) in computational and optimisation stability.

Suggested Citation

  • Reza Yazdani & Mirpouya Mirmozaffari & Elham Shadkam & Seyed Mohammad Khalili, 2023. "A lion optimisation algorithm for a two-agent single-machine scheduling with periodic maintenance to minimise the sum of maximum earliness and tardiness," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 44(4), pages 515-531.
    • Handle: RePEc:ids:ijisen:v:44:y:2023:i:4:p:515-531
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=132730
    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.

    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:ids:ijisen:v:44:y:2023:i:4:p:515-531. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.