Extension of algorithm list scheduling for a semi-online scheduling problem

Extension of algorithm list scheduling for a semi-online scheduling problem

0.00 Avg rating—0 Votes
Article ID: iaor20073265
Country: Germany
Volume: 15
Issue: 1
Start Page Number: 97
End Page Number: 104
Publication Date: Mar 2007
Journal: Central European Journal of Operations Research
Authors: ,
Abstract:

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 jobs 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.

Reviews

Required fields are marked *. Your email address will not be published.