IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v314y2024i3p882-893.html
   My bibliography  Save this article

Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing

Author

Listed:
  • Li, Weidong
  • Ou, Jinwen

Abstract

Motivated by current green manufacturing standards, in this paper we study a parallel-machine scheduling model in which the energy cost incurred on each machine is machine-dependent and proportional to the load of the machine. The objective is to determine a production schedule with the minimum makespan subject to the energy constraint that the total energy cost does not exceed a given bound. We provide a technical lemma that enables us to design a very efficient approximation algorithm with a worst-case bound that can arbitrarily approach 43, improving on the existing performance ratio of 33+14≈1.686 in the literature. By introducing the concept of a monotonic schedule, we are able to develop the first polynomial time approximation scheme for this scheduling problem. The scheduling problem studied in this paper is an important special case of the generalized assignment problem (GAP). Our techniques and results bring new insights into research on the GAP.

Suggested Citation

  • Li, Weidong & Ou, Jinwen, 2024. "Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing," European Journal of Operational Research, Elsevier, vol. 314(3), pages 882-893.
    • Handle: RePEc:eee:ejores:v:314:y:2024:i:3:p:882-893
    DOI: 10.1016/j.ejor.2023.11.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723008470
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.11.008?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.

    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:eee:ejores:v:314:y:2024:i:3:p:882-893. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.