Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
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.
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.:
- 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.
- Jan W\eogon glarz, 1981. "Project Scheduling with Continuously-Divisible, Doubly Constrained Resources," Management Science, INFORMS, vol. 27(9), pages 1040-1053, September.
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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.