The Resource-Constrained Project Scheduling Problem

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Chapter 1 The Resource-Constrained Project Scheduling Problem 1.1. A combinatorial optimization problem Informally, a resource-constrained project scheduling problem (RCPSP) considers resources of limited availability and activities of known durations and resource requests, linked by precedence relations. The problem consists of finding a schedule of minimal duration by assigning a start time to each activity such that the precedence relations and the resource availabilities are respected. More formally, the RCPSP can be defined as a combinatorial optimization problem. A combinatorial optimization problem is defined by a solution space X, which is discrete or which can be reduced to a discrete set, and by a subset of feasible solutions Y Xassociated with an objective function f : Y R. A combinatorial optimization problem aims at finding a feasible solution y Ysuch that f(y) is minimized or maximized. A resource-constrained project scheduling problem is a combinatorial optimization problem defined by a tuple (V,p,E,R,B,b). Activities constituting the project are identified by a set V = {A 0,...,A n+1 }. Activity A 0 represents by convention the start of the schedule and activity A n+1 symmetrically represents the end of the schedule. The set of non-dummy activities is identified by A = {A 1,...,A n }. Durations are represented by a vector p in N n+2 where p i is the duration of activity A i, with special values p 0 = p n+1 =0. Chapter written by Christian ARTIGUES. 21

2 22 Resource-Constrained Project Scheduling Precedence relations are given by E, a set of pairs such that (A i,a j ) E means that activity A i precedes activity A j. A precedence activity-on-node graph G(V,E) is defined where nodes correspond to activities and arcs correspond to precedence relations 1. We assume that G contains no cycle, otherwise the precedence relations are obviously inconsistent. Since precedence is a transitive binary relation, the existence of a path in G from node A i to node A j also means that activity A i precedes activity A j. Thus, all precedence graphs having the same transitive closure define the same precedence constraints. We assume that, taking account of the preceding remark, E is such that A 0 is a predecessor of all other activities and A n+1 is a successor of all other activities. Renewable resources are formalized by set R = {R 1,...,R q }. Availabilities of resources are represented by a vector B in N q such that B k denotes the availability of R k. In particular, a resource R k such that R k =1is called a unary or disjunctive resource. Otherwise, as a resource may process several activities at a time, it is called a cumulative resource. Demands of activities for resources are abstracted by b,a(n+2) q integer matrix, such that b ik represents the amount of resource R k used per time period during the execution of A i. A schedule is a point S in R n+2 such that S i represents the start time of activity A i. C i denotes the completion time of activity A i, with C i = S i +p i. S 0 is a reference point for the start of the project. Here we assume that S 0 =0. A solution S is feasible if it is compatible with the precedence constraints (1.1) and the resource constraints (1.2) expressed below, where A t = {A i A S i t<s i + p i } represents the set of non-dummy activities in process at time t. S j S i p i (A i,a j ) E (1.1) b ik B k R k R, t 0 (1.2) A i A t The makespan of a schedule S is equal to S n+1, the start time of the end activity. The above-defined set A t and constraints state that an activity cannot be interrupted once it is started. This is referred to as not allowing preemption 2. The RCPSP can then be stated as follows: 1. We will identify in the rest of the chapter each activity with the corresponding node of the precedence graph. 2. The preemptive case is presented in Chapter 8.

3 The Resource-Constrained Project Scheduling Problem 23 DEFINITION 1.1. The RCPSP is the problem of finding a non-preemptive schedule S of minimal makespan S n+1 subject to precedence constraints (1.1) and resource constraints (1.2). An important preliminary remark is that, since durations are integers, we can restrict ourselves to integer schedules without missing the optimal solution. A noninteger feasible schedule can be transformed into an integer feasible schedule without increasing the makespan by recursively applying the following principle. Consider a non-integer schedule S and let A i denote the first activity in the increasing start time order such that S i N. Then setting S i to its nearest lower integer S i does not violate any precedence constraints, since the completion time of the predecessors of A i are integers strictly lower than S i. Left shifting an activity can violate a resource constraint only if it enters new sets A t for S i t<s i. Since we have A t A Si \{i} for S i t<s i, no resource-constraint violation can appear by setting S i to S i. The set of integer schedules, containing at least one optimal solution, is said to be dominant A simple resource-constrained project example In Table 1.1, a RCPSP instance is given with n =10real activities and R =2 resources with availabilities B 1 =7and B 2 =4. A i A 0 A 1 A 2 A 3 A 4 A 7 A 8 A 10 A 11 p i b i b i Table 1.1. A project with 10 real activities and 2 resources The precedence constraints linking the activities A i V are displayed in Figure 1.1 as an activity-on-node graph. A schedule of minimal makespan Sn+1 =12is displayed in Figure 1.2 as a 2-dimensional Gantt chart where the x axis represents the time and the y axis represents the resource occupation Computational complexity According to the computational complexity theory [GAR 79], the RCPSP is one of the most intractable combinatorial optimization problems. Indeed, the RCPSP belongs to the class of problems that are NP-hard in the strong sense. The complexity theory states that an optimization problem is NP-hard (in the strong sense) if its decision version is NP-complete (in the strong sense). Let us define the decision variant of the RCPSP. Let H denote an arbitrarily large integer.

4 24 Resource-Constrained Project Scheduling A 1 A 2 A 10 A 0 A 11 A 3 A 7 A 4 A 8 Figure 1.1. Precedence activity-on-node graph R 1 A 3 A 4 A 7 A 8 A 2 A 1 A 10 R 2 A 8 A 3 A 1 A Figure 1.2. Schedule of minimal makespan

5 The Resource-Constrained Project Scheduling Problem 25 DEFINITION 1.2. The decision variant of the RCPSP is the problem of determining whether a schedule S of makespan S n+1 not greater than H subject to precedence constraints (1.1) and resource constraints (1.2) exists or not. Roughly, a decision problem is in NP if we can verify in polynomial time if a tentative solution is feasible. Let S denote a schedule. Precedence feasibility can be trivially checked in O( E ) and the makespan constraint in O(1). Verifying the resourcefeasibility in polynomial time is not a trivial task. Algorithm 1 verifies the feasibility according to resource-constraints in O(n 2 R ). The algorithm is based on the observation that each change over time of the activity total resource requirements occurs only at time S 0 =0or at the completion time of an activity. List L being a sorted list of the different activity completion times, the algorithm computes each set F of activities in process at each time t L, and tests whether the total resource requirements of each set F exceeds the resource availabilities. Note that directly verifying that the resource availability is respected by computing set A t for each time period t [0,H[ yields a pseudo-polynomial algorithm, which depends on value H. Algorithm 1 Resource feasibility checking of a tentative schedule S 1: L = {C j A j V } 2: sort L in increasing values 3: for t Ldo 4: for R k Rdo 5: o 0, F 6: for A j Ado 7: if S j <t, C j t and b jk > 0 then 8: o o + b jk, F F A j 9: end if 10: if o>b k then 11: S is not resource-feasible because activities of F are executed in parallel 12: return false 13: end if 14: end for 15: end for 16: end for 17: return true Garey and Johnson [GAR 75] have shown that the decision variant of the RCPSP with a single resource and no precedence constraints, called the resource-constrained scheduling problem, is NP-complete in the strong sense by reduction from the 3-partition problem. NP-hardness can be shown by a simpler observation made by Blazewicz et al. [BLA 83] yielding even worse negative results. Let us consider the

6 26 Resource-Constrained Project Scheduling famous graph coloring problem. Let G(V, E) be an undirected graph and let c be an arbitrary integer. Deciding if there is a feasible coloring of the nodes in G with c colors such that two adjacent nodes do not share the same color is NP-complete in the strong sense and appears to be a particular case of the decision variant of a RCPSP with unit durations, no precedence constraints, a disjunctive resource per arc in E and an activity per node in V with a unit requirement on each resource of its incident arcs. The coloring problem is feasible if and only if the RCPSP has a makespan not greater than c. Figure 1.3 illustrates the 3 colored solution as a RCPSP of makespan 3. Switching to optimization, the minimal number of colors needed, corresponding to the minimal makespan, is called the chromatic number of the graph. 1 b 3 d a c e 2 R a R b R c R d A 1 A 2 A 1 A 3 A 3 A 2 A 4 A 3 4 R e A 4 A 2 Figure 1.3. A schedule of minimal makespan equal to the chromatic number of the displayed graph G(V, E) When dealing with problems that are NP-hard in the strong sense, an important question is the existence of a polynomial-time approximation scheme. Uetz [UET 01] noticed that by a direct extension of non-approximability results obtained by Feige and Kilian [FEI 98] on graph coloring, it is very unlikely 3 that the minimal makespan can be approximated in polynomial time with a factor of n 1 ɛ for any constant ɛ> Dominant and non-dominant schedule subsets Let us consider the possibly empty set S H of feasible schedules of a decision variant of the RCPSP. If we ignore the precedence constraints and considering that integer solutions are dominant, the possible values for each start time S i can be restricted to interval [0,H p i [ yielding possibly Π Ai A[0,H p i [ schedules. Fortunately, in spite of the computational complexity of the problem stated in the previous section, it is possible to avoid the complete enumeration of this possibly 3. We refer to [UET 01, FEI 98] for the precise conditions.

7 The Resource-Constrained Project Scheduling Problem 27 huge search space to find a feasible solution. It is possible to define subsets of schedules significantly smaller than S H that always contain a feasible solution if it exists, i.e. dominant subsets. These sets of schedules are the sets of semi-active and active schedules, based on the concepts of local and global left shifts, respectively. Let us consider a schedule S and an activity A i. The global left shift operator LS(S, A i, ) transforms schedule S into an identical schedule S, except for S i = S i with > 0. A left shift is local when, in addition, all schedules obtained by LS(S, A i,ρ) with 0 <ρ are also feasible. We define the set of semi-active and active schedules as follows. DEFINITION 1.3. A schedule is semi-active if it admits no feasible activity local left shift. From this definition, an integer schedule is semi-active if and only if for each activity A i A, there is no feasible activity left shift of 1 time unit. DEFINITION 1.4. A schedule is active if it admits no feasible activity global left shift. From this definition, an integer schedule is active if and only if for each activity A i A, there is no feasible left shift of N time units. Note that the schedule displayed in Figure 1.2 is both semi-active and active. and the active schedule set Sa H are dom- Ssa H S H. These sets are also dominant for the search of a solution of S minimizing a regular objective function f : R n+2 R. A function f is regular if for all S, S R n+2 such that S S (where is meant componentwise), we have f(s) f(s ). In particular, the makespan criterion considered in the standard RCPSP corresponds to a regular objective function. Any solution of S H can obviously be transformed into a semi-active schedule by applying a series of local left shifts. Any semi-active schedule can in turn be transformed into an active schedule by performing a series of global left shifts. It follows that the semi-active schedule set SH sa inant subsets of S H. More precisely we have SH a For practical reasons it can be relevant to consider non-dominant subsets of schedules, i.e. that may exclude the optimal solution. The non-delay scheduling concept is linked to the requirement that no resource is left idle while it could process an activity. Although it may appear intuitively as efficient, this scheduling policy may lead only to sub-optimal solutions. The set of non-delay schedules can be defined by considering partial left shifts. A partial left shift consists of allowing preemption for the left-shifted activity. An activity is preemptive if it can be interrupted at any (not necessarily integer) time-point (see Chapter 8). Thus, a partial left shift PLS(S, A i,, Γ) of an originally non-interrupted activity consists of a left shift of > 0 time units of the first Γ > 0 units of the activity.

8 28 Resource-Constrained Project Scheduling DEFINITION 1.5. A schedule is non-delay if it admits no feasible activity partial left shift. For an integer schedule S, whenever a resource is left idle while it could start processing an activity, it is possible to globally left shift the first unit of this activity into the idle period. From the above definition, the set SH nd of semi-active schedules of makespan not greater than H verifies SH nd Sa H. The schedule displayed in Figure 1.2 is also a non-delay schedule. Introduced for the job-shop problem by Baker [BAK 74], similar definitions of semi-active, active and non-delay schedule sets for the RCPSP can be found in [SPR 95, NEU 00a] Order-based representation of schedules and related dominant schedule sets From the dominance property of the semi-active schedule set, we may derive a relevant representation of schedules. Let S be a feasible schedule. For any activity A j,ifs j > 0 and if there is no other activity A i such that S i + p i = S j, then activity A j can be left shifted and the schedule is not semi-active. Hence, in any semi-active schedule S and for any activity A j such that S j > 0, there is an activity A i such that S j = S i +p i. It follows that it is intuitively relevant to represent a left-shifted schedule by additional precedence constraints. Bartusch et al. [BAR 88] propose to consider the decomposition of set S of feasible solutions into finitely many subsets, each one including schedules satisfying the precedence constraints induced by a different strict order. Formally, let P denote a strict order 4 on the set of activities A and let S(P )= {S S j S i p i (A i,a j ) E P } denote the set of (not necessarily feasible) schedules that verify the precedence constraints given by E and the ones given by P. S(P ) is a polyhedron and so is S( ) which is the set of time-feasible schedules. By definition, a strict order P is time-feasible if S(P ) and is (resource- and time-) feasible if, in addition, S(P ) S. A result established by Bartusch et al. [BAR 88] states that the set of schedules S is the union of the polyhedra S(P ) for all inclusionminimal feasible strict orders P on the set of activities A. In the case of the search for a feasible solution in S H, or the minimization of a regular objective function in S, the minimal element of S(P ) dominates the other elements of this set. This is the point ES(P ) (earliest-start schedule) of S(P ) such that S S(P ), ES(P ) S. By definition, ES(P ) i is equal to the length of the longest path from A 0 to A i in graph G(V,E P ), each arc (A i,a j ) E P being valuated by p i. It follows that S(P ) if and only if G(V,E P ) is acyclic. The RCPSP can be defined as the search for a feasible strict order P on A such that ES(P ) is of minimal makespan. Note that P is said to be feasible not only if ES(P ) 4. A strict order is an irreflexive and transitive binary relation.

9 The Resource-Constrained Project Scheduling Problem 29 is feasible, but if and only if all schedules in S(P ) are feasible. We will see how this type of feasibility can be checked in the next section to specify the strict order-based RCPSP formulation. To illustrate these concepts, let us consider schedule S displayed in Figure 1.2 and strict orders P 1 = {(A 2,A 1 ), (A 3,A 1 ), (A 3, ), (,A 7 ), (A 3,A 7 ), (,A 7 ), (,A 8 )}, P 2 = P 1 {(A 3,A 8 ), (,A 8 )} and P 3 = P 2 \{,A 8 }. Note that we have S = ES(P 1 )=ES(P 2 )=ES(P 3 ). P 1 and P 2 are both feasible strict orders since any schedule in S(P 1 ) or S(P 2 ) is feasible. However, P 3 is not a feasible strict order although ES(P 3 ) is feasible. Indeed, consider schedule S = S, except that S 9 and S 7 are both right shifted by 1 time unit. S is in S(P 3 ) but is not resource-feasible since R 2 is oversubscribed at time C 9. As stated above, it is not trivial to check the feasibility of a strict order, which corresponds here to see that S(P 1 ) Sand S(P 2 ) S. This is linked to the forbidden set concept described in section 1.6. However, this example shows that the above-defined feasibility condition of a strict order is not a necessary condition for obtaining a feasible schedule. We can also remark that the important arcs of a feasible strict order are the ones belonging to its transitive reduction. Let us consider P 1 = P 1 \ (A 3,A 7 ), the transitive reduction of P 1.WehaveS(P 1 )=S(P 1). Furthermore, P 1 is an inclusion-minimal feasible strict order: if we remove any arc belonging to the transitive reduction of P 1 (i.e. all arcs except (A 3,A 7 )), ES(P 1 ) becomes unfeasible. P 2 is not an inclusion-minimal feasible strict order since we have P 2 P 1. This shows that several strict orders may lead to the same earliest-start schedule. Another important remark is that despite the fact that the semi-active concept is intuitively related to the strict order concept, each earliest-start schedule with respect to a given strict order does not necessarily correspond to a semi-active schedule in the sense of Definition 1.3 as noted by Sprecher et al. [SPR 95]. For instance, let us define strict order P 4 = P 1 {(A 10,A 8 )}. The earliest start schedule ES(P 4 ) is identical to the one displayed in Figure 1.2 except that the start time of activity 8 is delayed up to the completion time of activity A 10. Since a local left shift of activity A 8 is made feasible, schedule ES(P 4 ) is not semi-active. For that reason, Neumann et al. [NEU 00a] propose additional schedule sets related to the strict order representation: the quasi-active and the pseudo-active schedule sets. These sets are based on the order-preserving and order-monotonic left shifts, respectively. These left shifts are defined by reference to the interval order P (S) induced by a schedule S where P (S) ={(A i,a j ) V 2 S j S i + p i }. By definition, P (S) is the inclusion maximal strict order P such that S S(P ). Since P (S) is inclusion maximal, each antichain in graph G(V,E P (S)) represents a set of activities simultaneously in process.

10 30 Resource-Constrained Project Scheduling An order-preserving left shift of an activity on S yields a feasible schedule S such that P (S) P (S ). An order-monotonic left shift of an activity on S yields a feasible schedule S such that P (S) P (S ) or P (S ) P (S). From this definition it follows that in an order-monotonic left shift from schedule S, either all chains of G(V,E P (S)) or all antichains are preserved. Consequently, an order-preserving left shift is also order-monotonic. Moreover, since the initial and final schedules belong to the same feasible order polyhedron S(P (S)) or S(P (S )), an order-monotonic left shift is also a local left shift. DEFINITION 1.6. A schedule is quasi-active if it admits no feasible order-preserving left shift. From a polyhedral point of view, a schedule S is quasi-active if for each activity A i V, S = LS(S, A i, ) does not belong to S(P (S)), for all > 0, i.e. if it is the minimal point of S(P (S)). We can show that schedule ES(P 4 ) defined above is quasi-active since any left shift violates its interval order P (ES(P 4 )) = {(A 1,A 8 ), (A 1,A 10 ), (A 2,A 1 ), (A 2, ), (A 2, ), (A 2,A 7 ), (A 2,A 8 ), (A 2, ),(A 2,A 10 ), (A 3,A 1 ), (A 3, ), (A 3, ), (A 3,A 7 ), (A 3,A 8 ), (A 3, ), (A 3,A 10 ), (A 4,A 7 ), (A 4,A 8 ), (A 4, ), (A 4,A 10 ), (,A 7 ), (,A 8 ), (, ), (,A 10 ), (,A 7 ), (,A 8 ), (,A 10 ), (,A 7 ), (,A 8 ), (,A 10 ), (A 10,A 8 )}. Since each semi-active schedule is also a quasi-active schedule, we have the following relations SH sa Sqa H S H where S qa H denote the set of quasi-active schedules. DEFINITION 1.7. A schedule is pseudo-active if it admits no feasible ordermonotonic left shift. A schedule S is pseudo-active if for each activity A i V, S = LS(S, A i, ) does not belong to S(P ), for all > 0 and for all strict orders P such that S S(P ), i.e. if it is the minimal point of all schedule sets S(P ) containing S. Schedule ES(P 4 ) is not pseudo-active since a local left shift of 1 unit on activity A 10 is order-monotonic: it removes (10, 8) and (1, 8) from P (ES(P 4 )) yielding a necessarily feasible and non-worse schedule. In the terms of Definition 1.7, we can also remark alternatively that ES(P 4 ) belongs to the polyhedron S(P 1 ) and that activity A 10 can be locally left shifted while obtaining a schedule still in set S(P 1 ). Based on these definitions, the following theorem can be established. THEOREM 1.1. The set of semi-active schedules and the set of pseudo-active schedules are identical for the RCPSP.

11 The Resource-Constrained Project Scheduling Problem 31 Proof. Since there is no feasible local left shift from a semi-active schedule, the set of semi-active schedules is included in the set of pseudo-active schedules. We show that, conversely, there is no feasible local left shift from a pseudo-active schedule. Suppose that there is a feasible local non-order-monotonic left shift LS(S, A i, ) from a pseudo-active schedule S yielding schedule S. Since LS(S, A i, ) is not order-monotonic, let (A j,a i ) P (S), (A j,a i ) P (S ), (A i,a k ) P (S) and (A i,a k ) P (S ).Let = (S i + p i S k )/2. Wehave > and then LS(S, A i, ) is feasible and does not create (A i,a k ) while (A j,a i ) is either removed from or kept in P (S ).FromS, we can recursively apply this principle until obtaining a feasible order-monotonic left shift from S, which contradicts the hypothesis. To sum up, we have the following relations between the presented dominant schedule sets: SH a Ssa H = Spa H Sqa H S H, where S pa H denotes the set of pseudo-active schedules. It should be mentioned that for the RCPSP with minimal and maximal time lags, an extension of the problem considered in Chapter 11, it generally holds that SH sa [NEU 00a]. Spa H 1.6. Forbidden sets and resource flow network formulations of the RCPSP From the order-based representation of dominant schedules, we can derive two alternative formulations of the RCPSP restricting the search space to the dominant set of quasi-active schedules. A forbidden set is a set F of activities that cannot be scheduled in parallel in a feasible solution because of resource limitations due to a resource R k such that A i F b ik >B k. A forbidden set is minimal if any of its subsets of activities F verifies, R k R, A i F b ik B k.letf denote the set of minimal forbidden sets. No element of F can be an antichain of G(V,E P (S)) for any feasible schedule S. Consequently, a necessary condition for feasibility of a schedule S is that F F, F 2 P (S). A forbidden set F such that F 2 P (S) is said to be broken up. If, in addition, S S( ), we obtain a necessary and sufficient condition. Consequently, the RCPSP can be reformulated as follows. DEFINITION 1.8. The RCPSP aims at finding a strict order P such that G(V,E P ) is acyclic, F F, F 2 P and ES(P ) n+1 is minimal. The drawback of the preceding formulation is that the number of minimal forbidden sets F can be extremely large. A significant number of forbidden sets are implicitly broken up due to precedence relations. Indeed as soon as there is a path from A i to A j in the precedence graph G(V,E), any precedence-feasible schedule breaks up any forbidden set including both A i and A j. Thus, we do not have to consider such forbidden sets in F.

12 32 Resource-Constrained Project Scheduling However, it is not trivial to efficiently enumerate all the minimal forbidden sets. Stork and Uetz propose in [STO 05] an algorithm based on the enumeration of all the subsets of A through a tree, in which each node, except the root node, is associated with an activity. In the tree, each branch corresponds to a candidate minimal forbidden set. The root node has n children corresponding to A 1,...,A n. Then, each node A i has potentially n i children A i+1,...,a n. A node corresponds to a minimal forbidden set as soon as the sum of the resource demands over the node itself and all its ascendants exceeds the capacity of one resource. A node is fathomed as soon as it does not lead to a minimal forbidden set. Figure 1.4 displays the 24 minimal forbidden sets, not broken up by precedence relations, obtained through the tree structure for the illustrative example. Note that because of precedence relations, activity A 10 does not belong to any forbidden set and, consequently, can be ignored for the computation of the strict orders. If we ignore the precedence relations, the number of minimal forbidden sets grows up to 97. The reader may verify that both strict orders P 1 and P 2 break up the 24 forbidden sets whereas P 3 does not (see for instance forbidden set {A 1,A 8, }). Chapter 7 discusses computational experiments implementing the Stork and Uetz algorithm to evaluate the hardness of RCPSP instances. A 1 A 3 A 4 A 2 A 3 A 4 A 8 A 4 A 8 A 8 A 3 A 4 A 4 A 7 A 7 A A 4 A 7 A 8 A 8 A 7 A 7 A A 8 A 8 A 8 A Figure 1.4. Minimal forbidden sets of the illustrative example An intermediate order-based representation can be used to avoid the use of F in the RCPSP formulation. This representation involves the concept of resource flow decision variables f k ij for A i A {A 0 },fora j A {A n+1 } and for R k R. f is a resource flow if it verifies the following constraints: fij k 0 A i A {A 0 }, A j A {A n+1 }, R k R (1.3) f0i k = fi(n+1) k = B k R k R (1.4) A i A {A n+1} A j A {A n+1} f k ij = A i A {A 0} A j A {A 0} f k ji = b ik A i A, R k R (1.5)

13 The Resource-Constrained Project Scheduling Problem 33 A resource flow f induces the strict order P (f), the transitive closure of {(A i,a j ) V 2 f ij > 0}. The following lemmas establish the link between flows and strict orders. LEMMA 1.1. If f is a flow and G(V,E P (f)) is acyclic, then P (f) is a feasible strict order. Proof. First, if G(V,E P (f)) is acyclic, then ES(P (f)) is time feasible. Second, suppose that a forbidden set F is not broken up by ES(P (f)) for a resource k. Since all activities of F are simultaneously in process during at least one time period, there is a total incoming flow of F equal to i F b ik >B k which violates the flow conservation conditions. Consequently, a resource flow such that G(V,E P (f)) is acyclic is said to be feasible. LEMMA 1.2. For each feasible strict order P, there is a feasible resource flow f such that ES(P (f)) ES(P ). Proof. Let us consider the feasible schedule S = ES(P ) and strict order P (S) P with ES(P (S)) = S. By setting additional constraints fij k =0for all (A i,a j ) P (S) we show that there exists a flow verifying equations (1.3)-(1.5). This amounts to verifying that there exists a feasible flow in each network G k (V,E P (S)), for each resource R k Rwith minimal and maximal node capacities b ik for all activities A i Aand node capacities B k for nodes A 0 and A n+1. Let us transform this graph with bounds on node flow into a graph with bounds on arc flows. We split each node A i V into two nodes A i and A i linked by an arc of minimal and maximal capacities equal to the node capacity. All other arcs have null minimal capacities and infinite maximal capacities. If we now ignore the maximal capacities, since P (S) is feasible, there is no A 0 A n+1 cut of (minimal) capacity greater than B k. Indeed suppose that such a cut exists. Then, it includes a set of arcs (i, i ) that represents a non-broken up forbidden set. Furthermore there is a A 0 A n+1 cut (reduced to arc (A 0,A 0)) of minimal capacity equal to B k. Therefore, according to the min-flow max-cut theorem (see [NEU 03, LEU 04]), we have a minimal flow equal to B k. It follows from Lemmas 1.1 and 1.2 that the RCPSP can be defined as follows. DEFINITION 1.9. The RCPSP aims at finding a feasible flow f such that ES(P (f)) (n+1) is minimal. From a feasible flow f, a feasible schedule ES(P (f)) can be computed by longest path computations in graph G(V,E P (f)) where all arcs (A i,a j ) E P (f) are valuated by p j.

14 34 Resource-Constrained Project Scheduling Conversely, Algorithm 2 allows the computation of a feasible flow f from any feasible schedule S in O(n 2 R ). The algorithm assumes activities are sorted in increasing order of their completion times. For each activity A i, the incoming flow is simply taken from the activities A j completed before the start time of A i. At each step of the algorithm, β ik denotes the number of resource R k units that remain to be sent to A i. Algorithm 2 BUILDFLOWFROMSCHEDULE(f,S): generates flow f from schedule S 1: β ik b ik, A i A, R k R 2: f k i(n+1) b ik, A i A, R k R 3: f0(n+1) k B k, R k R 4: for A i A(in increasing order of completion times C i ) do 5: for A j A, A j A i do 6: for R k Rdo 7: if C j S i then 8: 9: ρ min(fj(n+1) k,β ik) β ik β ik ρ 10: fj(n+1) k f i(n+1) k ρ 11: f k ji f k ji + ρ 12: end if 13: end for 14: end for 15: end for Figure 1.5 gives a flow representing the schedule displayed in Figure 1.2. The flow values for both resources are displayed near each arc. Dotted arcs are the arcs representing the additional precedence constraints induced by the flow and used to define P (f). We observe here that P 1 P (f), P 1 being the inclusion-minimal strict order defined in section 1.5. Consequently, we can verify on this example that P (f) breaks up all the forbidden sets A simple method for enumerating a dominant set of quasi-active schedules A very simple algorithm can be designed to find an optimal solution of a RCPSP without enumerating the forbidden sets nor using the concept of flows. Conceptually, it consists of starting with an empty strict order P =. If the time feasible earlieststart schedule ES(P ) is feasible, which can be checked by Algorithm 1, then it is the optimal schedule. Otherwise, Algorithm 1 returns a non-broken up minimal forbidden set F. The optimal solution can be found by recursively applying this procedure for each (A i,a j ) F after adding (A i,a j ) to P. The recursive algorithm OPTFS is given as Algorithm 3. Algorithm 3 can also be used as a one pass method to build a single feasible solution to the RCPSP. It suffices to select at each step a single arc (A i,a j ) F 2 such that

15 The Resource-Constrained Project Scheduling Problem 35 (1,0) A 1 (1,1) (1,0) (1,0) (0,1) A 2 (1,0) (0,1) (1,0) (1,1) (0,1) A 10 (1,1) A 0 (3,1) A 3 (0,1) (2,0) (2,0) A 7 (1,0) (3,0) A11 (2,0) (0,2) (1,2) (1,0) (1,0) A 4 A 8 Figure 1.5. A resource flow for the schedule of Figure 1.2 Algorithm 3 OPTFS(P ): search for an optimal solution to the RCPCP with an initial set of additional arcs P 1: if S(P )= then 2: return + 3: else if ES(P ) is resource-feasible (checked by Algorithm 1) then 4: return ES(P ) n+1 5: else 6: (Algorithm 1 has returned a violated forbidden set F ) 7: return min (Ai,A j) F F OPTFS(P {(A i,a j )}) 8: end if (A i,a j ) does not induce a cycle in G(V,E P ). AnO( E P ) algorithm can be used to perform a cycle check. Such an arc always exists because if (A i,a j ) F 2 induces a cycle, (A j,a i ) does not induce a cycle and also breaks up the forbidden set. Since an arc is added at each iteration, the algorithms gives a feasible solution in n(n 1)/2 iterations. The obtained schedule is quasi-active since it is equal to ES(P ). It follows that Algorithm 3 computes a set of dominant quasi-active schedules. In the algorithm we refer to P as a set of additional arcs and not as a strict order for practical reasons. As stated earlier, the relevant elements of a strict order are the arcs belonging to the transitive closure. When adding arc (A i,a j ) to P at step 7, computing the transitive closure of P to keep the transitivity property would be an unnecessary computational effort.

Scheduling Shop Scheduling. Tim Nieberg

Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

Classification - Examples -1- 1 r j C max given: n jobs with processing times p 1,..., p n and release dates

Lecture 2 Scheduling 1 Classification - Examples -1-1 r j C max given: n jobs with processing times p 1,..., p n and release dates r 1,..., r n jobs have to be scheduled without preemption on one machine

Scheduling and (Integer) Linear Programming

Scheduling and (Integer) Linear Programming Christian Artigues LAAS - CNRS & Université de Toulouse, France artigues@laas.fr Master Class CPAIOR 2012 - Nantes Christian Artigues Scheduling and (Integer)

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

Classification - Examples

Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking

Scheduling. Open shop, job shop, flow shop scheduling. Related problems. Open shop, job shop, flow shop scheduling

Scheduling Basic scheduling problems: open shop, job shop, flow job The disjunctive graph representation Algorithms for solving the job shop problem Computational complexity of the job shop problem Open

Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems

Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems PHILIPPE BAPTISTE 1,2 AND CLAUDE LE PAPE 1 baptiste@utc.fr, clepapeg@bouyguestelecom.fr

Scheduling Single Machine Scheduling. Tim Nieberg

Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe

Good luck, veel succes!

Final exam Advanced Linear Programming, May 7, 13.00-16.00 Switch off your mobile phone, PDA and any other mobile device and put it far away. No books or other reading materials are allowed. This exam

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

Project Scheduling with Changeover Times: A Branch-and-Bound Approach

Project Scheduling with Changeover Times: A Branch-and-Bound Approach Christoph Schwindt Institut für Wirtschaftstheorie und Operations Research University of Karlsruhe D-76128 Karlsruhe, Germany e-mail:

5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

Lecture 6: Approximation via LP Rounding

Lecture 6: Approximation via LP Rounding Let G = (V, E) be an (undirected) graph. A subset C V is called a vertex cover for G if for every edge (v i, v j ) E we have v i C or v j C (or both). In other

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004

Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February

Ecient approximation algorithm for minimizing makespan. on uniformly related machines. Chandra Chekuri. November 25, 1997.

Ecient approximation algorithm for minimizing makespan on uniformly related machines Chandra Chekuri November 25, 1997 Abstract We obtain a new ecient approximation algorithm for scheduling precedence

GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

Discrete (and Continuous) Optimization Solutions of Exercises 1 WI4 131

Discrete (and Continuous) Optimization Solutions of Exercises 1 WI4 131 Kees Roos Technische Universiteit Delft Faculteit Informatietechnologie en Systemen Afdeling Informatie, Systemen en Algoritmiek

Dynamic programming. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013

Dynamic programming Doctoral course Optimization on graphs - Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NP-hard and we usually

Relations Graphical View

Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary

Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling

Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute

Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar

Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples

1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization

Scheduling a sequence of tasks with general completion costs

Scheduling a sequence of tasks with general completion costs Francis Sourd CNRS-LIP6 4, place Jussieu 75252 Paris Cedex 05, France Francis.Sourd@lip6.fr Abstract Scheduling a sequence of tasks in the acceptation

Spectral graph theory

Spectral graph theory Uri Feige January 2010 1 Background With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian

Single machine parallel batch scheduling with unbounded capacity

Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University

Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

8.1 Makespan Scheduling

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programing: Min-Makespan and Bin Packing Date: 2/19/15 Scribe: Gabriel Kaptchuk 8.1 Makespan Scheduling Consider an instance

A simple existence criterion for normal spanning trees in infinite graphs

1 A simple existence criterion for normal spanning trees in infinite graphs Reinhard Diestel Halin proved in 1978 that there exists a normal spanning tree in every connected graph G that satisfies the

Algorithm Design and Analysis

Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;

Scheduling Real-time Tasks: Algorithms and Complexity

Scheduling Real-time Tasks: Algorithms and Complexity Sanjoy Baruah The University of North Carolina at Chapel Hill Email: baruah@cs.unc.edu Joël Goossens Université Libre de Bruxelles Email: joel.goossens@ulb.ac.be

Applied Algorithm Design Lecture 5

Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design

Part 2: Community Detection

Chapter 8: Graph Data Part 2: Community Detection Based on Leskovec, Rajaraman, Ullman 2014: Mining of Massive Datasets Big Data Management and Analytics Outline Community Detection - Social networks -

CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma

CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are

Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

Min-cost flow problems and network simplex algorithm

Min-cost flow problems and network simplex algorithm The particular structure of some LP problems can be sometimes used for the design of solution techniques more efficient than the simplex algorithm.

Introduction to Scheduling Theory

Introduction to Scheduling Theory Arnaud Legrand Laboratoire Informatique et Distribution IMAG CNRS, France arnaud.legrand@imag.fr November 8, 2004 1/ 26 Outline 1 Task graphs from outer space 2 Scheduling

R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

Two General Methods to Reduce Delay and Change of Enumeration Algorithms

ISSN 1346-5597 NII Technical Report Two General Methods to Reduce Delay and Change of Enumeration Algorithms Takeaki Uno NII-2003-004E Apr.2003 Two General Methods to Reduce Delay and Change of Enumeration

The Trip Scheduling Problem

The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems

Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

1 Polyhedra and Linear Programming

CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material

Optimal Binary Space Partitions in the Plane

Optimal Binary Space Partitions in the Plane Mark de Berg and Amirali Khosravi TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, the Netherlands Abstract. An optimal bsp for a set S of disjoint line segments

max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

Matching and Scheduling Algorithms on Large Scale Dynamic Graphs

Matching and Scheduling Algorithms on Large Scale Dynamic Graphs Author: Xander van den Eelaart Supervisors: Prof. dr. Rob H. Bisseling ir. Marcel F. van den Elst Second reader: dr. Tobias Müller Master

Resource allocation for robust project scheduling

BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 59, No. 1, 2011 DOI: 10.2478/v10175-011-0008-z Varia Resource allocation for robust project scheduling M. KLIMEK 1 and P. ŁEBKOWSKI 2

f(x) is a singleton set for all x A. If f is a function and f(x) = {y}, we normally write

Math 525 Chapter 1 Stuff If A and B are sets, then A B = {(x,y) x A, y B} denotes the product set. If S A B, then S is called a relation from A to B or a relation between A and B. If B = A, S A A is called

Introduction to Flocking {Stochastic Matrices}

Supelec EECI Graduate School in Control Introduction to Flocking {Stochastic Matrices} A. S. Morse Yale University Gif sur - Yvette May 21, 2012 CRAIG REYNOLDS - 1987 BOIDS The Lion King CRAIG REYNOLDS

Measuring Rationality with the Minimum Cost of Revealed Preference Violations. Mark Dean and Daniel Martin. Online Appendices - Not for Publication

Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix

Common Approaches to Real-Time Scheduling

Common Approaches to Real-Time Scheduling Clock-driven time-driven schedulers Priority-driven schedulers Examples of priority driven schedulers Effective timing constraints The Earliest-Deadline-First

Domain Theory: An Introduction

Domain Theory: An Introduction Robert Cartwright Rebecca Parsons Rice University This monograph is an unauthorized revision of Lectures On A Mathematical Theory of Computation by Dana Scott [3]. Scott

Near Optimal Solutions

Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.

SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

Chapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.

Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

S = {1, 2,..., n}. P (1, 1) P (1, 2)... P (1, n) P (2, 1) P (2, 2)... P (2, n) P = . P (n, 1) P (n, 2)... P (n, n)

last revised: 26 January 2009 1 Markov Chains A Markov chain process is a simple type of stochastic process with many social science applications. We ll start with an abstract description before moving

List Scheduling in Order of α-points on a Single Machine

List Scheduling in Order of α-points on a Single Machine Martin Skutella Fachbereich Mathematik, Universität Dortmund, D 4422 Dortmund, Germany martin.skutella@uni-dortmund.de http://www.mathematik.uni-dortmund.de/

COLORED GRAPHS AND THEIR PROPERTIES

COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring

Discuss the size of the instance for the minimum spanning tree problem.

3.1 Algorithm complexity The algorithms A, B are given. The former has complexity O(n 2 ), the latter O(2 n ), where n is the size of the instance. Let n A 0 be the size of the largest instance that can

Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

A Working Knowledge of Computational Complexity for an Optimizer

A Working Knowledge of Computational Complexity for an Optimizer ORF 363/COS 323 Instructor: Amir Ali Ahmadi TAs: Y. Chen, G. Hall, J. Ye Fall 2014 1 Why computational complexity? What is computational

Approximation Algorithms. Scheduling. Approximation algorithms. Scheduling jobs on a single machine

Approximation algorithms Approximation Algorithms Fast. Cheap. Reliable. Choose two. NP-hard problems: choose 2 of optimal polynomial time all instances Approximation algorithms. Trade-off between time

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute

CHAPTER 9. Integer Programming

CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral

Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

Diagonalization. Ahto Buldas. Lecture 3 of Complexity Theory October 8, 2009. Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.

Diagonalization Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Background One basic goal in complexity theory is to separate interesting complexity

A binary search algorithm for a special case of minimizing the lateness on a single machine

Issue 3, Volume 3, 2009 45 A binary search algorithm for a special case of minimizing the lateness on a single machine Nodari Vakhania Abstract We study the problem of scheduling jobs with release times

Analysis of Server Provisioning for Distributed Interactive Applications

Analysis of Server Provisioning for Distributed Interactive Applications Hanying Zheng and Xueyan Tang Abstract Increasing geographical spreads of modern distributed interactive applications DIAs make

Intersection Dimension and Maximum Degree

Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai - 600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

Graph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick

Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements

CSE / Notes : Task Scheduling & Load Balancing Task Scheduling A task is a (sequential) activity that uses a set of inputs to produce a set of outputs. A task (precedence) graph is an acyclic, directed

10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

AGILE PROJECT SCHEDULING IN SOFTWARE DEVELOPMENT

AGILE PROJECT SCHEDULING IN SOFTWARE DEVELOPMENT Eric Newby Study Group Participants Eric Newby, Byron Jacobs, Raymond Phillips, Dario Fanucchi, Asha Tailor, Lady Kokela, Jesal Kika, Nadine Padiyachi Industry

Clustering and scheduling maintenance tasks over time

Clustering and scheduling maintenance tasks over time Per Kreuger 2008-04-29 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocating

3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

The Isolation Game: A Game of Distances

The Isolation Game: A Game of Distances Yingchao Zhao a,1 Wei Chen b Shang-hua Teng c,2 a Department of Computer Science, Tsinghua University b Microsoft Research Asia c Department of Computer Science,

A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

Resource Allocation with Time Intervals

Resource Allocation with Time Intervals Andreas Darmann Ulrich Pferschy Joachim Schauer Abstract We study a resource allocation problem where jobs have the following characteristics: Each job consumes

Complexity and Completeness of Finding Another Solution and Its Application to Puzzles

yato@is.s.u-tokyo.ac.jp seta@is.s.u-tokyo.ac.jp Π (ASP) Π x s x s ASP Ueda Nagao n n-asp parsimonious ASP ASP NP Complexity and Completeness of Finding Another Solution and Its Application to Puzzles Takayuki

Introduction to Logic in Computer Science: Autumn 2006

Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Now that we have a basic understanding

1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

24. The Branch and Bound Method

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 7 : Program Correctness 7.1 Program Correctness Showing that a program is correct means that

The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

Solutions to Homework 6

Solutions to Homework 6 Debasish Das EECS Department, Northwestern University ddas@northwestern.edu 1 Problem 5.24 We want to find light spanning trees with certain special properties. Given is one example

Scheduling Parallel Jobs with Monotone Speedup 1

Scheduling Parallel Jobs with Monotone Speedup 1 Alexander Grigoriev, Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands, {a.grigoriev@ke.unimaas.nl,