Semi-online scheduling on two uniform machines with the known largest size

Sheng-Yi Cai () and Qi-Fan Yang
Additional contact information
Sheng-Yi Cai: Zhejiang University
Qi-Fan Yang: Zhejiang University

Journal of Combinatorial Optimization, 2011, vol. 21, issue 4, No 1, 393-408

Abstract: Abstract This paper investigates semi-online scheduling on two uniform machines with the known largest size. Denote by s j the speed of each machine, j=1,2. Assume 0

Keywords: Analysis of algorithms; Scheduling; Semi-online; Competitive ratio; Uniform machine (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9254-5 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:21:y:2011:i:4:d:10.1007_s10878-009-9254-5

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

DOI: 10.1007/s10878-009-9254-5

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