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

A multi-objective artificial bee colony algorithm for single machine scheduling with family setup under TOU tariffs

Author

Listed:
  • Ling Xue
  • Xiuli Wang

Abstract

Time-of-use (TOU) electricity tariffs have been widely implemented in the manufacturing industry in many countries. This paper investigates a single machine scheduling problem involving incompatible job families with sequence-dependent setup times to minimise total electricity cost and total tardiness simultaneously. To tackle this problem, we propose a multi-objective artificial bee colony (MABC) algorithm. Utilising the dominance properties of the problem, we develop tailored heuristics aimed at improving the quality of initial food sources, and design multi-directional neighbourhood structures to explore desirable neighbour solutions along each objective direction. We construct a novel fitness function that not only considers Pareto rank but also incorporates the hypervolume contribution indicator to identify the promising solution space. Moreover, local integer programming is embedded into the MABC algorithm to intensify the search towards Pareto solutions. The experimental results indicate that the MABC algorithm performs significantly better than NSGA-II, SPEA2, and MOEA/D algorithms.

Suggested Citation

  • Ling Xue & Xiuli Wang, 2025. "A multi-objective artificial bee colony algorithm for single machine scheduling with family setup under TOU tariffs," International Journal of Production Research, Taylor & Francis Journals, vol. 63(10), pages 3822-3853, May.
    • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:10:p:3822-3853
    DOI: 10.1080/00207543.2024.2431178
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2431178
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2431178?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.

    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:63:y:2025:i:10:p:3822-3853. 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.