Please use this identifier to cite or link to this item:
|Title:||List scheduling for jobs with arbitrary release times and similar lengths||Authors:||Li, R.
|Issue Date:||Dec-2007||Citation:||Li, R., Huang, H.-C. (2007-12). List scheduling for jobs with arbitrary release times and similar lengths. Journal of Scheduling 10 (6) : 365-373. ScholarBank@NUS Repository. https://doi.org/10.1007/s10951-007-0042-8||Abstract:||This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r4. For r<4, we give a lower bound and show that 2 provides an upper bound. © 2007 Springer Science+Business Media, LLC.||Source Title:||Journal of Scheduling||URI:||http://scholarbank.nus.edu.sg/handle/10635/63170||ISSN:||10946136||DOI:||10.1007/s10951-007-0042-8|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 4, 2019
WEB OF SCIENCETM
checked on Nov 27, 2019
checked on Dec 1, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.