Shared processor scheduling

Dariusz Dereniowski () and Wiesław Kubiak ()
Additional contact information
Dariusz Dereniowski: Gdańsk University of Technology
Wiesław Kubiak: Memorial University

Journal of Scheduling, 2018, vol. 21, issue 6, No 3, 583-593

Abstract: Abstract We study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an $$O(n \log n)$$ O ( n log n ) -time optimization algorithm for a class of instances in which non-decreasing order of jobs with respect to processing times provides a non-increasing order with respect to weights—this instance generalizes the unweighted case of the problem. This algorithm also leads to a $$\frac{1}{2}$$ 1 2 -approximation algorithm for the general weighted problem. The complexity of the weighted problem remains open.

Keywords: Divisible jobs; Scheduling; Shared processor (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0566-0 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:21:y:2018:i:6:d:10.1007_s10951-018-0566-0

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

DOI: 10.1007/s10951-018-0566-0

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 ().