Parameter learning online algorithm for multiprocessor scheduling with rejection
In multiprocessor scheduling with rejection the jobs are characterized by a processing time and a penalty and it is possible to reject the jobs. The goal is to minimize the makespan of the schedule for the accepted jobs plus the sum of the penalties of the rejected jobs. In this paper we present a n...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
2009
|
| Sorozat: | Acta cybernetica
19 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.19.1.2009.8 |
| Online Access: | http://acta.bibl.u-szeged.hu/12856 |
| Tartalmi kivonat: | In multiprocessor scheduling with rejection the jobs are characterized by a processing time and a penalty and it is possible to reject the jobs. The goal is to minimize the makespan of the schedule for the accepted jobs plus the sum of the penalties of the rejected jobs. In this paper we present a new online algorithm for the problem. Our algorithm is a parameter learning extension of the total reject penalty algorithm. The efficiency of the algorithm is investigated by an experimental analysis. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 125-133 |
| ISSN: | 0324-721X |