Shared multi-processor scheduling - Publikacja - MOST Wiedzy


Shared multi-processor scheduling


We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized schedules that complete each job at the same time on its private and shared processor, if any is actually used by the job, include optimal schedules. We prove that the problem is NP-hard in the strong sense for jobs with arbitrary weights, and we give an efficient, polynomial-time algorithm for the problem with equal weights.


  • 2
  • 2
    Web of Science
  • 2

Dariusz Dereniowski, Wiesław Kubiak. (2017). Shared multi-processor scheduling, 261(2), 503-514.

Informacje szczegółowe

Publikacja w czasopiśmie
artykuł w czasopiśmie wyróżnionym w JCR
Opublikowano w:
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH nr 261, wydanie 2, strony 503 - 514,
ISSN: 0377-2217
Rok wydania:
Opis bibliograficzny:
Dereniowski D., Kubiak W.: Shared multi-processor scheduling// EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. -Vol. 261, iss. 2 (2017), s.503-514

wyświetlono 10 razy

Publikacje, które mogą cię zainteresować

Meta Tagi