IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i13p4103-4120.html
   My bibliography  Save this article

Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm

Author

Listed:
  • Xu Zheng
  • Shengchao Zhou
  • Rui Xu
  • Huaping Chen

Abstract

Reducing energy costs has become an important concern for sustainable manufacturing systems, owing to concern for the environment. We present a multi-objective hybrid ant colony optimisation (MHACO) algorithm for a real-world two-stage blocking permutation flow shop scheduling problem to address the trade-off between total energy costs (TEC) and makespan ( ${C_{\max }} $Cmax) as measures of the service level with the time-of-use (TOU) electricity price. We explore the energy-saving potential of the manufacturing industry in consideration of the differential energy costs generated by variable-speed machines. A mixed integer programming model is developed to formulate this problem. In the MHACO algorithms, the max–min pheromone restriction rules and the local search rules avoid the localisation trap and enhance neighbourhood search capabilities, respectively. The Taguchi method and small-scale pilot experiments are employed to determine the appropriate experimental parameters. Based on three well-known multi-objective optimisation algorithms, viz., NSGAII, SPEA2, and MODEA, six algorithms with different batch-sorting methods are adopted as a comparison in small-, moderate-, and large-scale instances. A four-dimensional performance evaluation system is established to evaluate the obtained Pareto frontier approximations. The computational results show that the proposed MHACO–Johnson algorithm outperforms other algorithms in terms of solution quality, quantity, and distribution, although it is time consuming when dealing with moderate- to large-scale instances.

Suggested Citation

  • Xu Zheng & Shengchao Zhou & Rui Xu & Huaping Chen, 2020. "Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 58(13), pages 4103-4120, July.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:13:p:4103-4120
    DOI: 10.1080/00207543.2019.1642529
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1642529
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1642529?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang, Zhe & Song, Xiaoling & Gong, Xue & Yin, Yong & Lev, Benjamin & Zhou, Xiaoyang, 2024. "Coordinated seru scheduling and distribution operation problems with DeJong’s learning effects," European Journal of Operational Research, Elsevier, vol. 313(2), pages 452-464.
    2. Hubert Szczepaniuk & Edyta Karolina Szczepaniuk, 2022. "Applications of Artificial Intelligence Algorithms in the Energy Sector," Energies, MDPI, vol. 16(1), pages 1-24, December.
    3. Heydar, Mojtaba & Mardaneh, Elham & Loxton, Ryan, 2022. "Approximate dynamic programming for an energy-efficient parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 302(1), pages 363-380.
    4. Shen, Liji & Dauzère-Pérès, Stéphane & Maecker, Söhnke, 2023. "Energy cost efficient scheduling in flexible job-shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 310(3), pages 992-1016.

    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:tprsxx:v:58:y:2020:i:13:p:4103-4120. 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/TPRS20 .

    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.