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

A multi-strategy integration Pareto-based artificial colony algorithm for multi-objective flexible job shop scheduling problem with the earliness and tardiness criterion

Author

Listed:
  • Boxuan Zhao
  • Jiao Zhao
  • Yulei Gu
  • Jingshuai Yang

Abstract

This paper studies the multi-objective flexible job shop scheduling problem with the earliness and tardiness (E%T) criterion, explores the decoding and search strategies of algorithms under the coexistence of the mean E%T and makespan, and provides a makespan-constrainted three-phase decoding mechanism and local search strategies for both of them. Referencing to the flexibility of the artificial bee colony algorithm framework, multiple strategies are integrated properly in the algorithm to realise simultaneous optimisation of regular and irregular objectives. Through testing six benchmark instances of different scales with tight or loose delivery time for jobs, the distribution characteristics of the Pareto optimal solution set of the collaborative optimisation of the mean E%T and the makespan are explored. The proper integration of various search strategies can make the proposed algorithm have better performance.

Suggested Citation

  • Boxuan Zhao & Jiao Zhao & Yulei Gu & Jingshuai Yang, 2022. "A multi-strategy integration Pareto-based artificial colony algorithm for multi-objective flexible job shop scheduling problem with the earliness and tardiness criterion," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 41(2), pages 182-205.
    • Handle: RePEc:ids:ijisen:v:41:y:2022:i:2:p:182-205
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=123573
    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:41:y:2022:i:2:p:182-205. 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.