A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
Jiping Tao
| Year of publication: |
2014
|
|---|---|
| Authors: | Tao, Jiping |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 43.2014, p. 215-224
|
| Subject: | Online scheduling | Parallel machine | Competitive ratio | Total weighted completion time | Instance reduction | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10010241956