# Preemptive Online Scheduling: Optimal Algorithms for All Speeds

Save this PDF as:

Size: px
Start display at page:

Download "Preemptive Online Scheduling: Optimal Algorithms for All Speeds"

## Transcription

1 Preemptive Online Scheduling: Optimal Algorithms for All Speeds Tomáš Ebenlendr Wojciech Jawor Jiří Sgall Abstract Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between and e Introduction In this paper we study an online version of the classical problem of preemptive scheduling on uniformly related machines. We are given m machines with speeds s 1 s 2 s m and a sequence of jobs, each described by its processing time (length). The time needed to process a job with length p on a machine with speed s is p/s. In the preemptive version, each job may be divided into several pieces, which can be assigned to different machines, but at different times. The objective is to find a schedule of all jobs in which the maximal completion time (makespan) is minimized. In the online problem, jobs arrive one-by-one and we need to assign each incoming job to some time slots on some machines, without any knowledge of the jobs that arrive later. This problem, also known as list scheduling, was first studied in Graham s seminal paper [12] for identical machines (i.e., s 1 = = s m = 1). The offline scheduling with makespan objective is well understood, and results for uniformly related machines were usually obtained using similar methods as for identical machines. Exact solutions can be computed with preemptions [16, 15, 10] and approximation schemes exist for the non-preemptive version [13, 14], which is NP-hard to solve exactly. In the online version, the situation is quite different. For non-preemptive scheduling, tight results are known only for two related or three identical machines. Even for deterministic algorithms on m identical machines, there still remains a small gap between the lower bound of [17] and the upper bound of [9], and a much larger gap for uniformly related machines, where the current bounds are and [2]. For randomized non-preemptive scheduling even less is known, the bounds Mathematical Institute, AS CR, Žitná 25, CZ Praha 1, Czech Republic. Partially supported by Institutional Research Plan No. AV0Z , by Inst. for Theor. Comp. Sci., Prague (project 1M0545 of MŠMT ČR), and grant 201/05/0124 of GA ČR. Department of Computer Science, University of California, Riverside, CA Supported by NSF grants CCF and OISE

2 are and for identical machines [3, 18, 1] and 2 and 4.31 for related machines [8, 2]. It is still open whether randomized algorithms are better than deterministic. The study of preemptive scheduling was partially motivated by studying the power of randomization in the non-preemptive setting. All previous lower bounds for randomized non-preemptive scheduling, except for [19], use speed sequences where tight bounds for preemptive scheduling are known and the same lower bound (but not algorithm) works also in randomized non-preemptive setting. Preemptive scheduling appears to be easier compared to non-preemptive, as we can compute an optimal solution exactly, yet up to now the tight results have been limited as well (see below). Thus our optimal algorithm for preemptive online scheduling on related machines is a significant progress. It involves new technical ideas compared both to the previous optimal algorithms for special cases of speeds and to the non-optimal algorithms for general speeds. All previous online algorithms that work for arbitrary speeds, preemptive or not, were obtained by doubling approach. This means that a competitive algorithm is designed for the case when the optimum is approximately known in advance, and then, without this knowledge, it is used in phases with geometrically increasing guesses of the optimum. Such an approach probably cannot lead to an optimal algorithm. Instead, our algorithm computes exactly the current optimum at each step of the sequence and takes full advantage of this knowledge. In all the previously known optimal algorithms for special cases, the optimal algorithms try to spread each job over many machines and maintain certain ratio of loads on the machines, generally with largest part of each job scheduled on the fast machine (unless the sequence contains very big jobs). These algorithms create no holes in the schedules, i.e., each machine is always busy from time 0 until some time t and idle afterwards. In contrast, our algorithm attempts to schedule the whole job on as slow machine as possible without violating the desired competitive ratio. This is done even at the cost of creating holes in the schedule, and using these holes efficiently is the key issue. Previous results for preemptive online scheduling. The study of online preemptive scheduling was started by Chen et al. [4], who studied the case of m identical machines. They gave an optimal algorithm with the competitive ratio 1/(1 (1 1/m) m ), which is 4/3 for m = 2 and approaches e/(e 1) when m. An optimal online algorithm for the special case of two related machines was given by Wen and Du [20], and by Epstein et al. [7]. The optimal competitive ratio in this case is 1+s 1 s 2 /(s 2 1 +s 1s 2 +s 2 2 ). A special case with non-decreasing speed ratios, i.e., s i 1/s i s i /s i+1 for i = 2,..., m 1, was studied by Epstein [6]; note that this subsumes both the case of identical and two related machines. Epstein gave an optimal competitive ratio for each sequence of speeds in this class; this ratio is equal to ( m ) s ( i R = 1 s ) 1 1 i 1 m, where S = s i. S S All these algorithms are deterministic and the matching lower bounds are known to hold also for randomized algorithms. The best algorithms for the general case were given by Ebenlendr and Sgall [5], who obtained a 4-competitive deterministic algorithm and an e competitive randomized algorithm, where e Epstein and Sgall [8] gave lower bounds on the competitive ratio for the worst case combination of speeds for any fixed m. These bounds approach 2 when m and all hold for randomized algorithms. Our results and organization of the paper. Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines. The algorithm achieves the best possible 2

3 competitive ratio not only in the general case, but also for any number of machines and any particular combination of machine speeds. We show that although our algorithm is deterministic, its competitive ratio matches the best competitive ratio of any randomized algorithm. This proves that, similarly to the case of identical machines and other special cases studied before, randomization does not help for preemptive scheduling. For any fixed set of speeds the competitive ratio of our algorithm can be computed by solving a linear program. We do not know, however, what is its worst case value over all speed combinations. Nevertheless, using the fact that there exists e-competitive randomized algorithm [5], we conclude that our (deterministic) algorithm is also e-competitive. In Section 3 we present the linear program that gives the optimal competitive ratio and the lower bound, in Section 4 we describe the algorithm and its analysis. In Section 5 we prove that no algorithm can be better than competitive, by providing an explicit numerical instance on 100 machines. This improves the lower bound of 2 of Epstein and Sgall [8]. Numerical calculations also give sequences that show that for m 8 the lower bounds given by Epstein and Sgall [8] are not tight. In Section 6 we analyze the linear program for computing the optimal competitive ratio for certain cases of speed sequences. We show that the formula given by Epstein [6] for nondecreasing speed ratios gives an upper bound on the competitive ratio for all possible speed combinations, and we extend the region where it is proven to be optimal. For m = 3 we give an exact formula for the competitive ratio for any speed combination. 2 Preliminaries Let M i, i = 1, 2,..., m denote the m machines, and let s i be the speed of M i. Without loss of generality we assume that the machines are sorted by decreasing speeds, i.e., s 1 s 2 s m. To avoid degenerate cases, we assume that s 1 > 0. Let J = (p j ) n j=1 denote the input sequence of jobs, where n is the number of jobs and p j is the length, or processing time, of jth job. Given J, let J j denote a sequence that is obtained from J by removing the last j 1 jobs. The time needed to process a job with length p on machine with speed s is equal p/s; each machine can process at most one job at any time. Preemption is allowed, which means that each job may be divided into several pieces, which can be assigned to different machines, but any two time slots to which a single job is assigned must be disjoint (no parallel processing of a job); there is no additional cost for preemptions. The objective is to find a schedule of all jobs in which the maximal completion time (makespan) is minimized. In Graham s three-field notation [11] the problem is denoted Q pmtn C max. For an algorithm A, let Cmax A [J ] denote the makespan of the schedule of J, produced by A. By Cmax [J ] we denote the makespan of the optimal offline schedule of J. In the online version of this problem, denoted Q online-list,pmtn C max, jobs arrive one-by-one and we need to assign each incoming job to some time slots on some machines, without the knowledge of the jobs that arrive later. Note that the order in the sequence is not related to the time in the schedule. Upon release of each job a complete assignment of this job at all times must be given. Online algorithms are evaluated using competitive analysis. An online algorithm A is called R-competitive if for every input J, the makespan is at most R times the optimal makespan, i.e., Cmax A [J ] R C max [J ]. In case of a randomized algorithm, the same must hold for every input for the expected makespan of the online algorithm, E[Cmax[J A ]] R Cmax[J ], where the expectation is taken over the random choices of the algorithm. Two bounds on Cmax [J ] are known. First, C max [J ] can be bounded by the total work done on all 3

4 machines, i.e., n Cmax [J ] j=1 p j m s. (1) i Second, the makespan of the optimal schedule is bounded by the makespan of the optimal schedule of any k jobs. For k m this latter schedule uses only k fastest machines so, C max[j ] P k k s i for all k = 1,..., m, (2) where P k denotes the sum of k largest processing times in J. The following is a known fact [15, 10, 5]. Fact 2.1 The value of C max[j ] is the minimal value that satisfies bounds (1) and (2). The following lemma is due to Epstein and Sgall [8]. We include the proof, as it is very helpful in understanding our results. Lemma 2.2 For any randomized R-competitive on-line algorithm A for scheduling on m machines, with or without preemption, and for any input sequence J we have n p j R j=1 m s i Cmax[J i ]. Proof: Fix a sequence of random bits used by A. Let T i denote the last time when at most i machines are running and set T m+1 = 0. First observe that n j=1 p j m s i T i. (3) During the time interval (T i+1, T i ] at most i machines are busy, and their total speed is at most s 1 +s 2 + +s i. Thus the maximum possible work done in this interval is (T i T i+1 )(s 1 +s 2 + +s i ). Summing over all i, we obtain m s it i. In any valid schedule all the jobs are completed, so (3) follows. Since the algorithm is online, the schedule for J i is obtained from the schedule for J by removing the last i 1 jobs. At time T i there are at least i jobs running, thus after removing i 1 jobs at least one machine is busy at T i. So we have T i Cmax[J A i ] for any fixed random bits. Averaging over random bits of the algorithm and using (3), we have [ n m ] p j E s i Cmax[J A i ] = j=1 m [ ] s i E Cmax[J A i ]. Since A is R-competitive, i.e., E[C A max [J i]] R C max [J i], the lemma follows. 3 The optimal competitive ratio and the lower bound We show that the value of the optimal competitive ratio for given speeds s 1,..., s m is equal to the best lower bound that can be obtained using Lemma 2.2. In this section we formalize this bound using a linear program and prove the lower bound. For each input sequence J = (p j ) n j=1, Lemma 2.2 shows that the competitive ratio is at least n j=1 p j/( m s icmax[j i ]). The set of input sequences can be restricted in two ways. First, we may 4

5 restrict ourselves to instances where the processing times of jobs are non-decreasing: If we sort the jobs, the values of Cmax[J i ] can only decrease, as in each of these partial instances we only possibly replace some jobs by smaller jobs; thus the bound on R can only increase. Second, since the bound is invariant under scaling, we may assume that it is scaled so that m s icmax [J i] = 1. Then the lower bound is simply the sum of all processing times. Now it is easy to give a linear program to compute the optimal lower bound, given the parameters s 1 s m. The linear program has variables q 1, q 2,..., q m, O 1, O 2,..., O m. Variable q 1 corresponds to the sum of all processing times in J m, variables q 2,..., q m to the processing times of the last m 1 jobs, and variables O i correspond to Cmax[J m i+1 ]. Definition 3.1 Let r(s 1,..., s m ) denote the value of the objective function of the optimal solution of the following linear program: maximize r(s 1,..., s m ) = q 1 + q 2 + q q m subject to q q k (s 1 + s s m )O k for k = 1,..., m q j + q j q k (s 1 + s s k i+1 )O k for 2 j k m s 1 O m + s 2 O m s m O 1 = 1 q j q j+1 for j = 2,..., m 1 0 q 2 0 q 1 (4) The linear program has a feasible solution with the only non-zero variable O m = 1/s 1. It is also easy to see that the objective function is bounded, the constraints imply that q 1 + q q m (s 1 + s s m )O m m s 1 O m m. Thus the value r(s 1,..., s m ) is well-defined. Finally, note that the linear program has a quadratic number of constraints, and thus it can be solved efficiently. Theorem 3.2 Any randomized online algorithm for m machines with speeds s 1 s 2 s m has competitive ratio at least r(s 1,..., s m ). Proof: There exist values q1, q 2,..., q m, O 1, O 2,..., O m of variables q 1, q 2,..., q m, O 1, O 2,..., O m, which satisfy all the constraints of the linear program (4) and r(s 1,..., s m ) = q1 + q q m. Create instance I as follows: The first m jobs have processing times p 1 = = p m = q1 /m. The remaining m 1 jobs have processing times p m+1 = q2, p m+2 = q3,..., p 2m 1 = qm. We claim that the first two families of constraints of (4) guarantee that the values Oi satisfy (1) and (2) for Cmax[I m i+1 ]. This is obvious for (1) and also for the bound (2) if the set of k largest jobs contains only jobs larger than p 1. However, if k largest jobs include a job with processing time p 1 then it is easy to see that the bound (2) is dominated either by (2) for k < k such that k largest jobs do not contain any job of processing time p 1, or by (1) which includes all m jobs with processing time p 1. Fact 2.1 then implies that Cmax[I m i+1 ] Oi for i = 1, 2,..., m. Finally, Lemma 2.2 implies that the competitive ratio of any algorithm is at least q 1 + q q m m s ic max[j i ] q 1 + q q m s 1 O m + + s m O 1 = r(s 1,..., s m ), using the constraint s 1 Om + + s m O1 = 1 in the last step. 4 The optimal algorithm In this section we present the r(s 1,..., s m )-competitive algorithm for all combinations of speeds. 5

6 The idea of the algorithm is fairly natural. First we compute the desired competitive ratio for the given speeds, r = r(s 1,..., s m ). Next, for each incoming job, we compute the optimal makespan for jobs that have arrived so far and run the incoming job as slow as possible so that it finishes at r times the computed makespan. There are many ways of creating such a schedule given the flexibility of preemptions. We choose a particular one based on the notion of a virtual machine from [5]. The ith virtual machine, denoted V i, at each time τ contains the ith fastest machine among those real machines M 1, M 2,..., M m that are idle at time τ. When we schedule (a part of) a job on a virtual machine during some interval, we actually schedule it on the corresponding real machines that are uniquely defined at each time; this is always possible to achieve using preemptions. To simplify the description of the algorithm, we assume that there are infinitely many real machines of speed zero, i.e., s i = 0 for any i > m. Scheduling a job on one of these zero-speed machines means that we do not schedule the job at the given time at all. Initially each virtual machine V i corresponds to the real machine M i ; as the incoming jobs are scheduled the assignment of the real machines to the virtual machines changes. In our algorithm, upon arrival of a job j we compute a value T j defined as r times the current optimal makespan. Then we find two adjacent virtual machines V k and V k+1, and time t j, such that if we schedule j on V k+1 in the time interval (0, t j ] and on V k from t j on, then j finishes exactly at time T j. It is essential that each job is stretched over the whole interval (0, T j ], which is the maximal time interval which it can use without violating the desired competitive ratio. Next we update the virtual machines, which means that in the interval (0, T j ] we merge V k and V k+1 into V k and shift machines V i+1, i > k, to V i. Then we continue with the next job. This gives a complete informal description of the algorithm sufficient for its implementation. To prove that this algorithm works, it is sufficient to show that if job j is scheduled on V 1, then it completes by time T j ; this is equivalent to the fact that we can schedule j as described above. We show that this is true due to our choice of r. To facilitate the proof, we maintain an assignment of scheduled jobs (and consequently busy machines) to the set of virtual machines, that is, for each virtual machine V i we compute a set S i of jobs assigned to V i. Although the incoming job j is split between two different virtual machines, at the end of each iteration each scheduled job belongs to exactly one set S i, since right after j is scheduled the virtual machines executing this job are merged (in the interval when j is executed). We stress that the sets S i serve only as means of bookkeeping for the purpose of the proof, and their computation is not an integral part of the algorithm. At each time τ, machine M i belongs to V i if it is the ith fastest idle machine at time τ, or if it is running a job j S i at time τ. At each time τ the real machines belonging to V i form a set of adjacent real machines, i.e., all machines M i, M i +1,..., M i for some i i. This relies on the fact that we always schedule a job on two adjacent virtual machines which are then merged into a single virtual machine during the times when the job is running, and on the fact that these time intervals (0, T j ] increase with j, as adding new jobs cannot decrease the optimal makespan. See Figure 1 for an example. Let v i (t) denote the speed of the virtual machine V i at time t, which is the speed of the unique idle real machine that belongs to V i. Let W i (t) = t 0 v i(τ)dτ be the total work which can be done on machine V i in the time interval (0, t]. By definition we have v i (t) v i+1 (t) and thus also W i (t) W i+1 (t) for all i and t. Note also that W m+1 (t) = v m+1 (t) = 0 for all t. 6

7 0 M 1 M 2 M 3 M 4 M 5 Figure 1: An illustration of a schedule of three jobs produced by RatioStretch. Similarly shaded regions correspond to scheduled pieces of the same job. The bold lines mark the first two virtual machines. Algorithm RatioStretch. First solve the linear program (4) for a fixed sequence of speeds s 1 s 2 s m given as input. Let r = r(s 1,..., s m ) be the optimal objective value. Initialize T 0 := 0, S i :=, v i (τ) := s i, and v m+1 (τ) := 0 for all i = 1, 2,..., m and τ 0. For each arriving job j, compute the output schedule by executing the following steps: (1) Let T j := r C max [(p i) j ]. (2) Find the smallest k such that W k (T j ) p j W k+1 (T j ). If such k does not exist, then output failed and stop. Otherwise find time t j [0, T j ] such that W k+1 (t j ) + W k (T j ) W k (t j ) = p j. (3) Schedule job j on V k+1 in time interval (0, t j ] and on V k in time interval (t j, T j ]. (4) Set v k (τ) := v k+1 (τ) for τ (t j, T j ], and v i (τ) := v i+1 (τ) for i = k + 1,..., m and τ (0, T j ]. Also set S k := S k S k+1 {j}, and S i := S i+1 for i = k + 1,..., m. We leave out the implementation details. We only note that job j can be preempted only at times T j for j < j or at times t j for j j, i.e., at most 2j 1 times. The total number of preemptions is at most n(m + 1), since at most m 1 jobs are preempted at each time T j and at most two jobs is preempted at each time t j. This also implies that the functions v i and W i are piecewise linear with at most 2n parts. Thus it is possible to represent and process them efficiently, including all the steps of the algorithm. The computation of r and T j is efficient as well. We also note that if we use any r r(s 1,..., s m ) in place of r in the algorithm, we obtain an r - competitive algorithm. Thus if for some sets of speeds we know a good upper bound on r(s 1,..., s m ), we may use it instead of solving the linear program exactly. Theorem 4.1 Algorithm RatioStretch is r = r(s 1,..., s m ) competitive for online preemptive scheduling on m uniformly related machines with speeds s 1 s 2 s m. Proof: If RatioStretch schedules a job, it is always completed at time T j r Cmax[(p i ) n ]. Thus to prove that the theorem holds, it is sufficient to guarantee that the algorithm does not fail to find machines V k and V k+1 for the incoming job j. This is equivalent to the statement that there is always enough space on V 1, i.e., that p j W 1 (T j ) in the iteration when j is to be scheduled. Since W m+1 0, 7

8 this is sufficient to guarantee that required k exists. Given the choice of k, it is always possible to find time t j as the expression W k+1 (t j ) + W k (T j ) W k (t j ) is continuous in t j ; for t j = 0 it is equal to W k (T j ) p j, and for t j = T j it is equal to W k+1 (T j ) p j. To avoid cases, we assume that the input sequence starts by m jobs with processing time 0. Adding these jobs does not affect any of the optimal makespans computed during the algorithm. In RatioStretch, they are assigned to V 1, but they are actually never running and thus also do not affect the schedule produced by RatioStretch. Let j 1, j 2,..., j m 1 denote the last m 1 jobs in S 1, ordered as they appear on input. Let I be the sequence of the remaining jobs in S 1, and let P be the total processing time of jobs in I. Finally, let j m = j be the incoming job. Consider any i = 1,..., m and any time τ (0, T ji ]. Using the fact that the times T j are nondecreasing in j and that the algorithm stretches each job j over the whole interval (0, T j ], there are at least m i jobs from S 1 running at τ, namely jobs j i, j i+1,..., j m 1. Including the idle machine, there are at least m + 1 i real machines belonging to V 1. Since V 1 is the first virtual machine and the real machines are adjacent, they must include the fastest real machines M 1,..., M m+1 i. It follows that the total work that can be processed on the real machines belonging to V 1 during the interval (0, T jm ] is at least s 1 T jm + s 2 T jm s m T j1. The total processing time of jobs in S i is P + p j1 + p j2 + + p jm 1. Thus to prove that j m can be scheduled on V 1 we need to verify that p jm s 1 T jm + s 2 T jm s m T j1 (P + p j1 + p j2 + + p jm 1 ). (5) Let ν 1, ν 2,..., ν m be the sequence of jobs j 1, j 2,... j m ordered so that the processing times p νi non-decreasing, i.e., p νi p νi+1 for i = 1,..., m 1. We claim that for each i = 1,..., m, are T ji = r C max[(p 1, p 2,..., p ji )] r C max[(i, p j1, p j2,..., p ji )] r C max[(i, p ν1, p ν2,..., p νi )] (6) The first equality is the definition of T ji. The next inequality follows since removing some jobs from the input sequence cannot increase C max. Finally, replacing the jobs p j 1, p j2,..., p ji by jobs p ν1, p ν2,..., p νi can be thought as replacing some of the jobs by smaller ones and then permuting them; this also cannot increase C max. The inequality (6) and the fact that p j1 + p j2 + + p jm = p ν1 + p ν2 + + p νm together imply that to prove (5), it is sufficient to prove P + p ν1 + p ν2 + + p νm r m s i Cmax [(I, p ν 1, p ν2,..., p νm i+1 )] (7) Let σ = m s ic max[(i, p ν1, p ν2,..., p νi )]. Let q 1 = (P + p ν1 )/σ, q i = p νi /σ, for i = 2, 3,..., m, and let O i = C max[(i, p ν1, p ν2,..., p νi )]/σ for i = 1,..., m. These values satisfy all constraints of the linear program, as follows by using inequalities (1) and (2) for instances (I, p ν1, p ν2,..., p νi ). Thus (P +p ν1 +p ν2 + +p νm )/σ = q 1 +q 2 + +q m r. This proves (7) and thus also (5) and correctness of the algorithm. Theorems 3.2 and 4.1 show that Algorithm RatioStretch is as good as any algorithm, even randomized. Together with e-competitive randomized algorithm from [5] we obtain the following: Corollary 4.2 Algorithm RatioStretch is e-competitive for online preemptive scheduling on uniformly related machines with arbitrary speeds, where e

9 5 Numerical lower bounds We have the optimal algorithm for arbitrary speeds, but we do not know the numerical value of its competitive ratio. The competitive ratio for m machines is equal to the solution of a quadratic program obtained from (4) by considering s i to be variables (in addition to q j and O k ). However, this quadratic program is not convex and we do not know how to solve it efficiently. We have obtained some lower bounds using mathematical software Maple. A lower bound is simply a feasible solution of (4). Once the values of s i are given, verification only involves solving a linear program. Once also the optimal values qj are given, it is trivial to compute values Ok and verify (4). Our numerical lower bounds are given in Appendix A. A file with the solutions for computer verification is available at We obtain lower bounds improving the bounds from [8] for m 8. For m 58 the bounds are above 2, and for m = 100 we obtain a speed combination with optimal competitive ratio above Thus we have: Theorem 5.1 For any online algorithm for preemptive scheduling on uniformly related machines, the competitive ratio is at least Special cases One approach to analyze the optimal competitive ratio is to give a symbolic solution to the linear program (4). A feasible primal solution gives a lower bound (which can be easily turned into an sequence of jobs, as we have seen before). A solution of a dual linear program gives an upper bound on the competitive ratio. A dual solution actually means that we form a positive linear combination of some of the linear constraints so that the resulting inequality bounds the objective function by the desired competitive ratio. Since there are only 2m variables, we know that for each sequence of speeds there is such a combination of only 2m of the Θ(m 2 ) constraints which yields the optimal bound. However, for different speed sequences we need to use different subsets of the constraints. We give two cases where we can provide analysis along these lines. First we generalize the case of nondecreasing speed ratios from [6]. We prove that the same formula is a general upper bound on the competitive ratio and that it is actually optimal for a slightly larger region of speed sequences. Then we give a complete analysis of the case m = 3. It turns out that it involves only two regions with different formulas for the optimal competitive ratio, one coming from the (extension of) the case of non-decreasing speed ratios, and one more new case. Our analysis of the case m = 3 also implies that the lower bound for m = 3 from [8] is tight. m We denote S = s i, α = 1 s 1 S = s s m. s 1 + s s m Theorem 6.1 Let R = ( m ) 1 s i S αi 1. Then r(s 1,..., s m ) R for any speeds s 1 s m and thus RatioStretch is R-competitive. Furthermore r(s 1,..., s m ) = R whenever s 1 ( 1 + α + + α i 1 ) s s i for all i = 2,..., m 1. (8) 9

10 Proof: The upper bound. As described in the outline above, we form a positive linear combination of some constraints of the linear program (4). Here we use the constraints corresponding to (2) with only one largest job and to (1). We add up q k s 1 O k for 2 k m, multiplied by x k = k s m k+i α i 2 (9) q q k SO k for 1 k m, multiplied by y k = s m k+1 s 1 S x k We need to show that y k 0 and to simplify the resulting inequality. For all k = 1,..., m we have ( x k + y k = s m k s ) k k+1 1 s m k+i α i 2 = s m k+i 1 α i 2, and thus (10) S y k = i=2 k+1 s m k+i 1 α i 2 x k i=2 i=2 i=2 k (s m k+i 1 s m k+i )α i 2 0. In addition, (10) implies that x k + y k = x k+1 for k < m, and x m + y m = m s iα i 1 = S/R. Using also the fact that y 1 = s m = x 2, the left-hand side of the linear combination given by (9) is equal to i=2 q 1 (y 1 + y 2 + y m ) + q 2 (x 2 + y y m ) + q 3 (x 3 + y y m ) + + q m (x m + y m ) = (q q m )S/R. The right-hand side of the linear combination given by (9) is equal to y 1 SO 1 + (x 2 s 1 + y 2 S)O (x m s 1 + y m S)O m = S(s 1 O m + + s m O 1 ) = S, using the definitions of x i and y i and the third constraint of (4). We conclude that any feasible solution of (4) satisfies the linear combination given by (9), which simplifies to (q q m )S/R S, and thus r(s 1,..., s m ) R for any speeds s i. The lower bound. Now we give a primal solution of (4) with the value of objective R, assuming (8). Naturally, for non-decreasing speed ratios this is just the lower bound from [6]. The solution is: O i = R αm i S q 1 = Rα m 1 for i = 1,..., m q i = s 1 O i = R s 1 S αm i for i = 2,..., m. We verify all the constraints of (4). Trivially q 1 0, q 2 0. From α 1 we get q i q i+1 for i = 2,..., m 1. For third constraint of (4) we have ( s1 s 1 O m + + s m O 1 = R S α0 + s 2 S α1 + + s m S αm 1) = 1 For the first constraint of (4), summing a geometric sequence and using the definition of α we have ( q q i = R α m 1 + s 1 ( α m α m i)) ( S = R α m 1 + s 1 S αm i α m 1 ) = R ( α m 1 + α m i α m 1) = SO i. 1 α 10

11 This also shows that the objective function is q q m = SO m = R. Finally, we check the second constraint of (4). We have q i + + q k = Rs 1 S (αm i + + α m k ) = O k s 1 (1 + α + + α k i ) O k (s s k i+1 ). The last inequality is trivial for k = i and follows from the assumption (8) for 2 i < k m. We remark that the upper bound in the previous theorem is not bounded by any constant in the region where the condition (8) does not hold. Epstein [6] in Claim 1 exactly proves that the condition (8) is satisfied by speed sequences nondecreasing speed ratios. Her notation is slightly different from ours, speeds are listed in reversed order and normalized so that the maximal speed is s m = 1; x in her notation is our 1/α. However, (8) is satisfied for a slightly wider range of speeds. One example is s 1 = 2, s 2 = s 3 = 1. For m = 3, the condition (8) has only one inequality s 1 α s 2 and this is equivalent to s 1 s 2 s 2 s Theorem 6.2 For m = 3 and any speeds s 1 s 2 s 3, ( s1 S + (1 s 1 S )s 2 S + (1 s 1 s ) S )2 3 1 if S r(s 1, s 2, s 3 ) = S 2 s s2 2 + s2 3 + s if 1s 2 + s 1 s 3 + s 2 s 3 s 1 s 2 s 2 s s 1 s 2 s 2 s The function r(s 1, s 2, s 3 ) has maximal value , and thus this is also the optimal competitive ratio for m = 3 over all speeds. Proof: The first case follows directly from Theorem 6.1 and the observation that the case condition is equivalent to (8). For the second case, let R = S 2 /(s s2 2 + s2 3 + s 1s 2 + s 1 s 3 + s 2 s 3 ). The upper bound. We again form a positive linear combination of some constraints of the linear program (4). We add up q 1 SO 1 multiplied by s 3 q 1 + q 2 SO 2 multiplied by s 2 q 1 + q 2 + q 3 SO 3 multiplied by (s 2 1 s 2s 3 )/S q 2 + q 3 (s 1 + s 2 )O 3 multiplied by s 3 q 3 s 1 O 3 multiplied by s 2. Note that s 2 1 s 2s 3 by the ordering of the speeds, so we have a non-negative linear combination. In the resulting inequality, the coefficients of all q i are equal to s 3 + s 2 + s2 1 s 2s 3 S = s 1s 3 + s 2 s 3 + s s 1s 2 + s s2 1 S = S R. The coefficient of O 3 equals s 2 1 s 2s 3 + (s 1 + s 2 )s 3 + s 1 s 2 = s 1 S. Thus the resulting inequality is (q 1 + q 2 + q 3 )S/R S(s 1 O 3 + s 2 O 2 + s 3 O 1 ) = S, using the third constraint of (4). We obtain r(s 1, s 2, s 3 ) R. The lower bound. We put q i = s 4 i R/S and O i = (s 4 i + + s 3 )R/S 2, for i = 1, 2, 3. We have q 1 +q 2 +q 3 = R which gives the desired value of the objective. We check that this is a feasible solution 11

12 of (4). For the inequality bounding q 2 we use the case condition s 1 /s 2 s 2 /s q q i = (s s 4 i )R/S = SO i, q 2 = (s 1 s 2 + s 2 (s 2 + s 3 ))R/S 2 (s 1 s 2 + s 1 s 3 )R/S 2 = s 1 O 2, q 3 = s 1 R/S = s 1 O 3, q 2 + q 3 = (s 1 + s 2 )R/S = (s 1 + s 2 )O 3, s 1 O 3 + s 2 O 2 + s 3 O 1 = (s 1 (s 1 + s 2 + s 3 ) + s 2 (s 2 + s 3 ) + s 2 3)R/S 2 = 1 q 2 = s 2 R/S s 1 R/S = q 3 The overall ratio. Given the explicit formula, it is straightforward but tedious to calculate the overall competitive ratio for m = 3. The case s 1 /s 2 s 2 /s is maximized by s 1 = 6, s 2 = s 3 = That gives worst case ratio R = The other case is maximized by s 1 = 2, s 2 = s 3 = 1, with R = References [1] S. Albers. On randomized online scheduling. In Proc. 34th Symp. Theory of Computing (STOC), pages ACM, [2] P. Berman, M. Charikar, and M. Karpinski. On-line load balancing for related machines. J. Algorithms, 35: , [3] B. Chen, A. van Vliet, and G. J. Woeginger. Lower bounds for randomized online scheduling. Inform. Process. Lett., 51: , [4] B. Chen, A. van Vliet, and G. J. Woeginger. An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett., 18: , [5] T. Ebenlendr and J. Sgall. Optimal and online preemptive scheduling on uniformly related machines. In Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS), volume 2996 of Lecture Notes in Comput. Sci., pages Springer, [6] L. Epstein. Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett., 29:93 98, [7] L. Epstein, J. Noga, S. S. Seiden, J. Sgall, and G. J. Woeginger. Randomized on-line scheduling for two related machines. J. Sched., 4:71 92, [8] L. Epstein and J. Sgall. A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett., 26(1):17 22, [9] R. Fleischer and M. Wahl. On-line scheduling revisited. J. Sched., 3: , [10] T. F. Gonzales and S. Sahni. Preemptive scheduling of uniform processor systems. J. ACM, 25:92 101, [11] R. Graham, E. Lawler, J. Lenstra, and A. R. Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math, 5: ,

13 [12] R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical J., 45: , [13] D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. ACM, 34: , [14] D. S. Hochbaum and D. B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput., 17, [15] E. Horwath, E. C. Lam, and R. Sethi. A level algorithm for preemptive scheduling. J. ACM, 24:32 43, [16] R. McNaughton. Scheduling with deadlines and loss functions. Management Sci., 6:1 12, [17] J. F. Rudin III. Improved Bound for the Online Scheduling Problem. PhD thesis, The University of Texas at Dallas, [18] J. Sgall. A lower bound for randomized on-line multiprocessor scheduling. Inform. Process. Lett., 63:51 55, [19] T. Tichý. Randomized on-line scheduling on 3 processors. Oper. Res. Lett., 32: , [20] J. Wen and D. Du. Preemptive on-line scheduling for two uniform processors. Oper. Res. Lett., 23: ,

14 A Numerical lower bounds In the table below we list the set of speeds s i and the sequence of values q j that witness a lower bound on competitive ratio of 2.054, using the linear program (4). The values O k can be computed directly from q j and s i. A file with the solutions for m = 3,..., 70 and m = 100 in a format suitable for computer verification is available at m = 100 q 19 = R = q 20 = q 21 = s 1 = q 22 = s 2 = q 23 = q 24 = q 25 = s 3 = q 26 = q 27 = s 4 = q 28 = q 29 = q 30 = s 5 = q 31 = q 32 = q 33 = q 34 = s 6 = q 35 = q 36 = q 37 = q 38 = s 7 = q 39 = q 40 = q 41 = s 8 = s 9 = q 42 = q 43 = s 10 = s 11 = q 44 = s 12 = q 45 = s 13 = q 46 = q 47 = s 14 = s 15 = s 16 = q 48 = = q 52 = s 17 = s 18 = s 19 = q 53 = q 54 = q 55 = q 56 = s 20 = q 57 = s 21 = s 22 = s 23 = s 24 = q 58 = s 25 = q 59 = q 60 = q 61 = q 62 = s 26 = q 63 = s 27 = = s 31 = q 64 = s 32 = q 65 = s 33 = q 66 = = q 70 = s 34 = s 35 = s 36 = s 37 = q 71 = s 38 = q 72 = s 39 = = s 47 = q 73 = s 48 = q 74 = q 75 = q 76 = q 77 = s 49 = q 78 = s 50 = = s 100 = q 79 = q 80 = q 81 = q 82 = q 1 = q 83 = q 84 = q 85 = q 2 = q 86 = q 3 = q 4 = q 87 = q 5 = q 88 = q 6 = q 7 = q 89 = q 90 = q 8 = q 91 = q 92 = q 9 = q 93 = q 10 = q 94 = q 11 = q 95 = q 12 = q 96 = q 13 = q 14 = q 97 = q 15 = q 98 = q 16 = q 99 = q 17 = q 100 = q 18 =

15 The following figures show some of sets of speeds with corresponding sets of jobs that witness our currently best lower bounds for each value of m. These solutions were found by Maple as local optima of the quadratic program. The red bold curve shows speeds s i, green dashed bold curve (bottom one) shows reversed scaled job variables, and the thin dashed blue curve (top one) shows inverses of the speed ratios, i.e., s i 1 /s i. The values of q j are printed in reverse order, i.e., column i shows q m i+1. The values are scaled so that q m = 1 = s 1. This ordering and scaling shows best the relations between job sizes and speeds. 1 m = 7, R = m = 8, R =

16 1 m = 9, R = m = 10, R = m = 20, R =

17 1 m = 30, R = m = 58, R = m = 100, R =

### bound of (1 + p 37)=6 1: Finally, we present a randomized non-preemptive 8 -competitive algorithm for m = 2 7 machines and prove that this is op

Semi-online scheduling with decreasing job sizes Steve Seiden Jir Sgall y Gerhard Woeginger z October 27, 1998 Abstract We investigate the problem of semi-online scheduling jobs on m identical parallel

### On-line Bin-Stretching. Yossi Azar y Oded Regev z. Abstract. We are given a sequence of items that can be packed into m unit size bins.

On-line Bin-Stretching Yossi Azar y Oded Regev z Abstract We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try

### On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm

On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm Christoph Ambühl and Monaldo Mastrolilli IDSIA Galleria 2, CH-6928 Manno, Switzerland October 22, 2004 Abstract We investigate

### Polynomial Time Algorithms for Minimum Energy Scheduling

Polynomial Time Algorithms for Minimum Energy Scheduling Philippe Baptiste 1, Marek Chrobak 2, and Christoph Dürr 1 1 CNRS, LIX UMR 7161, Ecole Polytechnique 91128 Palaiseau, France. Supported by CNRS/NSF

### Online Scheduling with Bounded Migration

Online Scheduling with Bounded Migration Peter Sanders Universität Karlsruhe (TH), Fakultät für Informatik, Postfach 6980, 76128 Karlsruhe, Germany email: sanders@ira.uka.de http://algo2.iti.uni-karlsruhe.de/sanders.php

### Combinatorial Algorithms for Minimizing the Weighted Sum of Completion Times on a Single Machine

Combinatorial Algorithms for Minimizing the Weighted Sum of Completion Times on a Single Machine James M. Davis 1, Rajiv Gandhi, and Vijay Kothari 1 Department of Computer Science, Rutgers University-Camden,

### Scheduling Parallel Jobs with Linear Speedup

Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl

### Colored Bin Packing: Online Algorithms and Lower Bounds

Noname manuscript No. (will be inserted by the editor) Colored Bin Packing: Online Algorithms and Lower Bounds Martin Böhm György Dósa Leah Epstein Jiří Sgall Pavel Veselý Received: date / Accepted: date

### First Fit bin packing: A tight analysis

First Fit bin packing: A tight analysis György Dósa 1 and Jiří Sgall 2 1 Department of Mathematics, University of Pannonia Veszprém, Hungary dosagy@almos.vein.hu 2 Computer Science Institute of Charles

### Online Scheduling of Jobs with Fixed Start Times on Related Machines

Algorithmica (2016) 74:156 176 DOI 10.1007/s00453-014-9940-2 Online Scheduling of Jobs with Fixed Start Times on Related Machines Leah Epstein Łukasz Jeż Jiří Sgall Rob van Stee Received: 10 June 2013

### Optimal on-line algorithms for single-machine scheduling

Optimal on-line algorithms for single-machine scheduling J.A. Hoogeveen A.P.A. Vestjens Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB, Eindhoven,

### Dispersing Points on Intervals

Dispersing Points on Intervals Shimin Li 1 and Haitao Wang 1 Department of Computer Science, Utah State University, Logan, UT 843, USA shiminli@aggiemail.usu.edu Department of Computer Science, Utah State

### Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive

Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive J.L. Hurink and J.J. Paulus University of Twente, P.O. box 217, 7500AE Enschede, The Netherlands Abstract We consider online scheduling

### Machine scheduling with resource dependent processing times

Mathematical Programming manuscript No. (will be inserted by the editor) Alexander Grigoriev Maxim Sviridenko Marc Uetz Machine scheduling with resource dependent processing times Received: date / Revised

### Approximation Algorithms for scheduling

Approximation Algorithms for scheduling Ahmed Abu Safia I.D.:119936343, McGill University, 2004 (COMP 760) Approximation Algorithms for scheduling Leslie A. Hall The first Chapter of the book entitled

### A new analysis of Best Fit bin packing

A new analysis of Best Fit bin packing Jiří Sgall Computer Science Institute of Charles University, Prague, Czech Republic. sgall@iuuk.mff.cuni.cz Abstract. We give a simple proof and a generalization

### Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays Aleksei V. Fishkin 1, Klaus Jansen 2, Sergey V. Sevastyanov 3,andRené Sitters 1 1 Max-Planck-Institute

### Santa Claus Schedules Jobs on Unrelated Machines

Santa Claus Schedules Jobs on Unrelated Machines Ola Svensson (osven@kth.se) Royal Institute of Technology - KTH Stockholm, Sweden March 22, 2011 arxiv:1011.1168v2 [cs.ds] 21 Mar 2011 Abstract One of the

### Single processor scheduling with time restrictions

Single processor scheduling with time restrictions Oliver Braun Fan Chung Ron Graham Abstract We consider the following scheduling problem 1. We are given a set S of jobs which are to be scheduled sequentially

### Single processor scheduling with time restrictions

J Sched manuscript No. (will be inserted by the editor) Single processor scheduling with time restrictions O. Braun F. Chung R. Graham Received: date / Accepted: date Abstract We consider the following

### Memorandum COSOR 97-23, 1997, Eindhoven University of Technology

Memorandum COSOR 97-3, 1997, Eindhoven University of Technology Approximation algorithms for the multiprocessor open shop scheduling problem Petra Schuurman y Gerhard J. Woeginger z Abstract We investigate

### Non-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund

Non-Preemptive and Limited Preemptive Scheduling LS 12, TU Dortmund 09 May 2017 (LS 12, TU Dortmund) 1 / 31 Outline Non-Preemptive Scheduling A General View Exact Schedulability Test Pessimistic Schedulability

### Minimizing Average Completion Time in the. Presence of Release Dates. September 4, Abstract

Minimizing Average Completion Time in the Presence of Release Dates Cynthia Phillips Cliord Stein y Joel Wein z September 4, 1996 Abstract A natural and basic problem in scheduling theory is to provide

### An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint

An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint J. Breit Department of Information and Technology Management, Saarland University, Saarbrcken, Germany

### Embedded Systems Development

Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs

### Approximation Schemes for Parallel Machine Scheduling Problems with Controllable Processing Times

Approximation Schemes for Parallel Machine Scheduling Problems with Controllable Processing Times Klaus Jansen 1 and Monaldo Mastrolilli 2 1 Institut für Informatik und Praktische Mathematik, Universität

### Single Machine Scheduling with Generalized Total Tardiness Objective Function

Single Machine Scheduling with Generalized Total Tardiness Objective Function Evgeny R. Gafarov a, Alexander A. Lazarev b Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya

### Deterministic Models: Preliminaries

Chapter 2 Deterministic Models: Preliminaries 2.1 Framework and Notation......................... 13 2.2 Examples... 20 2.3 Classes of Schedules... 21 2.4 Complexity Hierarchy... 25 Over the last fifty

### RUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES

RUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES Department for Embedded Systems/Real-Time Systems, University of Ulm {name.surname}@informatik.uni-ulm.de Abstract:

### Static priority scheduling

Static priority scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017 Some slides are derived from lectures

### P C max. NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines?

Multiple Machines Model Multiple Available resources people time slots queues networks of computers Now concerned with both allocation to a machine and ordering on that machine. P C max NP-complete from

### Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

Journal of Combinatorial Optimization 1, 413 426 (1998) c 1998 Kluwer Academic Publishers Manufactured in The Netherlands Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem CYNTHIA

### CIS 4930/6930: Principles of Cyber-Physical Systems

CIS 4930/6930: Principles of Cyber-Physical Systems Chapter 11 Scheduling Hao Zheng Department of Computer Science and Engineering University of South Florida H. Zheng (CSE USF) CIS 4930/6930: Principles

### A BEST-COMPROMISE BICRITERIA SCHEDULING ALGORITHM FOR PARALLEL TASKS

A BEST-COMPROMISE BICRITERIA SCHEDULING ALGORITHM FOR PARALLEL TASKS Pierre-François Dutot and Denis Trystram ID-IMAG - 51, avenue J. Kuntzmann 38330 Montbonnot St-Martin, France pfdutot@imag.fr Abstract

### Embedded Systems 14. Overview of embedded systems design

Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The

### Ideal preemptive schedules on two processors

Acta Informatica 39, 597 612 (2003) Digital Object Identifier (DOI) 10.1007/s00236-003-0119-6 c Springer-Verlag 2003 Ideal preemptive schedules on two processors E.G. Coffman, Jr. 1, J. Sethuraman 2,,

### Scheduling Online Algorithms. Tim Nieberg

Scheduling Online Algorithms Tim Nieberg General Introduction on-line scheduling can be seen as scheduling with incomplete information at certain points, decisions have to be made without knowing the complete

### Partition is reducible to P2 C max. c. P2 Pj = 1, prec Cmax is solvable in polynomial time. P Pj = 1, prec Cmax is NP-hard

I. Minimizing Cmax (Nonpreemptive) a. P2 C max is NP-hard. Partition is reducible to P2 C max b. P Pj = 1, intree Cmax P Pj = 1, outtree Cmax are both solvable in polynomial time. c. P2 Pj = 1, prec Cmax

### A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio Elisabeth Günther Olaf Maurer Nicole Megow Andreas Wiese Abstract We propose a new approach to competitive analysis in online

### The makespan problem of scheduling multi groups of jobs on multi processors at different speeds

Algorithmic Operations Research Vol.7 (2012) 41 50 The makespan problem of scheduling multi groups of jobs on multi processors at different speeds Wei Ding Department of Mathematics, Sun Yat-sen University,

### Scheduling problems in master-slave model

Ann Oper Res (2008) 159: 215 231 DOI 10.1007/s10479-007-0271-4 Scheduling problems in master-slave model Joseph Y.-T. Leung Hairong Zhao Published online: 1 December 2007 Springer Science+Business Media,

### A Framework for Scheduling with Online Availability

A Framework for Scheduling with Online Availability Florian Diedrich, and Ulrich M. Schwarz Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany {fdi,ums}@informatik.uni-kiel.de

### CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms

CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms Tim Roughgarden November 5, 2014 1 Preamble Previous lectures on smoothed analysis sought a better

### A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint

A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint Joachim Breit Department of Information and Technology Management, Saarland University,

### Clock-driven scheduling

Clock-driven scheduling Also known as static or off-line scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017

### Energy-efficient scheduling

Energy-efficient scheduling Guillaume Aupy 1, Anne Benoit 1,2, Paul Renaud-Goud 1 and Yves Robert 1,2,3 1. Ecole Normale Supérieure de Lyon, France 2. Institut Universitaire de France 3. University of

### CS 6820 Fall 2014 Lectures, October 3-20, 2014

Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given

### CS264: Beyond Worst-Case Analysis Lecture #18: Smoothed Complexity and Pseudopolynomial-Time Algorithms

CS264: Beyond Worst-Case Analysis Lecture #18: Smoothed Complexity and Pseudopolynomial-Time Algorithms Tim Roughgarden March 9, 2017 1 Preamble Our first lecture on smoothed analysis sought a better theoretical

### Single Machine Scheduling with Job-Dependent Machine Deterioration

Single Machine Scheduling with Job-Dependent Machine Deterioration Wenchang Luo 1, Yao Xu 2, Weitian Tong 3, and Guohui Lin 4 1 Faculty of Science, Ningbo University. Ningbo, Zhejiang 315211, China; and

### Aperiodic Task Scheduling

Aperiodic Task Scheduling Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2017 年 11 月 29 日 These slides use Microsoft clip arts. Microsoft copyright

### Designing Competitive Online Algorithms via a Primal-Dual Approach. Niv Buchbinder

Designing Competitive Online Algorithms via a Primal-Dual Approach Niv Buchbinder Designing Competitive Online Algorithms via a Primal-Dual Approach Research Thesis Submitted in Partial Fulfillment of

### Real-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3

Real-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3 Lecture Outline The rate monotonic algorithm (cont d) Maximum utilisation test The deadline monotonic algorithm The earliest

### CS261: Problem Set #3

CS261: Problem Set #3 Due by 11:59 PM on Tuesday, February 23, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions:

### An O(logm)-Competitive Algorithm for Online Machine Minimization

An O(logm)-Competitive Algorithm for Online Machine Minimization Downloaded 10/18/16 to 160.39.192.19. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php Abstract

### Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems

Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems Marek Chrobak 1, Christoph Dürr 2, Mathilde Hurand 2, and Julien Robert 3 1 Department of Computer Science, University of California,

### arxiv: v2 [cs.dm] 2 Mar 2017

Shared multi-processor scheduling arxiv:607.060v [cs.dm] Mar 07 Dariusz Dereniowski Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Gdańsk, Poland Abstract

### Analysis of Scheduling Algorithms with Reservations

Analysis of Scheduling Algorithms with Reservations Lionel Eyraud-Dubois 2, Grégory Mounié and Denis Trystram LIG, Grenoble Universités, 2 LIP, ÉNS Lyon, ENSIMAG-montbonnot, 5 avenue Kuntzmann 46 allée

### Real-Time Calculus. LS 12, TU Dortmund

Real-Time Calculus Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 09, Dec., 2014 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 35 Arbitrary Deadlines The worst-case response time of τ i by only considering

### showed that the SMAT algorithm generates shelf based schedules with an approximation factor of 8.53 [10]. Turek et al. [14] proved that a generalizati

Preemptive Weighted Completion Time Scheduling of Parallel Jobs? Uwe Schwiegelshohn Computer Engineering Institute, University Dortmund, 441 Dortmund, Germany, uwe@carla.e-technik.uni-dortmund.de Abstract.

### A CONSTANT-FACTOR APPROXIMATION FOR MULTI-COVERING WITH DISKS

A CONSTANT-FACTOR APPROXIMATION FOR MULTI-COVERING WITH DISKS Santanu Bhowmick, Kasturi Varadarajan, and Shi-Ke Xue Abstract. We consider the following multi-covering problem with disks. We are given two

### APTAS for Bin Packing

APTAS for Bin Packing Bin Packing has an asymptotic PTAS (APTAS) [de la Vega and Leuker, 1980] For every fixed ε > 0 algorithm outputs a solution of size (1+ε)OPT + 1 in time polynomial in n APTAS for

### Lecture #21. c T x Ax b. maximize subject to

COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the

### Using column generation to solve parallel machine scheduling problems with minmax objective functions

J Sched (2012) 15:801 810 DOI 10.1007/s10951-010-0191-z Using column generation to solve parallel machine scheduling problems with minmax objective functions J.M. van den Akker J.A. Hoogeveen J.W. van

### - Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs

LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs

### New Approximations for Broadcast Scheduling via Variants of α-point Rounding

New Approximations for Broadcast Scheduling via Variants of α-point Rounding Sungjin Im Maxim Sviridenko Abstract We revisit the pull-based broadcast scheduling model. In this model, there are n unit-sized

### P, NP, NP-Complete, and NPhard

P, NP, NP-Complete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NP-Complete and NP-Hard problems Algorithm time complicity Outline What is this course

### Fundamental Domains for Integer Programs with Symmetries

Fundamental Domains for Integer Programs with Symmetries Eric J. Friedman Cornell University, Ithaca, NY 14850, ejf27@cornell.edu, WWW home page: http://www.people.cornell.edu/pages/ejf27/ Abstract. We

### A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates

A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates Philippe Baptiste 1,2, Jacques Carlier 2 and Antoine Jouglet 2 Abstract In this paper, we present a

### A fast 5/2-approximation algorithm for hierarchical scheduling

A fast 5/2-approximation algorithm for hierarchical scheduling Marin Bougeret 1, Pierre-François Dutot 1, Klaus Jansen 2, Christina Otte 2, and Denis Trystram 1 1 Grenoble University 38330 Montbonnot Saint

### Common-Deadline Lazy Bureaucrat Scheduling Problems

Common-Deadline Lazy Bureaucrat Scheduling Problems Behdad Esfahbod, Mohammad Ghodsi, and Ali Sharifi Computer Engineering Department Sharif University of Technology, Tehran, Iran, {behdad,ghodsi}@sharif.edu,

### Module 5: CPU Scheduling

Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained

### Competitive Management of Non-Preemptive Queues with Multiple Values

Competitive Management of Non-Preemptive Queues with Multiple Values Nir Andelman and Yishay Mansour School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel Abstract. We consider the online problem

### Approximation Algorithms for Scheduling with Reservations

Approximation Algorithms for Scheduling with Reservations Florian Diedrich 1,,, Klaus Jansen 1,, Fanny Pascual 2, and Denis Trystram 2, 1 Institut für Informatik, Christian-Albrechts-Universität zu Kiel,

### Notes taken by Graham Taylor. January 22, 2005

CSC4 - Linear Programming and Combinatorial Optimization Lecture : Different forms of LP. The algebraic objects behind LP. Basic Feasible Solutions Notes taken by Graham Taylor January, 5 Summary: We first

### University of Twente. Faculty of Mathematical Sciences. Scheduling split-jobs on parallel machines. University for Technical and Social Sciences

Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences P.O. Box 217 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@math.utwente.nl

### The polynomial solvability of selected bicriteria scheduling problems on parallel machines with equal length jobs and release dates

The polynomial solvability of selected bicriteria scheduling problems on parallel machines with equal length jobs and release dates Hari Balasubramanian 1, John Fowler 2, and Ahmet Keha 2 1: Department

### A strongly polynomial algorithm for linear systems having a binary solution

A strongly polynomial algorithm for linear systems having a binary solution Sergei Chubanov Institute of Information Systems at the University of Siegen, Germany e-mail: sergei.chubanov@uni-siegen.de 7th

### Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems

Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems Jan Reineke Saarland University July 4, 2013 With thanks to Jian-Jia Chen! Jan Reineke July 4, 2013 1 / 58 Task Models and Scheduling

### Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 27 Flow Shop Scheduling - Heuristics - Palmer, Campbell Dudek

### Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling

Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling Chandra Chekuri Sungjin Im Benjamin Moseley June 11, 2009 Abstract We consider online algorithms for pull-based broadcast scheduling.

### arxiv: v1 [cs.ds] 17 Feb 2016

Scheduling MapReduce Jobs under Multi-Round Precedences D Fotakis 1, I Milis 2, O Papadigenopoulos 1, V Vassalos 2, and G Zois 2 arxiv:160205263v1 [csds] 17 Feb 2016 1 School of Electrical and Computer

### Marjan van den Akker. Han Hoogeveen Jules van Kempen

Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines, and/or generalized precedence constraints Marjan van den Akker Han Hoogeveen Jules van Kempen

### Single machine scheduling with forbidden start times

4OR manuscript No. (will be inserted by the editor) Single machine scheduling with forbidden start times Jean-Charles Billaut 1 and Francis Sourd 2 1 Laboratoire d Informatique Université François-Rabelais

### CMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017

CMSC CMSC : Lecture Greedy Algorithms for Scheduling Tuesday, Sep 9, 0 Reading: Sects.. and. of KT. (Not covered in DPV.) Interval Scheduling: We continue our discussion of greedy algorithms with a number

### Machine Scheduling with Deliveries to Multiple Customer Locations

This is the Pre-Published Version. Machine Scheduling with Deliveries to Multiple Customer Locations Chung-Lun Li George Vairaktarakis Chung-Yee Lee April 2003 Revised: November 2003 Abstract One important

### Online Learning, Mistake Bounds, Perceptron Algorithm

Online Learning, Mistake Bounds, Perceptron Algorithm 1 Online Learning So far the focus of the course has been on batch learning, where algorithms are presented with a sample of training data, from which

### An algorithm for the satisfiability problem of formulas in conjunctive normal form

Journal of Algorithms 54 (2005) 40 44 www.elsevier.com/locate/jalgor An algorithm for the satisfiability problem of formulas in conjunctive normal form Rainer Schuler Abt. Theoretische Informatik, Universität

### New Algorithms for Statistical Analysis of Interval Data

New Algorithms for Statistical Analysis of Interval Data Gang Xiang, Scott A. Starks, Vladik Kreinovich, and Luc Longpré NASA Pan-American Center for Earth and Environmental Studies PACES) University of

### OPTIMAL CONTROL OF A FLEXIBLE SERVER

Adv. Appl. Prob. 36, 139 170 (2004) Printed in Northern Ireland Applied Probability Trust 2004 OPTIMAL CONTROL OF A FLEXIBLE SERVER HYUN-SOO AHN, University of California, Berkeley IZAK DUENYAS, University

### Real-Time and Embedded Systems (M) Lecture 5

Priority-driven Scheduling of Periodic Tasks (1) Real-Time and Embedded Systems (M) Lecture 5 Lecture Outline Assumptions Fixed-priority algorithms Rate monotonic Deadline monotonic Dynamic-priority algorithms

### On the Sensitivity of Cyclically-Invariant Boolean Functions

On the Sensitivity of Cyclically-Invariant Boolean Functions Sourav Charaborty University of Chicago sourav@csuchicagoedu Abstract In this paper we construct a cyclically invariant Boolean function whose

### Scheduling on a single machine under time-of-use electricity tariffs

Scheduling on a single machine under time-of-use electricity tariffs Kan Fang Nelson A. Uhan Fu Zhao John W. Sutherland Original version: April 2014 This version: June 2015 Abstract We consider the problem

### Real-Time and Embedded Systems (M) Lecture 5

Priority-driven Scheduling of Periodic Tasks (1) Real-Time and Embedded Systems (M) Lecture 5 Lecture Outline Assumptions Fixed-priority algorithms Rate monotonic Deadline monotonic Dynamic-priority algorithms

### Optimal Allocation for Chunked-Reward Advertising

Optimal Allocation for Chunked-Reward Advertising Weihao Kong, Jian Li, Tie-Yan Liu, and Tao Qin Microsoft Research Asia Tsinghua University Abstract. Chunked-reward advertising is commonly used in the

### AS computer hardware technology advances, both

1 Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources Chunhui Guo, Student Member, IEEE, Xiayu Hua, Student Member, IEEE, Hao Wu, Student Member, IEEE, Douglas Lautner,

### Optimal Online Algorithms for Multidimensional Packing Problems

Optimal Online Algorithms for Multidimensional Packing Problems Leah Epstein Rob van Stee Abstract We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing

### On (1, ε)-restricted Assignment Makespan Minimization

On (1, ε)-restricted Assignment Makespan Minimization Deeparnab Chakrabarty Sanjeev Khanna Shi Li Abstract Makespan minimization on unrelated machines is a classic problem in approximation algorithms.

### A Lazy Bureaucrat Scheduling Game

A Lazy Bureaucrat Scheduling Game Ling Gai Tianjin University Department of Mathematics No. 92 Weijin Road, Nankai District, Tianjin China gailing@tju.edu.cn Yuanchun Song Tianjin University Department