IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines

Listed author(s):
  • Różycki, R.
  • Węglarz, J.
Registered author(s):

    This paper deals with a power-aware scheduling of preemptable independent jobs on identical parallel processors where ready time for each job is given and its completion time has to meet a given deadline. Jobs are described by (different) continuous, strictly concave functions relating their processing speeds at a time to the amount of power allotted at the moment. Power is a continuous, doubly constrained resource, i.e. both: its availability at each time instant and consumption over scheduling horizon are constrained. A methodology based on properties of minimum-length schedules is utilized to determine the existence of a feasible schedule for given amounts of energy and power. The question about minimum levels of power and energy ensuring the existence of a feasible schedule for a given set of jobs is also studied.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 218 (2012)
    Issue (Month): 1 ()
    Pages: 68-75

    in new window

    Handle: RePEc:eee:ejores:v:218:y:2012:i:1:p:68-75
    DOI: 10.1016/j.ejor.2011.10.017
    Contact details of provider: Web page:

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. Jan W\eogon glarz, 1981. "Project Scheduling with Continuously-Divisible, Doubly Constrained Resources," Management Science, INFORMS, vol. 27(9), pages 1040-1053, September.
    2. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:218:y:2012:i:1:p:68-75. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.