IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v28y2025i1d10.1007_s10951-024-00824-x.html
   My bibliography  Save this article

A hybrid local search algorithm for the continuous energy-constrained scheduling problem

Author

Listed:
  • Roel Brouwer

    (Utrecht University)

  • Marjan Akker

    (Utrecht University)

  • Han Hoogeveen

    (Utrecht University)

Abstract

We consider the continuous energy-constrained scheduling problem (CECSP). A set of jobs has to be processed on a continuous, shared resource. A schedule for a job consists of a start time, completion time, and a resource consumption profile. The goal is to find a schedule such that each job does not start before its release time, is completed before its deadline, satisfies its full resource requirement, and respects its lower and upper bounds on resource consumption during processing. The objective is to minimize the total weighted completion time. We present a hybrid local search approach, using simulated annealing and linear programming, and compare it to a mixed-integer linear programming (MILP) formulation. We show that the hybrid local search approach matches the MILP formulation in solution quality for small instances and is able to find a feasible solution for larger instances in reasonable time.

Suggested Citation

  • Roel Brouwer & Marjan Akker & Han Hoogeveen, 2025. "A hybrid local search algorithm for the continuous energy-constrained scheduling problem," Journal of Scheduling, Springer, vol. 28(1), pages 65-84, February.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:1:d:10.1007_s10951-024-00824-x
    DOI: 10.1007/s10951-024-00824-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-024-00824-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-024-00824-x?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:spr:jsched:v:28:y:2025:i:1:d:10.1007_s10951-024-00824-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.