A note on hierarchical scheduling on two uniform machines

Zhiyi Tan () and An Zhang ()
Additional contact information
Zhiyi Tan: Zhejiang University
An Zhang: Zhejiang University

Journal of Combinatorial Optimization, 2010, vol. 20, issue 1, No 6, 85-95

Abstract: Abstract This paper studies online hierarchical scheduling on two uniform machines with the objective to minimize makespan. Machines are provided with different capability, i.e., the one with speed s can schedule all jobs, while the other one with speed 1 can only process partial jobs. Optimal algorithms for any 0 1, the competitive ratio is $\min\{\frac{1+s}{s},1+\frac{2s}{1+s+s^{2}}\}$ .

Keywords: Scheduling; Online; Uniform machine; Hierarchy (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9195-4 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:20:y:2010:i:1:d:10.1007_s10878-008-9195-4

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

DOI: 10.1007/s10878-008-9195-4

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