Offline first-fit decreasing height scheduling of power loads

Anshu Ranjan (), Pramod Khargonekar () and Sartaj Sahni ()
Additional contact information
Anshu Ranjan: University of Florida
Pramod Khargonekar: University of Florida
Sartaj Sahni: University of Florida

Journal of Scheduling, 2017, vol. 20, issue 5, No 7, 527-542

Abstract: Abstract In this paper, we consider the problem of scheduling energy consumption loads in the setting of smart electric grids. Each load is characterized as a “job” by a start (arrival) time and a deadline by which a certain amount of electric energy must be delivered to the load. A job may be preemptable, i. e. it can be interrupted or non-preemptable. Specifically, we focus on scheduling a mixture of preemptable and non-preemptable jobs with the same arrival time and deadline with the goal of minimizing the peak power. We study and modify the first-fit decreasing height algorithm of the strip packing problem for this purpose. We prove its asymptotic performance bound: $$1.7 OPT + 1$$ 1.7 O P T + 1 and its tightness. The heuristic results in at most one preemption per job, and it can be implemented with $$O(n \log n + nq)$$ O ( n log n + n q ) time complexity where q is the number of $$non-preemptable$$ n o n - p r e e m p t a b l e jobs.

Keywords: Scheduling; Approximation algorithm; Absolute worst-case ratio; Preemption with resume (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-017-0528-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:20:y:2017:i:5:d:10.1007_s10951-017-0528-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-017-0528-y

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().