Number of the records: 1
Periodic scheduling with obligatory vacations
- 1.
SYSNO ASEP 0338976 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Periodic scheduling with obligatory vacations Author(s) Sgall, Jiří (MU-W) RID, ORCID, SAI
Shachnai, H. (IL)
Tamir, T. (IL)Source Title Theoretical Computer Science. - : Elsevier - ISSN 0304-3975
Roč. 410, 47-49 (2009), s. 5112-5121Number of pages 10 s. Language eng - English Country NL - Netherlands Keywords periodic scheduling Subject RIV IN - Informatics, Computer Science R&D Projects 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) UT WOS 000271282800027 Annotation 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. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2010
Number of the records: 1