IDEAS home Printed from https://ideas.repec.org/a/ids/ijitma/v22y2023i3-4p213-225.html
   My bibliography  Save this article

Parallel machine scheduling optimisation based on an improved multi-objective artificial bee colony algorithm

Author

Listed:
  • Li-Jun Yang

Abstract

Aiming at the scheduling model of the same kind of machine, considering that low carbon emission is an urgent problem to be solved in the manufacturing industry, a mathematical model containing the maximum completion time and maximum processing energy consumption was established. In order to balance the local development ability and global search ability of an artificial bee colony algorithm, and improve the convergence speed of the algorithm, a scheduling optimisation method of parallel machine based on improved multi-objective ABC algorithm was proposed. Firstly, a chaotic image initialisation method is proposed to ensure the diversity and excellence of the initial population. Then, the individual threshold is used to dynamically adjust the search radius to improve the search accuracy and convergence speed. Finally, considering the development times of the external archive solution, the evolution is guided by selecting the elite solution reasonably. In order to verify the effectiveness of the algorithm, comparative experiments and performance analysis of the algorithm are carried out on several examples. The results show that the proposed algorithm can solve the scheduling problem of the same kind of machine effectively in practical scenarios.

Suggested Citation

  • Li-Jun Yang, 2023. "Parallel machine scheduling optimisation based on an improved multi-objective artificial bee colony algorithm," International Journal of Information Technology and Management, Inderscience Enterprises Ltd, vol. 22(3/4), pages 213-225.
  • Handle: RePEc:ids:ijitma:v:22:y:2023:i:3/4:p:213-225
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=131807
    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:ijitma:v:22:y:2023:i:3/4:p:213-225. 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=18 .

    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.