Online scheduling on uniform machines with two hierarchies

Li-ying Hou and Liying Kang ()
Additional contact information
Li-ying Hou: Nanjing Agricultural University
Liying Kang: Shanghai University

Journal of Combinatorial Optimization, 2012, vol. 24, issue 4, No 13, 593-612

Abstract: Abstract In this paper we study online scheduling problem on m parallel uniform machines with two hierarchies. The objective is to minimize the maximum completion time (makespan). Machines are provided with different capability. The machines with speed s can schedule all jobs, while the other machines with speed 1 can only process partial jobs. Online algorithms for any 0

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

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9410-6 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:24:y:2012:i:4:d:10.1007_s10878-011-9410-6

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

DOI: 10.1007/s10878-011-9410-6

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