Optimal preemptive scheduling for general target functions

Leah Epstein, Tamir Tassa

פרסום מחקרי: פרק בספר / בדוח / בכנספרקביקורת עמיתים


We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one aims at scheduling the jobs to the machines, allowing preemptions but forbidding parallelization, so that a given target function of the loads on each machine is minimized. This problem was studied in the past in the case of the makespan. Gonzalez and Sahni [7] and later Shachnai, Tamir and Woeginger [12] devised a polynomial algorithm that outputs an optimal schedule for which the number of preemptions is at most 2(m -1). We extend their ideas for general symmetric, convex and monotone target functions. This general approach enables us to distill the underlying principles on which the optimal makespan algorithm is based. More specifically, the general approach enables us to identify between the optimal scheduling problem and a corresponding problem of mathematical programming. This, in turn, allows us to devise a single algorithm that is suitable for a wide array of target functions, where the only difference between one target function and another is manifested through the corresponding mathematical programming problem.

שפה מקוריתאנגלית
כותר פרסום המארחMathematical Foundations of Computer Science 2004 (MFCS 2004)
עורכיםJirí Fiala, Jan Kratochvíl, Vá clav Koubek
מקום הפרסוםBerlin, Heidelberg
מוציא לאורSpringer
מספר עמודים12
מסת"ב (אלקטרוני)9783540286295
מסת"ב (מודפס)9783540228233
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2004

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (מודפס)0302-9743
ISSN (אלקטרוני)1611-3349

הערה ביבליוגרפית

Funding Information:
∗Corresponding author. E-mail addresses: [email protected] (L. Epstein), [email protected] (T. Tassa). 1Research supported by Israel Science Foundation (Grant no. 250/01).

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Optimal preemptive scheduling for general target functions'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי