Single processor scheduling with time restrictions

Size: px
Start display at page:

Download "Single processor scheduling with time restrictions"

Transcription

1 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 on a single processor. Each job has an associated processing time which is required for its processing. Given a particular permutation of the jobs in S, the jobs are processed in that order with each job started as soon as possible, subject only to the following constraint: For a fixed integer B, no unit time interval [x, x + 1) is allowed to intersect more than B jobs for any real x. In this paper we carry out a worst-case analysis for this situation. In particular, we show that any permutation of the jobs can be processed essentially within a factor of 1/B 1) of the optimum when B and this bound is best possible. For the case B =, the situation is rather different, and in this case the corresponding factor we establish is 4/, which is also best possible. We also show that the general problem of deciding whether there is a permutation whose schedule has no idle time is NP-hard which is typical of many scheduling problems). It is interesting that these worst-case bounds are similar to some earlier bounds that occur in the multiprocessor scheduling literature [7, 8]. 1 Introduction. We are initially given a set S = {S 1, S,..., S n } of jobs and an integer B. Each job S i has associated with it a length s i 0. The jobs are all processed sequentially on a single processor. A job S i will be processed during a semiopen) time interval [α, α + s i ) for some α 0. A job S i with s i = 0 is called a zero-job. Each zero-job is therefore processed at some particular point in time. Furthermore, it is allowed for several zero-jobs to be processed at the same point in time, provided the constraint 1) below is not violated. Quantitative Methods for Business and Management, University of Applied Sciences Trier, Environmental Campus Birkenfeld, P. O. Box 18, D Birkenfeld, braun@fh-trier.de, DFG grant BR 7/7-1 University of California, San Diego. Research supported in part by grants ONR MURI N , and FA University of California, San Diego. Research supported in part by NSF first suggested to us by Bill Bradley. 1

2 Given some permutation π of S, say πs) = T = T 1, T,..., T n ) with corresponding job lengths t 1, t,..., t n ), the jobs are placed sequentially on the real line as follows. The initial job T 1 in the list T begins at time 0 and finishes at time t 1. In general, T i+1 begins as soon as T i is completed, provided the following B-constraint is always observed. The constraint that differentiates our problem from many similar ones in the literature e.g., see [9]) is this: For every real x 0, the unit interval [x, x + 1) can intersect at most B jobs. 1) Thus, if it happens that some job T i finishes at time t and j=1 t i+j 1, then the job T i+b cannot start until time t + 1 since it if started strictly before this time, then for a suitable δ > 0, the interval [t δ, t + 1 δ) would intersect more than B jobs). The preceding procedure results in a unique placement or schedule) of the jobs on the real line. We define the finishing time τt ) to be the time at which the last job T n is finished. A natural goal might be for a given job set S, to find those permutations T = πs) which minimize the finishing time τt ). Since this will be shown in Section 4) to be an NP-hard problem in general, our main focus will be on a worst-case analysis of the problem. That is, how much worse can an arbitrary schedule be compared to an optimal schedule for a given set S of jobs. Let us denote by τ w S) the largest possible finishing time for any permutation of S, and let τ o S) denote the optimal i.e., the shortest possible) finishing time for any permutation of S. We are interested in seeing how much worse τ w S) can be compared to τ o S). In what follows, we will prove the following worst-case bounds: Theorem 1 For B = and any set S, τ w S) 4 τ os) 1. ) The factor 4 is best possible. Theorem For B and any set S, τ w S) 1 ) τ o S). ) B 1 The factor 1 is best possible. It is interesting that for this problem, there is a significant difference between the cases B = and B. This often happens in algorithmic problems, for example, such as deciding whether the chromatic number of a graph is which is easy), or if it which is NP-hard).

3 Although this simple scheduling model has applicability to a number of application areas such as, crew scheduling [1], flexible manufacturing systems [10], printed circuit board assembly [], and cardinality constrained scheduling [, 4], for example, this is the first time that a worst-case analysis of it has been carried out e.g., see [9]). The case B =. We first make some preliminary remarks that will apply in the remainder of the paper. We are interested in upper-bounding the expression where B S) = {τ w S) c B τ o S)} c B = { 4 if B =, 1 if B, and S = {S 1, S,..., S n } is some arbitrary set of jobs. Thus, we can assume that all the lengths s i of the S i satisfy s i 1 for all i, since if any S i had s i = 1 + ɛ > 1, then by decreasing s i to 1, we decrease both τ w S) and τ 0 S) by ɛ, thereby increasing B S). We should also keep in mind that in a schedule, it is possible that a job S i finishes at some time t, and then j zero-jobs are processed at this time t for some j B which takes time 0), and then another job S k immediately begins its processing at time t. Our goal in this section will be to prove ). Given a set of jobs S, let T = T 1, T,..., T n ) be a permutation of S which maximizes S). In the schedule for T, let st i ) and ft i ) denote the starting times and finishing times, respectively, of T i so that ft i ) st i ) = t i = T i ). In particular, because of the constraint 1), we must have st ) ft 1 ) = 1. Thus, we can replace T by a zero job T ) at time ft 1 ) without affecting the overall finishing time τt ) = τ w S) of the schedule for T. Of course, T ) may already have been a zero job). Such a replacement could only decrease τ o S), and so could only increase S). Now, we can apply the same argument to T 4 if there is a job T 5 ). In other words, because of 1), st 5 ) ft )) = 1, and consequently, replacing T 4 by a zero job T 4 at time ft ) does not change τt ), and is still a valid schedule i.e., there is no conflict with T )). Repeating this process, we end up with a modified) schedule in which all the even labelled jobs are zero jobs, except possibly at the very end at which we might have two consecutive non-zero jobs. In particular, there are n 1 unit distances between the odd labelled jobs in the schedule for T. Thus, we can assume that our starting set S has at least n 1 zero jobs. In particular, we

4 have τ w S) = τt ) = n n 1 s i +. 4) Now let us examine the schedule for the optimal permutation for S, which we will assume by relabeling if necessary) to be S 1, S,..., S n ). Since B =, then by 1) we have: and also Consequently, τ o S) = s s s k , 5) τ o S) = s 1 + s s s k ) τ o S) = s 1 + s n + n s i + n ), 7) which implies τ o S) 1 n ) s i + n ). 8) Thus, S) = τ w S) 4 τ os) However, n n 1 s i + = 1 n ) n 1 s i + n n 1 s i n 4 n )) 1 s i + n ) n ). 9) since S has at least n 1 zero jobs, and all the other jobs have length at most 1. Substituting this inequality into 9), we get S) 1 n 1 n 1 n ) + n ) = 1 n 1 n) ) n 1 n) + 4 = 1. 4

5 This proves ). To see that this bound is best possible, consider the set S consisting of t + 1 jobs S i of length 1 and t zero jobs Z j, for some positive integer t. The optimal) permutation Z 1, S 1, S,..., S t+1, Z, Z,... Z t ) has a finishing time of τ o S) = t. On the other hand, the worst) permutation S 1, Z 1, S, Z,..., S t, Z t, S t+1 ) has a finishing time of τ w S) = 4t + 1. Thus, achieving equality in ). τ w S) 4 τ os) = 4t t = 1, The case B. Our next goal will be to establish ). As before, we will assume that the permutation S 1, S...., S n ) is the optimal permutation for the set of jobs S = {S 1, S,..., S n }, so that this permutation has finishing time τs) = τ o S). We now want to create an auxiliary job set T = {T 1, T,..., T n } as follows. The size of t i = T i will be defined by: t i = { 1 if s i 1 s i if s i > 1,. Observe, that for any permutation T of T, τt ) = τt ) = n t i τ w S). 10) We next examine the schedule for S. Let us replace each job S i which has s i 1 by a zero job S i placed on the time axis at the starting time of S i. This certainly causes no violations of the B-constraint 1). We will now assign 1 a weight of size to each zero job in this modified job set S. Thus, the schedule for S consists of the original large jobs S i of size s i > 1 and a 1 number of point masses of weight, all placed so that condition 1) still holds, i.e., no unit interval intersects more than B of these jobs. The sum of all the weights of the jobs in S is just equal to the sum of all the lengths of the jobs in T, which by 10) is an upper bound on τ w S). Also, all of the jobs in S fit in the interval [0, τs)). So we have reduced our problem to that of finding an upper bound W on the total weight of an arbitrary assignment of semi-open) intervals of length s i > 1 and point masses of weight 1 so that condition 1) is satisfied and, of course, so that positive length intervals are disjoint, and point masses can only intersect a positive interval at its starting point, in other words, so 5

6 that this distribution could be a schedule generated by our process if we allowed delays before jobs had to be started). In particular, we can conclude that τ w S) τt ) W. Let us now define the blocks U i = [i, i+1) for 0 i N 1, where N = τs). Also, for each U i we define its B 1 subblocks U i,j = [i + j 1, i + j ) for 1 j B 1. We want to study how the weight from the jobs in S is distributed in the U i. Define the content cu i ) to be the sum of all the weight or mass ) in U i. In other words, we add up all the contributions of the point masses in U i together with all the portions of those S k that happen to lie within U i. We will use the abbreviation θ := 1 since this quantity will occur so frequently in what follows. Our next task will be to analyze various possibilities for the U i. Let us say that the interval U i is bad if cu i ) > θ. Otherwise, we will say that U i is good. First, suppose that U i contains B zero jobs, each contributing θ to cu i ). Then U i cannot intersect any other jobs in S and we have cu i ) = B θ θ when B, so that U i is good in this case. Next, suppose that U i contains j zero jobs for some j with 0 j B. Then and, again, U i is good. cu i ) j θ + 1 B ) θ + 1 θ Hence, any bad U i must contain exactly B 1 zero-jobs. In addition, it must also intersect exactly one other job in S in an interval I i called its S-interval) with weight = length) greater than 1 θ, in order that its total mass i.e., content) is greater than θ. The plan is now to show that if we add up the contents of all of the U i, the sum will be at most θ)τs) + Bθ. We will do this by keeping a running total of the total mass accumulated as we proceed from the beginning block U 0 and move to U 1, U, etc., until we reach the final block U N 1. We would like to show that the average mass in the blocks is at most θ plus a small increment). While any good block has mass = content) at most θ, every now and then we may have a bad block, which could have content as much as. Our goal is to show that having too many bad blocks will always force there to be a compensating number of very good blocks, i.e., blocks have content a lot less than θ, and this will keep the accumulated average mass total close to θ. First, observe that for any bad U i, since its S-interval I i has length exceeding 1 θ, then it must intersect all of the B 1 subblocks U i,j of U i. Hence, each of the B 1 zero jobs in U i must lie in either the first or last subblocks, i.e., 6

7 in U i,1 U i,. Let us say that a block U i has rank r if it intersects exactly r jobs of S in its last subblock U i,. We will denote this by writing ρu i ) = r. Let us now examine the relationship between two consecutive blocks U i and U i+1 which have ρu i ) = s and ρu i+1 ) = t, respectively, where we assume that s > t. Since ρu i ) = s then because of condition 1), the number of jobs which can intersect any of the first B subblocks of U i+1 is at most B s. However, since ρu i+1 ) = t, then it is not hard to see that the content cu i+1 ) of U i+1 satisfies cu i+1 ) B s 1)θ + t 1)θ + 1 = θ s t)θ. 11) This can be seen by considering the possible contributions C of the nonzero jobs to the content of U i+1. If C = 0, then cu i+1 ) B s+t)θ θ s t)θ for B. On the other hand, if 0 < C 1 θ, then cu i+1 ) 1 θ + B s 1)θ + tθ. Finally, if C > 1 θ, then the last subblock of U i+1 can contain at most t 1 zero jobs, so that cu i+1 ) 1 + B s 1)θ + t 1)θ, as claimed.) In other words, if the ranks of two consecutive blocks drop by s t > 0, then the second block has content at least s t)θ below the target value θ. On the other hand, if s < t, then the content of U i+1 might well be which is θ above the desired average value of θ). Let us examine the situation for a bad block U i, i > 0, with rank s so, in particular, s > 0). Thus, there are s 1 point masses in the last subblock of U i since its S-interval I i intersects all the subblocks of U i ). Consequently, the first subblock of U i must have B s point masses in it since U i is bad), and so, intersects B s + 1 jobs of S. This means that the preceding block U i 1 can have rank at most s 1. We now consider the sequence of ranks ρu i ), i = 0, 1,,.... We will also consider the corresponding loss or gain with respect to our average value θ we make as we encounter each new block. As we have seen, if the rank in going from one block to the next one decreases by m then the content of the second block is at least mθ below the value θ. On the other hand, it it increases, then the content of the second block might only be as much as θ above the value θ. If the rank doesn t change, then we can t conclude that the content of the second block is deficient, i.e., below θ. However, suppose that we have a sequence of blocks U j, U j+1,..., U k, where the only bad blocks in the sequence are the first and last blocks, and both blocks have the same rank s. Then by the preceding remark, the block U k 1 preceding U k has rank at most s 1. Hence, in the sequence of ranks ρu j ), ρu j+1 ),..., ρu k ), there will be a pair of consecutive blocks for which the rank drops by at least 1. Putting all these facts together, we can conclude that the total gain over the average value θ as we sum up the cumulative content of the complete sequence of blocks is at most Bθ. That is, the total weight N 1 i=0 cu i) of the blocks of 7

8 S satisfies τ w S) τt ) = n t i = N 1 i=0 cu i ) N θ) + Bθ τ o S) θ) + Bθ < τ o S) + 1) θ) + Bθ τ o S) 1 ) +. B 1 This proves Theorem. To see that the constant factor 1 is best possible, we consider the job set S consisting of B 1)t jobs of length 1 and B 1)B )t zero jobs for an arbitrary positive integer t. It is then not hard to see that the optimal permutation for S is a job of size 1 followed by B zero jobs which is repeated for B 1)t times. We denote this by 1 0 B 1 0 B B = [1 0 B ] )t which has a finishing time τ o S) = )t. On the other hand, the permutation t = [1 0 ] B )t 1 t has finishing time B )t + t = B )t τ w S). Hence, τ w S) τ o S) 1 ) B )t B 1)t 1 ) = 0. B 1 B 1 This shows that the constant in ) is not too far from the truth. The above example can be tweaked by adding B 1 zero jobs) to get the difference to be 1, but we know that it cannot be as large as. 4 NP-hardness of the general problem In this section we will show that the determining whether there is a schedule for S which has no gaps i.e., so that τs) is equal to the sum of all the job times) is an NP-hard problem, when the bound B is a variable parameter of the problem. We will consider the following list S = S 1, S,..., S B 4, E 1, E, E, E 4 ) where s i = S i = 10 a i for some positive integer a i, and all E i = 1. Furthermore, we assume that the sum of the t largest s i s is less than the sum of the t + 1 smallest s i s for all t < B, and that B 4 s i = T. Finally, we will require that no interval of length T be allowed to intersect more than B jobs. This is a scaled-up version of the previous problem in which no unit interval was allowed to intersect more than B jobs. 8

9 Let us say that a schedule for S is perfect if τs) = T + 4. In this case, there are no gaps in the schedule. Theorem. A perfect schedule for S exists if and only if there is a partition of S into two parts, each of size B, and each having a sum equal to T. Proof. First, suppose S has a perfect schedule, where the S i have been relabelled so that the order of the jobs in this schedule from left to right is S 1, S, S,..., S B 4, with the four E j s intermixed within these jobs but with increasing indices from left to right). As usual, we will think of the S i and E i as represented by half-open intervals [ ) of lengths s i and 1, respectively. We assume that the first = left-most) job which might be S 1 or E 1 ) starts at time 0. Let T 1 = s 1 + s s B and let T = s + s B s B 4. Suppose T 1 T. Without loss of generality, we can assume that T 1 < T. Thus, we have T 1 T 0. 1) This implies that at most one of the E j s are to the left of S since otherwise, there would be an interval of length T intersecting more than B jobs. Thus, by our choice labelling the E j s, we must have E, E and E 4 all occurring to the right of S. Now, since T = B 4 1 s i then Hence, T smallest B s i > largest B s i T B 4 B B 4 B s i s i + 10 since T and all the s i are multiples of 10. Consequently, the interval I = [c T, c) where c is the finishing time of the last job in the schedule which is either S B 4 or E 4 ) must hit S and therefore also E, E and E 4. However, this means that I hits more than B jobs, which is impossible. Thus, if the schedule is perfect then we must have T 1 = T. On the other hand, if there is a partition so that T 1 = T then we can construct the valid schedule E 1, E, S 1, S,..., S B 4, E, E 4. Finally, if we have an arbitrary input set of positive integers {m 1, m,..., m r } then setting M = r 1 m i and m i = m i + M for all i, then we see that any partition of the m i into two equal subset sums must have r summands in each sum. Hence, from the well-known NP-hardness of the problem of partitioning 9

10 the m i into two equal subset sums see [6]), it follows that our restricted problem requiring the two subsets to have the same cardinality is also NP-hard. 5 Concluding remarks. One would suspect that there are polynomial-time algorithms with which one can improve the bounds in the theorems. However, we have not looked this problem yet. There are also a number of variations and generalizations which might be interesting to investigate. For example, what if you have more than one processor, and/or more than one type of constraint. An example would be jobs in which not only no unit interval can intersect more than B jobs, but also no set of jobs that together use more than a certain amount of some resource such as power) can be processed at the same time in the multi-processor case). It would also be interesting to know if our problem remains NP-hard if B is fixed. References [1] C. Barnhart, E. Johnson, G. Nemhauser and P. Vance, Crew scheduling, in Hall R., ed., Handbook of Transportation Science, Kluwer, 49-51, 1999). [] J. Blazewicz, W. Cellary, R. Slowinski and J. Weglarz, Scheduling under Resource Constraints: Deterministic Models, J.C. Baltzer, Basel, 1987) [] Y. Crama, J. van der Klundert and F. C. R. Spieksma, Production planning problems in printed circuit board assembly, Discrete Applied Mathematics, 1, 9 61, 00) [4] M. Dell Amico and S. Martello, Bounds for the cardinality constrained P Cmax problem, Journal of Scheduling, 4, 1 18, 001) [5] T. Dereli and A. Baykasoglu, Concurrent engineering utilities for controlling interactions in process planning Journal of Intelligent Manufacturing, 15, , 004) [6] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979) [7] R. L. Graham, Bounds on Certain Multiprocessing Anomalies, Bell Sys. Tech Jour. 45, 1966), [8] R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Jour. Appl. Math. 17, 1969), [9] Joseph Y.-T Leung, ed. Handbook of Scheduling, Chapman and Hall, 004) 10

11 [10] K. E. Stecke, Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems, Management Science, 9, 7 88, 198) 11

Single processor scheduling with time restrictions

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

More information

Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions

Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions OR Spectrm 06 38:53 540 DOI 0.007/s009-06-043-5 REGULAR ARTICLE Worst-case analysis of the LPT algorithm for single processor schedling with time restrictions Oliver ran Fan Chng Ron Graham Received: Janary

More information

Polynomial Time Algorithms for Minimum Energy Scheduling

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

More information

Minimizing Mean Flowtime and Makespan on Master-Slave Systems

Minimizing Mean Flowtime and Makespan on Master-Slave Systems Minimizing Mean Flowtime and Makespan on Master-Slave Systems Joseph Y-T. Leung,1 and Hairong Zhao 2 Department of Computer Science New Jersey Institute of Technology Newark, NJ 07102, USA Abstract The

More information

M 2 M 3. Robot M (O)

M 2 M 3. Robot M (O) R O M A TRE DIA Universita degli Studi di Roma Tre Dipartimento di Informatica e Automazione Via della Vasca Navale, 79 { 00146 Roma, Italy Part Sequencing in Three Machine No-Wait Robotic Cells Alessandro

More information

Scheduling Parallel Jobs with Linear Speedup

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

More information

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Keqin Li Department of Computer Science State University of New York New Paltz, New

More information

Decomposition of random graphs into complete bipartite graphs

Decomposition of random graphs into complete bipartite graphs Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg) of edge-disjoint

More information

Complexity analysis of job-shop scheduling with deteriorating jobs

Complexity analysis of job-shop scheduling with deteriorating jobs Discrete Applied Mathematics 117 (2002) 195 209 Complexity analysis of job-shop scheduling with deteriorating jobs Gur Mosheiov School of Business Administration and Department of Statistics, The Hebrew

More information

EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS

EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS #A5 INTEGERS 5 (205) EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS Steve Butler Department of Mathematics, Iowa State University, Ames, Iowa butler@iastate.edu Paul Erdős

More information

SPT is Optimally Competitive for Uniprocessor Flow

SPT is Optimally Competitive for Uniprocessor Flow SPT is Optimally Competitive for Uniprocessor Flow David P. Bunde Abstract We show that the Shortest Processing Time (SPT) algorithm is ( + 1)/2-competitive for nonpreemptive uniprocessor total flow time

More information

Machine Minimization for Scheduling Jobs with Interval Constraints

Machine Minimization for Scheduling Jobs with Interval Constraints Machine Minimization for Scheduling Jobs with Interval Constraints Julia Chuzhoy Sudipto Guha Sanjeev Khanna Joseph (Seffi) Naor Abstract The problem of scheduling jobs with interval constraints is a well-studied

More information

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

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

More information

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

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

More information

Decomposition of random graphs into complete bipartite graphs

Decomposition of random graphs into complete bipartite graphs Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg of edge-disjoint

More information

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. 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

More information

On the discrepancy of circular sequences of reals

On the discrepancy of circular sequences of reals On the discrepancy of circular sequences of reals Fan Chung Ron Graham Abstract In this paper we study a refined measure of the discrepancy of sequences of real numbers in [0, ] on a circle C of circumference.

More information

Optimal on-line algorithms for single-machine scheduling

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,

More information

The Complexity of Maximum. Matroid-Greedoid Intersection and. Weighted Greedoid Maximization

The Complexity of Maximum. Matroid-Greedoid Intersection and. Weighted Greedoid Maximization Department of Computer Science Series of Publications C Report C-2004-2 The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization Taneli Mielikäinen Esko Ukkonen University

More information

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 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,

More information

Preemptive Online Scheduling: Optimal Algorithms for All Speeds

Preemptive Online Scheduling: Optimal Algorithms for All Speeds 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

More information

The Tool Switching Problem Revisited

The Tool Switching Problem Revisited The Tool Switching Problem Revisited Yves Crama HEC Management School, University of Liège, Boulevard du Rectorat, 7 (B31), B-4000 Liège, Belgium, Y.Crama@ulg.ac.be Linda S. Moonen (corresponding author),

More information

Single Machine Scheduling with a Non-renewable Financial Resource

Single Machine Scheduling with a Non-renewable Financial Resource Single Machine Scheduling with a Non-renewable Financial Resource Evgeny R. Gafarov a, Alexander A. Lazarev b Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya st. 65, 117997

More information

Improved Bounds for Flow Shop Scheduling

Improved Bounds for Flow Shop Scheduling Improved Bounds for Flow Shop Scheduling Monaldo Mastrolilli and Ola Svensson IDSIA - Switzerland. {monaldo,ola}@idsia.ch Abstract. We resolve an open question raised by Feige & Scheideler by showing that

More information

Oblivious and Adaptive Strategies for the Majority and Plurality Problems

Oblivious and Adaptive Strategies for the Majority and Plurality Problems Oblivious and Adaptive Strategies for the Majority and Plurality Problems Fan Chung 1, Ron Graham 1, Jia Mao 1, and Andrew Yao 2 1 Department of Computer Science and Engineering, University of California,

More information

This means that we can assume each list ) is

This means that we can assume each list ) is This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible

More information

Lecture 2: Scheduling on Parallel Machines

Lecture 2: Scheduling on Parallel Machines Lecture 2: Scheduling on Parallel Machines Loris Marchal October 17, 2012 Parallel environment alpha in Graham s notation): P parallel identical Q uniform machines: each machine has a given speed speed

More information

Multiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund

Multiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund Multiprocessor Scheduling I: Partitioned Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 22/23, June, 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 47 Outline Introduction to Multiprocessor

More information

Polynomially solvable and NP-hard special cases for scheduling with heads and tails

Polynomially solvable and NP-hard special cases for scheduling with heads and tails Polynomially solvable and NP-hard special cases for scheduling with heads and tails Elisa Chinos, Nodari Vakhania Centro de Investigación en Ciencias, UAEMor, Mexico Abstract We consider a basic single-machine

More information

Decomposition Method for Project Scheduling with Spatial Resources

Decomposition Method for Project Scheduling with Spatial Resources Decomposition Method for Project Scheduling with Spatial Resources J.L. Hurink, A.L. Kok and J.J. Paulus University of Twente, PO box 217, 7500AE Enschede, The Netherlands, j.j.paulus@ewi.utwente.nl Project

More information

Basic Scheduling Problems with Raw Material Constraints

Basic Scheduling Problems with Raw Material Constraints Basic Scheduling Problems with Raw Material Constraints Alexander Grigoriev, 1 Martijn Holthuijsen, 2 Joris van de Klundert 2 1 Faculty of Economics and Business Administration, University of Maastricht,

More information

ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS

ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS Richard A. Dutton and Weizhen Mao Department of Computer Science The College of William and Mary P.O. Box 795 Williamsburg, VA 2317-795, USA email: {radutt,wm}@cs.wm.edu

More information

Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems

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

More information

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 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

More information

Throughput Optimization in Single and Dual-Gripper Robotic Cells

Throughput Optimization in Single and Dual-Gripper Robotic Cells Throughput Optimization in Single and Dual-Gripper Robotic Cells U.V. Manoj; manojuv@tamu.edu College of Engineering, Texas A&M University, College Station, TX Chelliah Sriskandarajah Mays Business School,

More information

Approximation Schemes for Scheduling on Parallel Machines

Approximation Schemes for Scheduling on Parallel Machines Approximation Schemes for Scheduling on Parallel Machines Noga Alon Yossi Azar Gerhard J. Woeginger Tal Yadid Abstract We discuss scheduling problems with m identical machines and n jobs where each job

More information

A lower bound on deterministic online algorithms for scheduling on related machines without preemption

A lower bound on deterministic online algorithms for scheduling on related machines without preemption Theory of Computing Systems manuscript No. (will be inserted by the editor) A lower bound on deterministic online algorithms for scheduling on related machines without preemption Tomáš Ebenlendr Jiří Sgall

More information

An Algorithm to Determine the Clique Number of a Split Graph. In this paper, we propose an algorithm to determine the clique number of a split graph.

An Algorithm to Determine the Clique Number of a Split Graph. In this paper, we propose an algorithm to determine the clique number of a split graph. An Algorithm to Determine the Clique Number of a Split Graph O.Kettani email :o_ket1@yahoo.fr Abstract In this paper, we propose an algorithm to determine the clique number of a split graph. Introduction

More information

Complexity and Algorithms for Two-Stage Flexible Flowshop Scheduling with Availability Constraints

Complexity and Algorithms for Two-Stage Flexible Flowshop Scheduling with Availability Constraints Complexity and Algorithms or Two-Stage Flexible Flowshop Scheduling with Availability Constraints Jinxing Xie, Xijun Wang Department o Mathematical Sciences, Tsinghua University, Beijing 100084, China

More information

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 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

More information

Single machine scheduling with forbidden start times

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

More information

On Machine Dependency in Shop Scheduling

On Machine Dependency in Shop Scheduling On Machine Dependency in Shop Scheduling Evgeny Shchepin Nodari Vakhania Abstract One of the main restrictions in scheduling problems are the machine (resource) restrictions: each machine can perform at

More information

(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).

(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ). CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,

More information

NP-Completeness. f(n) \ n n sec sec sec. n sec 24.3 sec 5.2 mins. 2 n sec 17.9 mins 35.

NP-Completeness. f(n) \ n n sec sec sec. n sec 24.3 sec 5.2 mins. 2 n sec 17.9 mins 35. NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and

More information

Computers and Intractability. The Bandersnatch problem. The Bandersnatch problem. The Bandersnatch problem. A Guide to the Theory of NP-Completeness

Computers and Intractability. The Bandersnatch problem. The Bandersnatch problem. The Bandersnatch problem. A Guide to the Theory of NP-Completeness Computers and Intractability A Guide to the Theory of NP-Completeness The Bible of complexity theory Background: Find a good method for determining whether or not any given set of specifications for a

More information

Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling Hanna Furmańczyk, Marek Kubale Abstract In the paper we consider the problems of equitable and semi-equitable

More information

Computers and Intractability

Computers and Intractability Computers and Intractability A Guide to the Theory of NP-Completeness The Bible of complexity theory M. R. Garey and D. S. Johnson W. H. Freeman and Company, 1979 The Bandersnatch problem Background: Find

More information

The three-dimensional matching problem in Kalmanson matrices

The three-dimensional matching problem in Kalmanson matrices DOI 10.1007/s10878-011-9426-y The three-dimensional matching problem in Kalmanson matrices Sergey Polyakovskiy Frits C.R. Spieksma Gerhard J. Woeginger The Author(s) 2011. This article is published with

More information

Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines arxiv: v1 [cs.

Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines arxiv: v1 [cs. Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines arxiv:1602.01867v1 [cs.ds] 4 Feb 2016 Hanna Furmańczyk, Marek Kubale Abstract In the paper we consider the

More information

The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles

The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles Snežana Mitrović-Minić Ramesh Krishnamurti School of Computing Science, Simon Fraser University, Burnaby,

More information

Topics in Approximation Algorithms Solution for Homework 3

Topics in Approximation Algorithms Solution for Homework 3 Topics in Approximation Algorithms Solution for Homework 3 Problem 1 We show that any solution {U t } can be modified to satisfy U τ L τ as follows. Suppose U τ L τ, so there is a vertex v U τ but v L

More information

Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J.

Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J. Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J. Published: 01/01/007 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue

More information

1.1 P, NP, and NP-complete

1.1 P, NP, and NP-complete CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction

More information

TAYLOR POLYNOMIALS DARYL DEFORD

TAYLOR POLYNOMIALS DARYL DEFORD TAYLOR POLYNOMIALS DARYL DEFORD 1. Introduction We have seen in class that Taylor polynomials provide us with a valuable tool for approximating many different types of functions. However, in order to really

More information

The tool switching problem revisited

The tool switching problem revisited European Journal of Operational Research 182 (2007) 952 957 Short Communication The tool switching problem revisited Yves Crama a, Linda S. Moonen b, *, Frits C.R. Spieksma b, Ellen Talloen c a HEC Management

More information

ECS122A Handout on NP-Completeness March 12, 2018

ECS122A Handout on NP-Completeness March 12, 2018 ECS122A Handout on NP-Completeness March 12, 2018 Contents: I. Introduction II. P and NP III. NP-complete IV. How to prove a problem is NP-complete V. How to solve a NP-complete problem: approximate algorithms

More information

The effect of machine availability on the worst-case performance of LPT

The effect of machine availability on the worst-case performance of LPT Discrete Applied Mathematics 148 (2005) 49 61 www.elsevier.com/locate/dam The effect of machine availability on the worst-case performance of LPT Hark-Chin Hwang a, Kangbok Lee b, Soo Y. Chang b a Department

More information

An analysis of the LPT algorithm for the max min and the min ratio partition problems

An analysis of the LPT algorithm for the max min and the min ratio partition problems Theoretical Computer Science 349 (2005) 407 419 www.elsevier.com/locate/tcs An analysis of the LPT algorithm for the max min and the min ratio partition problems Bang Ye Wu Department of Computer Science

More information

Greedy Algorithms. Kleinberg and Tardos, Chapter 4

Greedy Algorithms. Kleinberg and Tardos, Chapter 4 Greedy Algorithms Kleinberg and Tardos, Chapter 4 1 Selecting breakpoints Road trip from Fort Collins to Durango on a given route. Fuel capacity = C. Goal: makes as few refueling stops as possible. Greedy

More information

Minimum Moment Steiner Trees

Minimum Moment Steiner Trees Minimum Moment Steiner Trees Wangqi Qiu Weiping Shi Abstract For a rectilinear Steiner tree T with a root, define its k-th moment M k (T ) = (d T (u)) k du, T where the integration is over all edges of

More information

Complexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler

Complexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard

More information

Outline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.

Outline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181. Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität

More information

Upper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139

Upper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139 Upper and Lower Bounds on the Number of Faults a System Can Withstand Without Repairs Michel Goemans y Nancy Lynch z Isaac Saias x Laboratory for Computer Science Massachusetts Institute of Technology

More information

CS/COE

CS/COE CS/COE 1501 www.cs.pitt.edu/~nlf4/cs1501/ P vs NP But first, something completely different... Some computational problems are unsolvable No algorithm can be written that will always produce the correct

More information

Algorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling.

Algorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling. Algorithm Design Scheduling Algorithms Part 2 Parallel machines. Open-shop Scheduling. Job-shop Scheduling. 1 Parallel Machines n jobs need to be scheduled on m machines, M 1,M 2,,M m. Each machine can

More information

On-line Scheduling of Two Parallel Machines. with a Single Server

On-line Scheduling of Two Parallel Machines. with a Single Server On-line Scheduling of Two Parallel Machines with a Single Server Lele Zhang, Andrew Wirth Department of Mechanical and Manufacturing Engineering, The University of Melbourne, VIC 3010, Australia Abstract

More information

Complexity analysis of the discrete sequential search problem with group activities

Complexity analysis of the discrete sequential search problem with group activities Complexity analysis of the discrete sequential search problem with group activities Coolen K, Talla Nobibon F, Leus R. KBI_1313 Complexity analysis of the discrete sequential search problem with group

More information

Online Interval Coloring and Variants

Online Interval Coloring and Variants Online Interval Coloring and Variants Leah Epstein 1, and Meital Levy 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il School of Computer Science, Tel-Aviv

More information

Maximizing Data Locality in Distributed Systems

Maximizing Data Locality in Distributed Systems Maximizing Data Locality in Distributed Systems Fan Chung a, Ronald Graham a, Ranjita Bhagwan b,, Stefan Savage a, Geoffrey M. Voelker a a Department of Computer Science and Engineering University of California,

More information

ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY. Nimrod Megiddoy

ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY. Nimrod Megiddoy ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY Nimrod Megiddoy Abstract. The generalized set packing problem (GSP ) is as follows. Given a family F of subsets of M = f mg

More information

On bilevel machine scheduling problems

On bilevel machine scheduling problems Noname manuscript No. (will be inserted by the editor) On bilevel machine scheduling problems Tamás Kis András Kovács Abstract Bilevel scheduling problems constitute a hardly studied area of scheduling

More information

Disjoint paths in unions of tournaments

Disjoint paths in unions of tournaments Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton

More information

Machine scheduling with resource dependent processing times

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

More information

Matchings in hypergraphs of large minimum degree

Matchings in hypergraphs of large minimum degree Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains

More information

NP-Completeness. NP-Completeness 1

NP-Completeness. NP-Completeness 1 NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and

More information

1 Ordinary Load Balancing

1 Ordinary Load Balancing Comp 260: Advanced Algorithms Prof. Lenore Cowen Tufts University, Spring 208 Scribe: Emily Davis Lecture 8: Scheduling Ordinary Load Balancing Suppose we have a set of jobs each with their own finite

More information

Scheduling problem subject to compatibility constraints

Scheduling problem subject to compatibility constraints Scheduling problem subject to compatibility constraints Mohamed Bendraouche 1 and Mourad Boudhar 2 1 Faculty of Sciences, Saad Dahleb University, Route de Soumaa, BP 270, Blida, Algeria mbendraouche@yahoo.fr

More information

Algorithms. NP -Complete Problems. Dong Kyue Kim Hanyang University

Algorithms. NP -Complete Problems. Dong Kyue Kim Hanyang University Algorithms NP -Complete Problems Dong Kyue Kim Hanyang University dqkim@hanyang.ac.kr The Class P Definition 13.2 Polynomially bounded An algorithm is said to be polynomially bounded if its worst-case

More information

IBM Almaden Research Center, 650 Harry Road, School of Mathematical Sciences, Tel Aviv University, TelAviv, Israel

IBM Almaden Research Center, 650 Harry Road, School of Mathematical Sciences, Tel Aviv University, TelAviv, Israel On the Complexity of Some Geometric Problems in Unbounded Dimension NIMROD MEGIDDO IBM Almaden Research Center, 650 Harry Road, San Jose, California 95120-6099, and School of Mathematical Sciences, Tel

More information

The Maximum Flow Problem with Disjunctive Constraints

The Maximum Flow Problem with Disjunctive Constraints The Maximum Flow Problem with Disjunctive Constraints Ulrich Pferschy Joachim Schauer Abstract We study the maximum flow problem subject to binary disjunctive constraints in a directed graph: A negative

More information

Math 105A HW 1 Solutions

Math 105A HW 1 Solutions Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S

More information

A NOTE ON THE PRECEDENCE-CONSTRAINED CLASS SEQUENCING PROBLEM

A NOTE ON THE PRECEDENCE-CONSTRAINED CLASS SEQUENCING PROBLEM A NOTE ON THE PRECEDENCE-CONSTRAINED CLASS SEQUENCING PROBLEM JOSÉ R. CORREA, SAMUEL FIORINI, AND NICOLÁS E. STIER-MOSES School of Business, Universidad Adolfo Ibáñez, Santiago, Chile; correa@uai.cl Department

More information

Algorithms: COMP3121/3821/9101/9801

Algorithms: COMP3121/3821/9101/9801 NEW SOUTH WALES Algorithms: COMP3121/3821/9101/9801 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales TOPIC 4: THE GREEDY METHOD COMP3121/3821/9101/9801 1 / 23 The

More information

Integer Equal Flows. 1 Introduction. Carol A. Meyers Andreas S. Schulz

Integer Equal Flows. 1 Introduction. Carol A. Meyers Andreas S. Schulz Integer Equal Flows Carol A Meyers Andreas S Schulz Abstract We examine an NP-hard generalization of the network flow problem known as the integer equal flow problem The setup is the same as a standard

More information

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 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,

More information

Feasibility of Periodic Scan Schedules

Feasibility of Periodic Scan Schedules Feasibility of Periodic Scan Schedules Ants PI Meeting, Seattle, May 2000 Bruno Dutertre System Design Laboratory SRI International e-mail: bruno@sdl.sri.com 1 Scan Scheduling Scan scheduling: Given n

More information

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0 8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n

More information

Task Models and Scheduling

Task Models and Scheduling Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling

More information

arxiv: v2 [cs.dm] 2 Mar 2017

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

More information

Embedded Systems 14. Overview of embedded systems design

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

More information

Approximation schemes for parallel machine scheduling with non-renewable resources

Approximation schemes for parallel machine scheduling with non-renewable resources Approximation schemes for parallel machine scheduling with non-renewable resources Péter Györgyi a,b, Tamás Kis b, a Department of Operations Research, Loránd Eötvös University, H1117 Budapest, Pázmány

More information

Scheduling Linear Deteriorating Jobs with an Availability Constraint on a Single Machine 1

Scheduling Linear Deteriorating Jobs with an Availability Constraint on a Single Machine 1 Scheduling Linear Deteriorating Jobs with an Availability Constraint on a Single Machine 1 Min Ji a, b, 2 Yong He b, 3 T.C.E. Cheng c, 4 a College of Computer Science & Information Engineering, Zhejiang

More information

HMMT February 2018 February 10, 2018

HMMT February 2018 February 10, 2018 HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18

More information

Scheduling with safety distances*

Scheduling with safety distances* Annals of Operations Research 57(1995)251-264 251 Scheduling with safety distances* Frits C.R. Spieksma Department of Mathematics, University of Limburg, P.O. Box 616, 6200 MD Maastricht, The Netherlands

More information

Bounds on the Traveling Salesman Problem

Bounds on the Traveling Salesman Problem Bounds on the Traveling Salesman Problem Sean Zachary Roberson Texas A&M University MATH 613, Graph Theory A common routing problem is as follows: given a collection of stops (for example, towns, stations,

More information

Computational complexity theory

Computational complexity theory Computational complexity theory Introduction to computational complexity theory Complexity (computability) theory deals with two aspects: Algorithm s complexity. Problem s complexity. References S. Cook,

More information

Supplementary Material

Supplementary Material Supplementary Material A Proof of Lemmas Proof of Lemma 4. Let t = min{ t 1 + + t l, τ} [0, τ], then it suffices to show that p t 1 + + p t l pt. Note that we have t 1 + + t l t 1 + + t l t. Moreover,

More information

Monotone Submodular Maximization over a Matroid

Monotone Submodular Maximization over a Matroid Monotone Submodular Maximization over a Matroid Yuval Filmus January 31, 2013 Abstract In this talk, we survey some recent results on monotone submodular maximization over a matroid. The survey does not

More information

Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point

Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon

More information