|
PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >
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, Chi-to Daniel
Tan, Zhiyi
He, Yong
Cheng, T. C. Edwin |
| Subjects: | Analysis of algorithm
Scheduling
Semi-online
Competitive ratio |
| Issue Date: | 1-Mar-2009 |
| Publisher: | Elsevier B.V. |
| Citation: | 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.) |
| Description: | 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. |
| Type: | Journal/Magazine Article |
| URI: | http://hdl.handle.net/10397/1268 |
| ISSN: | 0304-3975 |
| Appears in Collections: | LMS Journal/Magazine Articles
|
Locate publisher version via 
|
 Facebook
 del.icio.us
 LinkedIn
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.
|
|
