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.
- Analysis of algorithm
- Competitive ratio
ASJC Scopus subject areas
- Management Science and Operations Research