Extension of algorithm list scheduling for a semi-online scheduling problem
A general algorithm, called ALG, for online and semi-online scheduling problem Pm||C max with m ≥ 2 is introduced. For the semi-online version, it is supposed that all job have their processing times within the interval [p, rp], where p > 0,1 > r ≤ m/m − 1. ALG is a generalization of LS and is optimal in the sense that there is not an algorithm with smaller competitive ratio than that of ALG. Copyright Physica-Verlag 2007
Volume (Year): 15 (2007)
Issue (Month): 1 (March)
|Contact details of provider:|| Web page: http://www.springer.com/business/operations+research/journal/10100|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:15:y:2007:i:1:p:97-104. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.