IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v32y2018i2p127-155.html
   My bibliography  Save this article

A modified imperialist competitive algorithm for a two-agent single-machine scheduling under periodic maintenance consideration

Author

Listed:
  • Maziar Yazdani
  • Fariborz Jolai
  • Mohammad Taleghani
  • Reza Yazdani

Abstract

Scheduling with periodic maintenance has been widely studied. However, multi-agent scheduling with simultaneous considerations of periodic maintenance has hardly been considered until now. In view of this, this research focuses on the problem of scheduling jobs that come from two agents on a single machine under periodic maintenance constraint with the objective of minimising the total completion time of the jobs of the first agent while keeping the maximum tardiness of other agent below or at a fixed level UB. We present some new dominance properties for this strongly NP-hard problem. And next, using these properties, we develop a novel imperialist competitive algorithm for the problem. Various parameters of the proposed algorithm are reviewed by means of Taguchi experimental design. For the evaluation of the proposed ICA, problem data was generated to compare it against a genetic algorithm. The results of computational experiments show the good performance of the proposed algorithm.

Suggested Citation

  • Maziar Yazdani & Fariborz Jolai & Mohammad Taleghani & Reza Yazdani, 2018. "A modified imperialist competitive algorithm for a two-agent single-machine scheduling under periodic maintenance consideration," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 32(2), pages 127-155.
    • Handle: RePEc:ids:ijores:v:32:y:2018:i:2:p:127-155
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=92011
    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:ijores:v:32:y:2018:i:2:p:127-155. 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=170 .

    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.