Optimal online algorithms on two hierarchical machines with tightly-grouped processing times

An Zhang (), Yiwei Jiang (), Lidan Fan () and Jueliang Hu ()
Additional contact information
An Zhang: Hangzhou Dianzi University
Yiwei Jiang: Zhejiang Sci-Tech University
Lidan Fan: The University of Texas at Dallas
Jueliang Hu: Zhejiang Sci-Tech University

Journal of Combinatorial Optimization, 2015, vol. 29, issue 4, No 7, 795 pages

Abstract: Abstract This paper considers an online hierarchical scheduling problem on two parallel identical machines. The objective is to minimize the makspan. It is assumed that all jobs have bounded processing times in between $$p$$ p and $$rp$$ rp , where $$p>0$$ p > 0 and $$r\ge 1$$ r ≥ 1 . We first improve a previous result by giving an optimal online algorithm for the non-preemptive version. For the preemptive version, we present an optimal preemptive algorithm without introducing idle time for all $$r\ge 1$$ r ≥ 1 . If the algorithm is allowed to use idle time, we show that the semi-online information that jobs are tightly-grouped cannot help improve the bound of the pure online problem.

Keywords: Online scheduling; Hierarchy; Competitive ratio (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9627-7 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:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9627-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9627-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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