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

Line balancing and task scheduling to minimise power peak of reconfigurable manufacturing systems

Author

Listed:
  • Xavier Delorme
  • Paolo Gianessi

Abstract

Energy efficiency has become a major concern for manufacturing systems, due to industry being the largest user of scarce, finite energy sources, and also to recent events which have pushed energy prices to alarming levels. In the present Industry 4.0 context, Reconfigurable Manufacturing Systems (RMS) are therefore one of the most promising manufacturing paradigm. In this paper, we investigate the suitability of one of the most common types of RMS, the Parallel-Serial manufacturing line with Crossover, to help minimise the peak of the electric power consumption. More specifically, the balancing of such a production line is studied, so as to integrate power peak minimisation from the design stage. Thus, we define the Parallel-Serial-with-Crossover Assembly Line Balancing Problem with Power Peak Minimization, a new combinatorial NP-hard problem. We also propose a suitable time-indexed Integer Linear Program that integrates balancing and scheduling decisions and a matheuristic algorithm designed to tackle large-size instances. Both approaches are tested on a wide set of instances. The computational results show that relevant power peak reductions can be achieved (33% on average), opening up promising perspectives from both algorithmic and managerial viewpoints.

Suggested Citation

  • Xavier Delorme & Paolo Gianessi, 2024. "Line balancing and task scheduling to minimise power peak of reconfigurable manufacturing systems," International Journal of Production Research, Taylor & Francis Journals, vol. 62(14), pages 5061-5086, July.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:14:p:5061-5086
    DOI: 10.1080/00207543.2023.2283568
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2023.2283568?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:62:y:2024:i:14:p:5061-5086. 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.