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 |
Issue Date: | 1-Mar-2009 | Source: | Theoretical computer science, 1 Mar. 2009, v. 410, no. 8-10, p. 776-792 | 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.) | Keywords: | Analysis of algorithm Scheduling Semi-online Competitive ratio |
Publisher: | Elsevier | Journal: | Theoretical computer science | 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 | Size | Format | |
|---|---|---|---|---|
| REV_Q2_sum.pdf | Pre-published version | 260.75 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
142
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
186
Citations as of Apr 21, 2024
SCOPUSTM
Citations
18
Last Week
0
0
Last month
0
0
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
15
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.