Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1268
Title: Two semi-online scheduling problems on two uniform machines
Authors: Ng, CTD 
Tan, Z
He, Y
Cheng, TCE 
Keywords: Analysis of algorithm
Scheduling
Semi-online
Competitive ratio
Issue Date: 1-Mar-2009
Publisher: Elsevier B.V.
Source: Theoretical computer science, 1 Mar. 2009, v. 410, no. 8-10, p. 776-792 How to cite?
Journal: Theoretical computer science 
Abstract: This paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. (See Article file for details of the abstract.)
URI: http://hdl.handle.net/10397/1268
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.11.018
Rights: Theoretical Computer Science © 2008 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
REV_Q2_sum.pdfPre-published version260.75 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Jun 4, 2016

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Jul 24, 2016

Page view(s)

324
Last Week
0
Last month
Checked on Aug 21, 2016

Download(s)

431
Checked on Aug 21, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.