Periodic scheduling with obligatory vacations

0338976 - MÚ 2010 RIV NL eng J - Článek v odborném periodiku
Sgall, Jiří - Shachnai, H. - Tamir, T.
Periodic scheduling with obligatory vacations.
Theoretical Computer Science. Roč. 410, 47-49 (2009), s. 5112-5121. ISSN 0304-3975. E-ISSN 1879-2294
Grant CEP: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Klíčová slova: periodic scheduling
Kód oboru RIV: IN - Informatika
Impakt faktor: 0.943, rok: 2009

We consider a problem of repeatedly scheduling n jobs on m parallel machines. Each job is associated with a profit, gained each time the job is completed, and the goal is to maximize the average profit per time unit. Once the processing of a job is completed, it goes on vacation and returns to the system, ready to be processed again, only after its vacation is over.
Trvalý link: http://hdl.handle.net/11104/0182617