On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
|
|
- Peter Arnold
- 5 years ago
- Views:
Transcription
1 Mathematical Programming manuscript No. (will be inserted by the editor) Yunpeng Pan Leyuan Shi On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems Received: / Accepted: Abstract New observations are made about two lower bound schemes for single-machine min-sum scheduling problems. We find that the strongest bound of those provided by transportation problem relaxations can be computed by solving a linear program. We show the equivalence of this strongest bound and the bound provided by the LP relaxation of the time-indexed integer programming formulation. These observations lead to a new lower bound scheme that yields fast approximation of the time-indexed bound. Several techniques are developed to facilitate the effective use of the new lower bound in branch-and-bound. Numerical experiments are conducted on 375 benchmark problems of the total weighted tardiness problem from OR- Library. Results obtained with our new method are spectacular; we are able to solve all 125 open problems to optimality. 1 Introduction The application of linear programming (LP)-based lower bounds has fundamentally changed the landscapes of many areas of discrete optimization. However, machine scheduling is one of the remaining strongholds where LPbased methods have not been able to compete with specialized algorithms. It is our hope that the results to be presented here would tip the balance of power to the favor of LP-based methods. First, let us describe the problem. Jobs 1,..., n need to be processed on a machine that can only process one job at a time without interruption. Job j takes time p j to complete; upon its completion at time t j, it incurs cost f j (t j ), which is an arbitrary function. The objective is to find a processing sequence such that the total Y. Pan: TomoTherapy Inc., 1240 Deming Way, Madison, WI , USA, Tel.: , ypan@tomotherapy.com. This research was done while the author was a post-doc in the Dept. of ISyE at University of Wisconsin-Madison L. Shi: Dept. of ISyE, University of Wisconsin-Madison, Madison, WI 53706, USA
2 2 Yunpeng Pan, Leyuan Shi cost, n j=1 f j(t j ), is minimized. Even for the most common cost functions, the problem may be intractable. The optimal solution of the problem hence entails clever enumeration, which in turn requires a tight lower bound. The classical scheduling approach assumes specific cost functions and develops lower bounds, typically without using LP. An apparent drawback is that specialized schemes become invalid with generalization of the problem. Within the mathematical programming community, there are two main schools of thought regarding how to formulate the problem. Integer programming (IP) formulations using continuous completion (or start) time variables along with binary variables have been proposed. Early work along this line includes that of Balas [6, 7]. The LP relaxations of these formulations are not very strong, despite various efforts to strengthen them using valid inequalities [7, 4] (see [18] for a comprehensive survey). On the other hand, time-indexed IP formulations have been studied. Dyer and Wolsey [12] show that a particular time-indexed formulation gives the strongest bound among several formulations, ranging from combinatorial lower bounds to LP-based ones. Polyhedral results are also proposed to further strengthen the LP relaxation of the time-indexed formulation [21, 2]. Despite its superior quality, one criticism of the time-indexed formulation is that time-indexing can result in a possibly huge number of time periods, as the number of time periods is not bounded by a polynomial function in the number of jobs. Therefore, model accuracy sometimes may have to be sacrificed with a coarse discretization of time, in an effort to curb the formulation size. A clear advantage of time-indexing is that the cost functions f j ( ) can be arbitrary, including nonlinear functions, as long as f j ( ) can be evaluated at each point. The biggest disadvantage of time-indexing, however, is that it involves a large number of variables and constraints, so much so that even the LP relaxation can be difficult to solve. To address this problem, Van den Akker et al. [3] exploit the sparsity in the LP solution through column generation. While column generation can speed up the solution of the LP relaxation as seen in [3], it has not overcome the breaking point where the large majority of instances with more than 30 jobs can be solved. More recent work includes [8] on the time-indexed formulation and column generation, and [5] on the time-indexed formulation and the Lagrangian relaxation. In this paper, the time-indexed formulation should be interpreted as the particular one studied in [21, 2]. The time-indexed lower bound refers to the bound provided by the LP relaxation of the time-indexed formulation. We report a somewhat unexpected result. It turns out that the time-indexed lower bound can be obtained in a completely different light. Specifically, we point out that the strongest bound from the family of lower bounds provided by transportation problem relaxations of the problem can be determined by solving a single linear program. Furthermore, this bound is shown to be equal to the time-indexed lower bound. We propose methods that offer a more cost-effective way to leverage the quality of the time-indexed lower bound in branch-and-bound. Although the initial work at the root node is no less than that required by the time-indexed lower bound, we are able to extract some crucial structural information that can be re-used at subsequent
3 Equivalence of max-min transportation bound and time-indexed bound 3 nodes. Computing lower bounds for nodes other than the root then amounts to solving transportation problems. The paper is organized as follows. Section 2 introduces the new lower bound and presents the equivalence proof. Section 3 addresses a number of issues regarding how to use the lower bound effectively in branch-andbound. Section 4 reports on our computational experience in using the lower bound in branch-and-bound algorithms for solving the total weighted tardiness scheduling problem. Section 5 presents some concluding remarks. 2 Max-min transportation lower bound 2.1 General lower bound scheme The transportation problem relaxation of scheduling problems with min-sum objectives and general cost functions was first introduced by Lawler [14] in his 1964 seminal paper. Let us assume that jobs 1,..., n are to be processed during time window [0, T ]. To discretize the time window, we refer to the time interval [t, t + 1) as period t; hence, t = 0,..., T 1. The following transportation problem can be constructed: T 1 min c jt x jt (P(c)) s.t. j=1 T 1 x jt = p j, j = 1,..., n, (1) x jt 1, t = 0,..., T 1, (2) j=1 x jt 0, j = 1,..., n; t = 0,..., T 1, (3) where x jt = 1 if job j is assigned to period t, and x jt = 0 otherwise; c jt is the transportation cost. Lawler [14] gives the following sufficient condition under which (P(c)) will provide a lower bound for the scheduling problem: Proposition 1 ([14]) A sufficient condition for (P(c)) to provide a lower bound for the scheduling problem is t+p j 1 s=t c js = f j (t + p j ), j = 1,..., n; t = 0,..., T p j. (4) A less stringent condition is obtained by changing = to in (4): Proposition 2 A sufficient condition for (P(c)) to provide a lower bound for the scheduling problem is t+p j 1 s=t c js f j (t + p j ), j = 1,..., n; t = 0,..., T p j. (5)
4 4 Yunpeng Pan, Leyuan Shi The sufficiency of these conditions is obvious. Both (4) and (5) require that if all the p j units of processing are assigned to consecutive periods, the total transportation cost for this job cannot exceed the cost of job completion after the last of these periods. Since in (P(c)) jobs do not have to be assigned to consecutive periods, the minimum value of (P(c)) is therefore a lower bound. Further, we have found many examples indicating that the bounds produced by (5) are often strictly stronger than those produced by (4). Regardless of which of these conditions is adopted, it leaves an infinite number of choices for cost vector c. Lawler [14] seems to have left this question open. All previous work along this line focuses on particular job cost functions, and heuristically chooses cost structures that are plausible for their respective job cost functions; e.g., [12,19] using (4) and [13,9] using (5). We propose to determine an optimal cost structure that yields the strongest transportation problem relaxation. Our approach is fundamentally different than previous work in two respects. First, no assumption of a particular job cost function is made. Second, the bound provided by this strongest transportation problem relaxation has superior quality. In contrast, previous relaxations are viewed to have rather poor quality. The stark difference in bound quality is due to the fact that our optimal cost structure takes into account interactions among competing jobs, whereas previous heuristic cost structures have not been able to capture such interactions. 2.2 Optimal choice of c Let LB(c) denote the optimal objective value of the transportation problem (P(c)). Then, we define the max-min transportation lower bound as LB = max{lb(c) c satisfies (5)}. LB(c) is a concave function of c, and subgradient optimization may thus be used. However, it is important to note that the choice of c is constrained by (5). Although constrained subgradient optimization via projection can be applied, it makes the already slow convergence of subgradient optimization even slower. To resolve the difficulty of this max-min problem, we consider the LP dual problem of (P(c)) instead: T 1 LB(c) = max p j u j + j=1 (DP(c)) s.t. u j + v t c jt, j = 1,..., n; t = 0,..., T 1, u j free, j = 1,..., n and v t 0, t = 0,..., T 1, v t where (u, v) are the dual variables associated with (1) (2). Hence, the original two-stage problem reduces to a linear program with variables (u, v, c): LB = max j=1 T 1 p j u j + v t (P1) s.t. (5), u j + v t c jt 0, j = 1,..., n; t = 0,..., T 1, (6) u j free, j = 1,..., n and v t 0, t = 0,..., T 1, (7)
5 Equivalence of max-min transportation bound and time-indexed bound Equivalence of LB and the time-indexed lower bound The max-min transportation lower bound LB, by definition, is the strongest lower bound from the family of lower bounds provided by transportation problem relaxations of the scheduling problem. For a particular c that satisfies (4), Dyer and Wolsey [12] prove that LB(c) is dominated by the time-indexed lower bound. Other than this result, LB seemingly has nothing to do with the time-indexed lower bound. However, in our preliminary experiments, we compared these two bounds, and to our great surprise, they were equal on all test problems. A closer examination revealed that it was no coincidence that the two bounds matched on those test problems. We recall the LP relaxation of the time-indexed IP formulation: (TI) min s.t. j=1 T p j T p j f j (t + p j )y jt y jt = 1, j = 1,..., n, (8) t j=1 s=t p j +1 y jt 1, t = 0,..., T 1, (9) y jt 0, j = 1,..., n; t = 0,..., T p j, where variables y jt = 1 if job j is to start in period t, and y jt = 0 otherwise. Theorem 1 The max-min transportation lower bound and the time-indexed lower bound are equivalent. Proof Consider problem (P1). We first project the polyhedron represented by constraints (5) (7) from (u, v, c)-space to (u, v)-space. This is straightforward since c variables are free and their coefficients in the objective function of (P1) are all zeros. Hence, (P1) is reduced to (P1 ): LB = max j=1 T 1 p j u j + v t t+p j 1 (P1 ) s.t. p j u j + v s f j (t+p j ), j=1,..., n;,..., T p j, (10) s=t u j free, j = 1,..., n and v t 0, t = 0,..., T 1. (11) If (u, v, c) satisfies (5) (7), then (u, v) satisfies (10) (11). Conversely, if (u, v) satisfies (10) (11), we define (u, v, c) where c jt = u j + v t for all j, t; such a (u, v, c) satisfies (5) (7). If we replace p j u j with a new variable u j, and v t with v t in (P1 ), it is not difficult to verify that (P1 ) is the LP dual problem of (TI). Hence, their optimal values are equal. Note that the variables u j = p j u j, j = 1,..., n; and v t = v t, t = 0,..., T 1 (12) are the dual variables associated with constraints (8) (9) in (TI).
6 6 Yunpeng Pan, Leyuan Shi 3 Using the new lower bound in branch-and-bound The time-indexed lower bound is known to be strong, typically, with an initial gap of less than 1 2% in our experience as well as those of others (see, e.g., [2]). As mentioned before, the computational expense of the bound is unfortunately too high for even moderate sized problems. In this section, we discuss how to use the proposed max-min transportation lower bound in branch-and-bound, which can be done much more efficiently due to the structure of transportation problems. The original contribution of our proposed method is that it eliminates the need to compute time-indexed lower bounds at all nodes except the root. Since the root and other nodes in the search tree are handled differently, we proceed to explain the treatment of each node type separately. 3.1 Root node The main task to be accomplished at the root is to compute the optimal transportation costs for later use at other nodes. While it suffices to solve (P1), it is not a particularly efficient way, since this LP has (n + T + nt ) columns and (2nT + n P ) rows, where P = n j=1 p j is the sum of job processing times. Alternatively, we propose a method that first solves the projected problem (P1 ) to determine optimal (u, v) values, and then computes an optimal c value for the fixed (u, v) values. Solution of problem (P1 ). In comparison with (P1), (P1 ) is a lot smaller in size, with only (n + T ) columns and (nt + n P ) rows. Furthermore, we find that it is conducive to transpose the coefficient matrix so that there are fewer rows than columns; then, fewer logical/slack variables would need to be added by an LP solver. We therefore solve, instead, the LP dual problem of (P1 ), which is (TI). After (TI) is solved, we extract the dual variable values associated with its constraints and use (12) to obtain (u, v) values. It is important to note that this is the only time when (TI) needs to be solved. A sparse reformulation of (TI). Although (TI) has fewer columns and rows than (P1), the size of (TI) remains the most serious challenge that we must face when trying to solve the LP. In fact, the size of (TI) as measured by the number of nonzeros in its coefficient matrix, roughly quadruples as the processing time range doubles. For example, with a processing time range of [1, 100], our 2.8 GHz PC equipped with 1 GB of memory would barely be able to solve the LP for n = 50; for n = 100, the initial loading of the LP data would activate virtual memory in addition to the 1 GB physical memory, thereby reducing solver execution to a crawl. To deal with this size issue, we introduce a simple, but useful sparse reformulation of (TI) whose size grows linearly with the expansion of the processing time range. As a result, an LP solver now can run faster and can solve problems that previously were too large to load into the memory. Let job 0 denote a dummy job with unit processing time, i.e., p 0 = 1. We expand the variable set of (TI) by adding variables y 0t (t = 0,..., T 1). When job 0 is started in period t, i.e., y 0t = 1, it indicates the idling of the machine in this period at cost f 0 (t+p 0 ) 0. In addition, job 0 is not subject
7 Equivalence of max-min transportation bound and time-indexed bound 7 to constraints (8), and can be started more than once. Hence, we have the following reformulation: min j=1 (TI ) s.t. (8), T p j t j=0 s=t p j +1 f j (t + p j )y jt y jt = 1, t = 0,..., T 1, (13) y jt 0, j = 0,..., n; t = 0,..., T p j, where the y 0t variables can also be viewed as slack variables. Furthermore, the constraints in (13) form an interval matrix, in which 1 s appear consecutively in each column [15,2]. Hence, we can apply the following row transformations to these constraints: The equation for t = 0 is left unchanged; for t = 1,..., T 1, we multiply both sides of the equation for t 1 by 1 and then add it to the equation for t. This gives us a sparse reformulation: min j=1 T p j f j (t + p j )y jt (TIS) s.t. (8), y j0 = 1, (14) j=0 (y jt y j(t pj)) = 0, t = 1,..., T 1, (15) j=0 y jt 0, j = 0,..., n; t = 0,..., T p j. Note that the number of nonzeros in each equation of (15) does not exceed 2(n + 1), independent of processing time range. Now suppose that we have solved problem (TIS) to obtain an optimal primal solution y jt (j = 0,..., n; t = 0,..., T p j ) along with dual variable (t = 1,..., T 1) associated with constraints (8), (14), and (15), respectively. The restriction of the primal solution to index set (j = 1,..., n; t = 0,..., T p j ) is of course optimal to (TI). The dual variable values associated with constraints of (TI) are not explicit, but can be reconstituted as follows. Recall that (TI ) results from the addition of slack variables to (TI); thus, the dual variable values associated with the constraints are the same. Let A = [B; N] be the coefficient matrix of (TI ), where B is an (n+t ) (n+t ) matrix consisting of the basic columns associated with the optimal LP solution, and values u j (j = 1,..., n), v 0, and v t N consists of nonbasic columns. Also, let f = [..., f j (t + p j ),...] T be the vector of the objective function coefficients. From linear programming theory, we have at optimality, [u T, v T ]B = f T. (16)
8 8 Yunpeng Pan, Leyuan Shi The row transformation involving consecutive periods t 1 and t can be written in matrix notation as I (t + n)th row, L t = (17) (t n)th row, I 2 where submatrices I 1 and I 2 are identity matrices. Similar to (16), the following also holds when optimality is attained for (TIS): [u T, v T ]L 1... L T 1 B = f T. (18) By comparing (16) and (18), we obtain [u T, v T ] = [u T, v T ]L 1... L T 1. (19) Using (12), (17), and (19), the original dual variable values can be computed as u j = u j/p j = u j /p j, j = 1,..., n, and (20) { v t = v t v = t v t+1, t = 0,..., T 2, v t, t = T 1. (21) This sparse reformulation is actually quite effective. For a processing time range of [1, 100], we are now able to solve problems with n = 40/50 within a few minutes and problems with n = 100 in less than an hour. Solving for optimal transportation costs c jt. Now suppose that optimal u and v values have been computed, taking into account (20) and (21). With u j and v t fixed, constraints (6) of (P1) reduce to lower bound constraints on the c jt variables. Any feasible vector c that satisfies (5) and the lower bound constraints, together with u and v, would optimally solve problem (P1). Hence, the task on hand is a trivial feasibility problem; e.g., one solution would be c jt u j + v t for all j, t. Moreover, we note that the interaction among jobs through the constraints are gone. Thus, we propose a further decomposition by job; this allows us to solve no more than n small feasibility problems instead of a very large one. Specifically, for each fixed j = 1,..., n, we consider a system of linear inequalities defined by t+p j 1 s=t c js f j (t + p j ), t = 0,..., T p j, (22) c jt u j + v t, t = 0,..., T 1. (23) Fixing of variables. Further savings can be achieved by noting that some of constraints (10) in problem (P1 ) hold at equality; i.e., for some t 0, t 0 +p j 1 p j u j + v s = f j (t 0 + p j ), s=t 0 which implies fixing of variables: c js u j +v s for all s = t 0,..., t 0 +p j 1. We can then drop the inequality in (22) that corresponds to t = t 0. Moreover, we show that at least one such t 0 exists. Consider variables y jt (t = 0,..., T p j )
9 Equivalence of max-min transportation bound and time-indexed bound 9 of (TI), which are the dual variables associated with constraints (22). Since at least one of these variables takes on a nonzero value, the existence of t 0 follows from complementarity. Ironically, this is perhaps one of the few occasions when we would wish that more of the decision variables y jt take on fractional values, thereby allowing more constraints to be dropped and more costs c jt to be fixed. Secondary considerations for choosing c jt. The u and v that we have computed, together with any c satisfying (22) (23), would attain the timeindexed bound. Therefore, the choice of c among all qualified choices does not change the lower bound for the root. However, this choice will affect bound quality at other nodes, since c is not re-optimized. This motivates secondary considerations in choosing c. The intuition behind our secondary criterion is to make the transportation costs as large as possible. It is then reasonable to require the following property be satisfied by a criterion: Property 1 No c jt1 can be increased without some other c jt2 being decreased. Here we propose a criterion that minimizes the total difference between the two sides of constraints (22), which clearly satisfies Property 1. More precisely, we minimize [ T p j f j (t + p j ) ] t+p j 1 s=t c js subject to (22) (23). 3.2 Subsequent nodes When a lower bound needs to be evaluated at a node other than the root, we solve a transportation problem of the form (P(c)) with the optimal cost structure found at the root. The transportation problem is solved using an algorithm proposed in [19], which is a specialized O(n 2 T ) adaptation of the Hungarian method [15]. We refer to [19] for issues regarding warm start and early termination of the algorithm. The optimal transportation costs for the root are not necessarily optimal for the other nodes, but rather are an approximation. The other nodes represent subproblems of which schedules are partially determined. On the other hand, the transportation costs can still be used to compute valid lower bounds. Moreover, such lower bounds are most likely to be fairly good approximations of the time-indexed bounds when the subproblems do not deviate too much from the original problem. In other words, lower bounds should be tight for nodes that are not very deep in the tree, where effective pruning has the greatest impact. Although we do not re-optimize the transportation costs, some simple improvements can be carried out. Let J = {1,..., n} be the original set of jobs to be scheduled. Suppose that some jobs are already scheduled at a node other than the root and that the set of unscheduled jobs is J J. Also, suppose that for each j J, the feasible processing window is now narrowed to [a j, b j ] [0, T ]. For job j J, (5) is satisfied over time window [0, T ]; therefore, (5) is obviously satisfied over time window [a j, b j ]. This ensures the validity of the lower bound. However, Property 1 may not hold with respect to the narrower time window. We give a heuristic for the adjustment of c jt (t [a j, b j ]) so that Property 1 is restored. The heuristic increases c jt for each j J and for each period t = b j 1,..., a j in a greedy fashion.
10 10 Yunpeng Pan, Leyuan Shi (a) normal situation (b) pathological situation Fig. 1 Comparison of max-min transportation bound and time-indexed bound 3.3 Effect of node depth on bound quality Normally, the quality of the lower bound improves as branch-and-bound explores deep into the tree. Our lower bound behaves somewhat differently. At a node other than the root, it approximates the time-indexed bound. As the search goes deeper and deeper into the tree, the transportation costs c jt deviate further and further from the optimal costs for the individual nodes. Therefore, the quality of this approximation deteriorates and may reach a point where the tree size is noticeably enlarged. We further illustrate this phenomenon using two numerical examples of 40-job total weighted tardiness problems (denoted by 1 w j T j in the scheduling literature). In the two examples, we assume that positional branching is used; therefore, the depth of a node is measured by the number of jobs fixed. In Figure 1(a) (b), the horizontal axis indicates a certain depth of the tree, and the vertical axis shows the node count at this depth (the number of nodes that cannot be fathomed). To eliminate the influence of the upper bound, we initially set it to the known optimal value. In the legend, TI and MMT refer to the curves for the time-indexed bound and for our max-min transportation bound, respectively. In both Figure 1(a) and (b), it can be seen that our bound approximates the time-indexed bound fairly well until around 20 jobs are fixed. After that, our bound deviates noticeably from the time-indexed bound, as indicated by the larger node counts. All the node counts eventually come down when nearly all jobs are fixed. There is also an important distinction between (a) and (b). The degradation of the transportation lower bound and its effect seen in (a) are reasonable; the node count curve for MMT follows an up-and-down pattern similar to that for TI. In comparison, the situation in (b) indicates poor approximation of the time-indexed bound by our bound when roughly n > 20. We develop two methods for alleviating such pathological occurrences. First, we may recompute c jt from time to time as the search progresses. But, recomputation cannot be too frequent, since that would conflict with our initial intention to approximate the hard LP by the easy transportation problem. A second method is to employ one or more combinatorial lower bounds in conjunction with our lower bound, provided that such bounds can be derived. The running time of a combinatorial lower bound is typically negligible, while the quality may not be satisfactory. However, it seems that some
11 Equivalence of max-min transportation bound and time-indexed bound 11 combinatorial lower bounds can compliment our lower bound. For example, we have observed that the pathological behavior occurs mostly on instances of 1 w j T j that are considered to be easy for a combinatorial lower bound in [17]. Further, we note that the pathological behavior tends to occur when initial lower bounds are poor, but nodes can be fathomed effectively using problem-specific dominance rules or general-purpose dynamic programming dominance techniques. The curves (MMT/DPD) in Figure 1(a) (b) show the effectiveness of a partial dynamic programming (PDP) dominance technique [16] in helping tame the erratic tree growth when it is used alongside MMT. The solution time is relatively small for this type of instance. In our experiments, we encountered few occasions when time-consuming measures like recomputing the transportation costs are justified. 4 Branch-and-bound algorithms for 1 w j T j We incorporate the max-min transportation lower bound in a branch-andbound algorithm to solve the problem 1 w j T j, which is unary N P-hard. Now the job cost function takes the form f j (t j ) = w j max{0, t j d j }, where d j is a given due date. 4.1 Algorithms Our proposed lower bound (MMT) and three previous bounds are wrapped in a branch-and-bound framework presented in [1] and then compared computationally. The three existing bounds are the time-indexed LP bound (TI), Potts and Van Wassenhove s combinatorial bound (PVW) [17], and Lawler s transportation lower bound (LT) with the costs c jt determined in accordance with (1) and the free variable values defined as c jt = 0, t = 0,..., p 2; c jt = c j(t pj ) + f j (t + 1) f j (t), t = p 1,..., T 1 (for all j). By varying the configuration of branch-and-bound, we obtain a number of different algorithms that are meant to reveal various characteristics of the lower bounds. All the algorithms use a standard positional node representation and branching scheme. The strategy for selecting a node to branch on is a new variation of the depth-first strategy: When more than one node have the same lower bound, select the node whose most recently fixed job has a due date that is closest to the due date of the job occupying the same position in the incumbent solution. In addition to the upper bound heuristics discussed in [1], we also compute the best-α schedule [10] and improve upon it using the standard adjacent pairwise interchange heuristic. The algorithms were coded in C++ and tested on a Pentium IV 2.8 GHz Linux PC with 1 GB RAM. LPs are solved with QSopt. 4.2 Experimental design We consider four sets of instances. Let us begin with the last set, which is taken from OR-Library. There are three control parameters in the process of
12 12 Yunpeng Pan, Leyuan Shi Table 1 Lower bound quality at root node (p max = 100) n TF g avg P V W g max P V W g avg LT g max LT g avg MMT g max MMT generating these instances: n {40, 50, 100}, RDD {0.2, 0.4, 0.6, 0.8, 1.0}, and T F {0.2, 0.4, 0.6, 0.8, 1.0}. There are 5 instances for each combination of the values. All the 40/50-job instances can be solved optimally using the algorithm in [1] that employs PVW [17]. According to [11], there were no attempts to solve the 100-job instances, since CPU times were expected to be prohibitively large. We derived the other three sets of instances from the above instances through time scaling. Let SF be a scaling factor. For each of the 375 instances with p j U[1, 100] for all j, we modify the instance by setting p j p j /SF and d j d j /SF. The other input of an instance stays unchanged. The above set of instances corresponds to the case where SF = 1. Via this scheme, three more sets of instances were obtained with SF = 10, 5, 2. Thus, the processing time ranges, [1, p max ], p max = 10, 20, 50, 100, are all represented. 4.3 Results Our initial set of experiments was designed to evaluate the relative strength of MMT in relation to the other bounds. Let z be the optimal value and let z LB be a lower bound. Then, the percentage gap is defined as g LB = (z z LB )/z 100 if z > 0. Instances with z = 0 are trivial; in that event, we define g LB = 0. g avg LB and gmax LB stand for the average and maximum values. We first compare the quality of PVW, LT, and MMT at the root. TI and MMT are equal at the root. The fourth test set (p max = 100) is used in this experiment. For the same combination (n, T F ) we report g avg LB and glb max computed over 25 instances. TF is the dominant factor governing the difficulty of instances of the same n. In Table 1, g avg MMT never exceeds 2%. Large gmmt max values are observed for T F = 0.4 across all n. Nevertheless, the instances with T F = 0.4 are actually easy, despite large initial gaps. Next, we examine the quality of LT, MMT, and TI as search progresses. We take the tree size generated by each lower bound as an indicator of bound strength. In this experiment, each lower bound was used independently, and
13 Equivalence of max-min transportation bound and time-indexed bound 13 Table 2 Tree sizes of using a single lower bound (n = 40, p max = 10) RDD TF n avg LT n max LT n avg MMT n max MMT n avg T I n max T I ,369 5, ,483 1, ,142 10, ,418 2, ,718 10, ,087 34, ,455 10, ,863 46, ,721 15, ,752 47, ,347 1,082, , , ,326 7, all pruning devices were turned off except trivial ones. The initial upper bound was set to the optimal value. The set of instances with (n = 40, p max = 10) is used since it is impractical for TI to deal with larger problems. Also, results for PVW were omitted because its tree size is orders of magnitude larger. In Table 2, n avg LB and nmax LB denote the average and maximum numbers of nodes in the tree for lower bound LB. We can see that MMT generates markedly fewer nodes than LT. The extent of reduction is most spectacular in the parameter range 0.6 RDD 1, 0.6 T F 1. Within the same range, MMT generates 2 4 times more nodes than TI. This is a strong indication that on average MMT is a fairly good approximation of TI. The results thus far indicate that the max-min transportation lower bound can be effectively used in branch-and-bound in a stand-alone manner. The idea of re-using optimal transportation cost structure found at the root node is indeed viable computationally. Now we present a specialized algorithm that employs the best combination of MMT and other existing techniques. Results on the fourth (and the most difficult) set of instances are reported. In Table 3, the CPU times in seconds required by the algorithm are denoted by t avg and t max, and further broken down into t avg 2 and t max 2 after the root node times have been subtracted. n avg and n max are the node counts. NO shows the numbers of instances (out of 25) solved optimally. Within the 4-hour per instance time limit, our algorithm solved to optimality all but one of the 125 open instances with 100 jobs. The remaining instance (#44) was also solved optimally after
14 14 Yunpeng Pan, Leyuan Shi Table 3 CPU time and node counts of specialized algorithm (p max = 100) n TF NO t avg t max t avg 2 t max 2 n avg n max hours of computation. It turns out that for all these instances, their best known upper bounds are in fact optimal. Additionally, in our other experiments, we found that the proposed bound demonstrates good scalability with increase of n and p max. 5 Conclusion We presented new results as to finding the strongest bound from the family of lower bounds provided by transportation problem relaxations of the singlemachine scheduling problem. As an application of the theory, we proposed a new scheme to approximate the time-indexed bound during branch-andbound. The theory behind our results should bring due attention to the study of the LP dual problem (P1 ) associated with (TI) the LP relaxation of the time-indexed formulation. (P1 ) is related to the transportation problem (P(c)) via (P1). An immediate impact of recognizing these relations has been unambiguously illustrated through our computational results. The proposed lower bound is based on the family of transportation problem relaxations. Interestingly, an alternative assignment problem relaxation has been suggested in [20], where constraints (1) of (P(c)) are replaced by (T s)/pj k=0 x j(s+kpj) = 1, j = 1,..., n; s = 0,..., p j 1. This relaxation is at least as strong as (P(c)) because the above constraints imply (1). Our lower bound idea can again be applied while condition (5) is imposed as before. We find that it is counter-intuitive, but nevertheless true, that the resulting bound is also equal to the time-indexed lower bound. Some issues are yet to be fully explored. First, we should be able to speed up the root node computation. A second issue aries from the fact that more than one set of optimal (u, v, c) can attain the same lower bound at the root. This issue has been partially addressed, but needs to be further examined. In parallel with our work, there are other efforts to leverage the bound quality of the time-indexed formulation while reducing its computational expense. For example, Bigras et al. [8] suggest temporal decomposition for the column
15 Equivalence of max-min transportation bound and time-indexed bound 15 generation algorithm for (TI). On a similar computer, they were able to solve 89 of the 125 open instances within a 12-hour time limit per instance. We are looking into incorporating the idea in our method. Acknowledgements The authors would like to thank Professor Jünger for pointing out the alternative assignment formulation, the associated editor for the encouraging comments, and two anonymous referees for their helpful suggestions. References 1. Abdul-Razaq, T.S., Potts, C.N., van Wassenhove, L.N.: A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Appl. Math. 26, (1990) 2. van den Akker, J.M., van Hoesel, C.P.M., Savelsbergh, M.W.P.: A polyhedral approach to single-machine scheduling problems. Math. Program. 85, (1999) 3. van den Akker, J.M., Hurkens, C.A.J., Savelsbergh, M.W.P.: Time-indexed formulations for machine scheduling problems: Column generation. INFORMS J. Comput. 12(2), (2000) 4. Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3, (1991) 5. Avella, P., Boccia, M., D Auria, B.: Near-optimal solutions of large-scale singlemachine scheduling problems. INFORMS J. Comput. 17(2), (2005) 6. Balas, E.: Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res. 17, (1969) 7. Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3 51 (1979) 8. Bigras, L., Gamache, M., Savard, G.: Time-indexed formulations and the total weighted tardiness problem (2005). G , Les Cahiers du GERAD 9. Bülbül, K., Kaminsky, P., Yano, C.: Preemption in single machine earliness/tardiness scheduling. J. Sched. (2005). Revision under review 10. Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. SIAM J. Comput. 31, (2001) 11. Congram, R.K., Potts, C.N., van de Velde, S.L.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J. Comput. 13(1), (2002) 12. Dyer, M.E., Wolsey, L.A.: Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26, (1990) 13. Gelders, L., Kleindorfer, P.R.: Coordinnating aggregate and detailed scheduling in the one-machine job shop: Part I. Theory. Oper. Res. 22, (1974) 14. Lawler, E.L.: On scheduling problems with deferral costs. Management Sci. 11(2), (1964) 15. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, NY (1988) 16. Pan, Y.: An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Oper. Res. Lett. 31(6), (2003) 17. Potts, C.N., van Wassenhove, L.N.: A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33(2), (1985) 18. Queyranne, M., Schulz, A.S.: Polyhedral approaches to machine scheduling. Preprint 408/1994, Math. Dept., Tech. Univ. Berlin (1994). Revised June Sourd, F., Kedad-Sidhoum, S.: The one-machine problem with earliness and tardiness penalties. J. Sched. 6, (2003) 20. Sousa, J.P.: Time indexed formulations of non-preemptive single-machine scheduling problems. Ph.D. thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1989) 21. Sousa, J.P., Wolsey, L.A.: A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54, (1992)
On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
Math. Program., Ser. A (2007) 110:543 559 DOI 10.1007/s10107-006-0013-4 FULL LENGTH PAPER On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine
More informationFinding the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling
1 Finding the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling Yunpeng Pan and Leyuan Shi Abstract We identify the best root node strategy for the approximation
More informationA combinatorial auctions perspective on min-sum scheduling problems
Yunpeng Pan A combinatorial auctions perspective on min-sum scheduling problems Abstract In combinatorial auctions, prospective buyers bid on bundles of items for sale, including but not limited to singleton
More informationA new lower bound for one-machine earliness-tardiness scheduling
A new lower bound for one-machine earliness-tardiness scheduling Francis Sourd Université Pierre et Marie Curie CNRS LIP6 laboratory, Paris, France e-mail: Francis.Sourd@lip6.fr Abstract In one-machine
More informationSingle Machine Scheduling: Comparison of MIP Formulations and Heuristics for. Interfering Job Sets. Ketan Khowala
Single Machine Scheduling: Comparison of MIP Formulations and Heuristics for Interfering Job Sets by Ketan Khowala A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor
More informationAn Exact Algorithm for the Single-Machine Earliness Tardiness Scheduling Problem
Chapter 2 An Exact Algorithm for the Single-Machine Earliness Tardiness Scheduling Problem Shunji Tanaka Abstract This paper introduces our exact algorithm for the single-machine total weighted earliness
More informationOn the Approximate Linear Programming Approach for Network Revenue Management Problems
On the Approximate Linear Programming Approach for Network Revenue Management Problems Chaoxu Tong School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853,
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationOn the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times
CORE DISCUSSION PAPER 2000/52 On the Polyhedral Structure of a Multi Item Production Planning Model with Setup Times Andrew J. Miller 1, George L. Nemhauser 2, and Martin W.P. Savelsbergh 2 November 2000
More informationMinimizing total weighted tardiness on a single machine with release dates and equal-length jobs
Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs G. Diepen J.M. van den Akker J.A. Hoogeveen institute of information and computing sciences, utrecht university
More informationMarjan van den Akker. Han Hoogeveen Jules van Kempen
Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines, and/or generalized precedence constraints Marjan van den Akker Han Hoogeveen Jules van Kempen
More informationA big bucket time indexed formulation for nonpreemptive single machine scheduling problems
A big bucket time indexed formulation for nonpreemptive single machine scheduling problems Natashia Boland Riley Clement Hamish Waterer Centre for Optimal Planning and Operations University of Newcastle
More informationA dynamic programming algorithm for single machine scheduling with ready times
Annals of Operations Research 69(1997)135 156 135 A dynamic programming algorithm for single machine scheduling with ready times Sylvie Gélinas and François Soumis GERAD and École Polytechnique de Montréal,
More informationUsing column generation to solve parallel machine scheduling problems with minmax objective functions
Using column generation to solve parallel machine scheduling problems with minmax objective functions J.M. van den Akker J.A. Hoogeveen Department of Information and Computing Sciences Utrecht University
More informationColumn Generation for Extended Formulations
1 / 28 Column Generation for Extended Formulations Ruslan Sadykov 1 François Vanderbeck 2,1 1 INRIA Bordeaux Sud-Ouest, France 2 University Bordeaux I, France ISMP 2012 Berlin, August 23 2 / 28 Contents
More informationAn Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse
An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse Yongjia Song, James Luedtke Virginia Commonwealth University, Richmond, VA, ysong3@vcu.edu University
More informationCombinatorial 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 informationFixed-charge transportation problems on trees
Fixed-charge transportation problems on trees Gustavo Angulo * Mathieu Van Vyve * gustavo.angulo@uclouvain.be mathieu.vanvyve@uclouvain.be November 23, 2015 Abstract We consider a class of fixed-charge
More informationA Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates
A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates Philippe Baptiste 1,2, Jacques Carlier 2 and Antoine Jouglet 2 Abstract In this paper, we present a
More informationAn Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling Problems
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 An Integrated Column Generation and Lagrangian Relaxation for Flowshop Scheduling
More informationUsing column generation to solve parallel machine scheduling problems with minmax objective functions
J Sched (2012) 15:801 810 DOI 10.1007/s10951-010-0191-z Using column generation to solve parallel machine scheduling problems with minmax objective functions J.M. van den Akker J.A. Hoogeveen J.W. van
More informationMonoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctions and Complementarity Constraints
Monoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctions and Complementarity Constraints Tobias Fischer and Marc E. Pfetsch Department of Mathematics, TU Darmstadt, Germany {tfischer,pfetsch}@opt.tu-darmstadt.de
More informationA Global Constraint for Total Weighted Completion Time for Unary Resources
A Global Constraint for Total Weighted Completion Time for Unary Resources András Kovács Computer and Automation Research Institute Hungarian Academy of Sciences akovacs@sztaki.hu J. Christopher Beck Department
More informationAn exact approach to early/tardy scheduling with release dates
Computers & Operations Research 32 (2005) 2905 2917 www.elsevier.com/locate/dsw An exact approach to early/tardy scheduling with release dates Jorge M.S. Valente, Rui A.F.S. Alves Faculdade de Economia,
More informationAn Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory
An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory by Troels Martin Range Discussion Papers on Business and Economics No. 10/2006 FURTHER INFORMATION Department of Business
More informationLagrangian Domain Reductions for the Single Machine Earliness-Tardiness Problem with Release Dates
Lagrangian Domain Reductions for the Single Machine Earliness-Tardiness Problem with Release Dates Boris Detienne a, Éric Pinsonb and David Rivreau b a École Nationale Supérieure des Mines de Saint-Étienne,
More informationIE418 Integer Programming
IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 2nd February 2005 Boring Stuff Extra Linux Class: 8AM 11AM, Wednesday February 9. Room??? Accounts and Passwords
More informationarxiv: v1 [cs.cc] 5 Dec 2018
Consistency for 0 1 Programming Danial Davarnia 1 and J. N. Hooker 2 1 Iowa state University davarnia@iastate.edu 2 Carnegie Mellon University jh38@andrew.cmu.edu arxiv:1812.02215v1 [cs.cc] 5 Dec 2018
More information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More informationStabilized Branch-and-cut-and-price for the Generalized Assignment Problem
Stabilized Branch-and-cut-and-price for the Generalized Assignment Problem Alexandre Pigatti, Marcus Poggi de Aragão Departamento de Informática, PUC do Rio de Janeiro {apigatti, poggi}@inf.puc-rio.br
More informationExact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
Math. Prog. Comp. (2010) 2:259 290 DOI 10.1007/s12532-010-0019-z FULL LENGTH PAPER Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems Artur Pessoa Eduardo Uchoa
More informationInteger Programming Formulations for the Minimum Weighted Maximal Matching Problem
Optimization Letters manuscript No. (will be inserted by the editor) Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem Z. Caner Taşkın Tınaz Ekim Received: date / Accepted:
More informationPractical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk
Decision Making in Manufacturing and Services Vol. 3 2009 No. 1 2 pp. 37 48 Practical Tips for Modelling Lot-Sizing and Scheduling Problems Waldemar Kaczmarczyk Abstract. This paper presents some important
More informationA 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 informationTime Aggregation for Network Design to Meet Time-Constrained Demand
20th International Congress on Modelling and Simulation, Adelaide, Australia, 1 6 December 2013 www.mssanz.org.au/modsim2013 Time Aggregation for Network Design to Meet Time-Constrained Demand N. Boland
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationA 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 informationCMSC 722, AI Planning. Planning and Scheduling
CMSC 722, AI Planning Planning and Scheduling Dana S. Nau University of Maryland 1:26 PM April 24, 2012 1 Scheduling Given: actions to perform set of resources to use time constraints» e.g., the ones computed
More informationPreemption in Single Machine Earliness/Tardiness Scheduling
Preemption in Single Machine Earliness/Tardiness Scheduling Kerem Bülbül Philip Kaminsky Candace Yano Industrial Engineering and Operations Research University of California, Berkeley, CA October 001 Abstract
More informationParallel PIPS-SBB Multi-level parallelism for 2-stage SMIPS. Lluís-Miquel Munguia, Geoffrey M. Oxberry, Deepak Rajan, Yuji Shinano
Parallel PIPS-SBB Multi-level parallelism for 2-stage SMIPS Lluís-Miquel Munguia, Geoffrey M. Oxberry, Deepak Rajan, Yuji Shinano ... Our contribution PIPS-PSBB*: Multi-level parallelism for Stochastic
More informationOutline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lagrangian Relaxation Lecture 12 Single Machine Models, Column Generation 2. Dantzig-Wolfe Decomposition Dantzig-Wolfe Decomposition Delayed Column
More informationAn Exact Extended Formulation for the Unrelated Parallel Machine Total Weighted Completion Time Problem
SABANCI UNIVERSITY Orhanlı-Tuzla, 34956 Istanbul, Turkey Phone:+9 216) 483-95 Fax:+9 216) 483-955 http://www.sabanciuniv.edu March 9, 16 Abstract: An Exact Extended Formulation for the Unrelated Parallel
More informationExponential neighborhood search for a parallel machine scheduling problem
xponential neighborhood search for a parallel machine scheduling problem Y.A. Rios Solis and F. Sourd LIP6 - Université Pierre et Marie Curie 4 Place Jussieu, 75252 Paris Cedex 05, France Abstract We consider
More informationInference of A Minimum Size Boolean Function by Using A New Efficient Branch-and-Bound Approach From Examples
Published in: Journal of Global Optimization, 5, pp. 69-9, 199. Inference of A Minimum Size Boolean Function by Using A New Efficient Branch-and-Bound Approach From Examples Evangelos Triantaphyllou Assistant
More informationA Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
2558 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 48, NO 9, SEPTEMBER 2002 A Generalized Uncertainty Principle Sparse Representation in Pairs of Bases Michael Elad Alfred M Bruckstein Abstract An elementary
More informationMINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING
Journal of the Operations Research Society of Japan Vol. 39, No. 3, September 1996 1996 The Operations Research Society of Japan MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING Tsung-Chyan Lai
More informationSOME RESOURCE ALLOCATION PROBLEMS
SOME RESOURCE ALLOCATION PROBLEMS A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
More informationis called an integer programming (IP) problem. model is called a mixed integer programming (MIP)
INTEGER PROGRAMMING Integer Programming g In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More informationLinear Programming: Simplex
Linear Programming: Simplex Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Linear Programming: Simplex IMA, August 2016
More informationSEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE VERY LARGE INSTANCES
SEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE VERY LARGE INSTANCES PH. BAPTISTE, F. DELLA CROCE, A. GROSSO, AND V. T KINDT Abstract. We consider the problem of
More informationSection Notes 8. Integer Programming II. Applied Math 121. Week of April 5, expand your knowledge of big M s and logical constraints.
Section Notes 8 Integer Programming II Applied Math 121 Week of April 5, 2010 Goals for the week understand IP relaxations be able to determine the relative strength of formulations understand the branch
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationCS6999 Probabilistic Methods in Integer Programming Randomized Rounding Andrew D. Smith April 2003
CS6999 Probabilistic Methods in Integer Programming Randomized Rounding April 2003 Overview 2 Background Randomized Rounding Handling Feasibility Derandomization Advanced Techniques Integer Programming
More informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
More informationLinear Programming Redux
Linear Programming Redux Jim Bremer May 12, 2008 The purpose of these notes is to review the basics of linear programming and the simplex method in a clear, concise, and comprehensive way. The book contains
More informationLifting for conic mixed-integer programming
Math. Program., Ser. A DOI 1.17/s117-9-282-9 FULL LENGTH PAPER Lifting for conic mixed-integer programming Alper Atamtürk Vishnu Narayanan Received: 13 March 28 / Accepted: 28 January 29 The Author(s)
More informationColumn Generation in Integer Programming with Applications in Multicriteria Optimization
Column Generation in Integer Programming with Applications in Multicriteria Optimization Matthias Ehrgott Department of Engineering Science The University of Auckland, New Zealand email: m.ehrgott@auckland.ac.nz
More information4 Sequencing problem with heads and tails
4 Sequencing problem with heads and tails In what follows, we take a step towards multiple stage problems Therefore, we consider a single stage where a scheduling sequence has to be determined but each
More informationSanta Claus Schedules Jobs on Unrelated Machines
Santa Claus Schedules Jobs on Unrelated Machines Ola Svensson (osven@kth.se) Royal Institute of Technology - KTH Stockholm, Sweden March 22, 2011 arxiv:1011.1168v2 [cs.ds] 21 Mar 2011 Abstract One of the
More informationOn Counting Lattice Points and Chvátal-Gomory Cutting Planes
On Counting Lattice Points and Chvátal-Gomory Cutting Planes Andrea Lodi 1, Gilles Pesant 2, and Louis-Martin Rousseau 2 1 DEIS, Università di Bologna - andrea.lodi@unibo.it 2 CIRRELT, École Polytechnique
More informationwhere X is the feasible region, i.e., the set of the feasible solutions.
3.5 Branch and Bound Consider a generic Discrete Optimization problem (P) z = max{c(x) : x X }, where X is the feasible region, i.e., the set of the feasible solutions. Branch and Bound is a general semi-enumerative
More informationScheduling of Frame-based Embedded Systems with Rechargeable Batteries
Scheduling of Frame-based Embedded Systems with Rechargeable Batteries André Allavena Computer Science Department Cornell University Ithaca, NY 14853 andre@cs.cornell.edu Daniel Mossé Department of Computer
More informationSingle 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 informationThe Modified Integer Round-Up Property of the One-Dimensional Cutting Stock Problem
EJOR 84 (1995) 562 571 The Modified Integer Round-Up Property of the One-Dimensional Cutting Stock Problem Guntram Scheithauer and Johannes Terno Institute of Numerical Mathematics, Dresden University
More informationFundamental Domains for Integer Programs with Symmetries
Fundamental Domains for Integer Programs with Symmetries Eric J. Friedman Cornell University, Ithaca, NY 14850, ejf27@cornell.edu, WWW home page: http://www.people.cornell.edu/pages/ejf27/ Abstract. We
More informationA BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY
APPLICATIONES MATHEMATICAE 23,2 (1995), pp. 151 167 G. SCHEITHAUER and J. TERNO (Dresden) A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY Abstract. Many numerical computations
More informationOptimization under Ordinal Scales: When is a Greedy Solution Optimal?
Optimization under Ordinal Scales: When is a Greedy Solution Optimal? Aleksandar Pekeč BRICS Department of Computer Science University of Aarhus DK-8000 Aarhus C, Denmark pekec@brics.dk Abstract Mathematical
More informationSolving LP and MIP Models with Piecewise Linear Objective Functions
Solving LP and MIP Models with Piecewise Linear Obective Functions Zonghao Gu Gurobi Optimization Inc. Columbus, July 23, 2014 Overview } Introduction } Piecewise linear (PWL) function Convex and convex
More informationExtended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications
Extended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications François Vanderbeck University of Bordeaux INRIA Bordeaux-Sud-Ouest part : Defining Extended Formulations
More informationStrengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse Merve Bodur 1, Sanjeeb Dash 2, Otay Günlü 2, and James Luedte 3 1 Department of Mechanical and Industrial Engineering,
More informationOffice of Naval Research contract no. N K-0377 (9) FINAL TECHNICAL REPORT
Office of Naval Research contract no. N00014-88-K-0377 (9) The Concept of Best Probability in the Analysis of Approximation Algorithms 0) - Dorit S. Hochbaum, Principal Investigator oom FINAL TECHNICAL
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationDistributed Optimization. Song Chong EE, KAIST
Distributed Optimization Song Chong EE, KAIST songchong@kaist.edu Dynamic Programming for Path Planning A path-planning problem consists of a weighted directed graph with a set of n nodes N, directed links
More informationSolving Dual Problems
Lecture 20 Solving Dual Problems We consider a constrained problem where, in addition to the constraint set X, there are also inequality and linear equality constraints. Specifically the minimization problem
More informationA Hub Location Problem with Fully Interconnected Backbone and Access Networks
A Hub Location Problem with Fully Interconnected Backbone and Access Networks Tommy Thomadsen Informatics and Mathematical Modelling Technical University of Denmark 2800 Kgs. Lyngby Denmark tt@imm.dtu.dk
More informationInteger Programming ISE 418. Lecture 16. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 16 Dr. Ted Ralphs ISE 418 Lecture 16 1 Reading for This Lecture Wolsey, Chapters 10 and 11 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.3.7, II.5.4 CCZ Chapter 8
More informationDiscrete lot sizing and scheduling on parallel machines: description of a column generation approach
126 IO 2013 XVI Congresso da Associação Portuguesa de Investigação Operacional Discrete lot sizing and scheduling on parallel machines: description of a column generation approach António J.S.T. Duarte,
More informationSMO vs PDCO for SVM: Sequential Minimal Optimization vs Primal-Dual interior method for Convex Objectives for Support Vector Machines
vs for SVM: Sequential Minimal Optimization vs Primal-Dual interior method for Convex Objectives for Support Vector Machines Ding Ma Michael Saunders Working paper, January 5 Introduction In machine learning,
More informationA column generation approach to the discrete lot sizing and scheduling problem on parallel machines
A column generation approach to the discrete lot sizing and scheduling problem on parallel machines António J.S.T. Duarte and J.M.V. Valério de Carvalho Abstract In this work, we study the discrete lot
More informationSingle-Facility Scheduling by Logic-Based Benders Decomposition
Single-Facility Scheduling by Logic-Based Benders Decomposition Elvin Coban J. N. Hooker Tepper School of Business Carnegie Mellon University ecoban@andrew.cmu.edu john@hooker.tepper.cmu.edu September
More informationR u t c o r Research R e p o r t. A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS.
R u t c o r Research R e p o r t A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS Navid Hashemian a Béla Vizvári b RRR 12-08, September 2008 RUTCOR Rutgers Center
More informationIndicator Constraints in Mixed-Integer Programming
Indicator Constraints in Mixed-Integer Programming Andrea Lodi University of Bologna, Italy - andrea.lodi@unibo.it Amaya Nogales-Gómez, Universidad de Sevilla, Spain Pietro Belotti, FICO, UK Matteo Fischetti,
More informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
More informationIntroduction to optimization and operations research
Introduction to optimization and operations research David Pisinger, Fall 2002 1 Smoked ham (Chvatal 1.6, adapted from Greene et al. (1957)) A meat packing plant produces 480 hams, 400 pork bellies, and
More informationLinear Programming. Scheduling problems
Linear Programming Scheduling problems Linear programming (LP) ( )., 1, for 0 min 1 1 1 1 1 11 1 1 n i x b x a x a b x a x a x c x c x z i m n mn m n n n n! = + + + + + + = Extreme points x ={x 1,,x n
More informationBounds for the Permutation Flowshop Scheduling Problem with Exact Time Lags while Minimizing the Total Earliness and Tardiness
Bounds for the Permutation Flowshop Scheduling Problem with Exact Time Lags while Minimizing the Total Earliness and Tardiness Imen Hamdi, Taïcir Loukil Abstract- We consider the problem of n-jobs scheduling
More informationStochastic programs with binary distributions: Structural properties of scenario trees and algorithms
INSTITUTT FOR FORETAKSØKONOMI DEPARTMENT OF BUSINESS AND MANAGEMENT SCIENCE FOR 12 2017 ISSN: 1500-4066 October 2017 Discussion paper Stochastic programs with binary distributions: Structural properties
More informationLecture 23 Branch-and-Bound Algorithm. November 3, 2009
Branch-and-Bound Algorithm November 3, 2009 Outline Lecture 23 Modeling aspect: Either-Or requirement Special ILPs: Totally unimodular matrices Branch-and-Bound Algorithm Underlying idea Terminology Formal
More informationA Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows
A Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows Philipp Hungerländer Christian Truden 5th January 2017 Abstract In this extended abstract we introduce the
More informationComputer Sciences Department
Computer Sciences Department Valid Inequalities for the Pooling Problem with Binary Variables Claudia D Ambrosio Jeff Linderoth James Luedtke Technical Report #682 November 200 Valid Inequalities for the
More informationMixed Integer Programming Solvers: from Where to Where. Andrea Lodi University of Bologna, Italy
Mixed Integer Programming Solvers: from Where to Where Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it November 30, 2011 @ Explanatory Workshop on Locational Analysis, Sevilla A. Lodi, MIP
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationSolution of the Train Platforming Problem
Solution of the Train Platforming Problem Alberto Caprara, Laura Galli, and Paolo Toth DEIS, University of Bologna Viale Risorgimento 2, 40136 Bologna, Italy {alberto.caprara,l.galli,paolo.toth}@unibo.it
More informationScenario Grouping and Decomposition Algorithms for Chance-constrained Programs
Scenario Grouping and Decomposition Algorithms for Chance-constrained Programs Siqian Shen Dept. of Industrial and Operations Engineering University of Michigan Joint work with Yan Deng (UMich, Google)
More informationColumn Generation. MTech Seminar Report. Soumitra Pal Roll No: under the guidance of
Column Generation MTech Seminar Report by Soumitra Pal Roll No: 05305015 under the guidance of Prof. A. G. Ranade Computer Science and Engineering IIT-Bombay a Department of Computer Science and Engineering
More informationarxiv: v1 [cs.ds] 31 Aug 2018
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines Arthur Kramer, Mauro Dell Amico, Manuel Iori Dipartimento di Scienze e Metodi dell Ingegneria Università
More informationCAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES
CAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES Nabil Absi,1 Safia Kedad-Sidhoum Laboratoire d Informatique d Avignon, 339 chemin des Meinajariès, 84911 Avignon Cedex 09, France
More informationSolving a Production Scheduling Problem as a Time-Dependent Traveling Salesman Problem
Solving a Production Scheduling Problem as a Time-Dependent Traveling Salesman Problem GABRIELLA STECCO Department of Applied Mathematics, University Ca Foscari of Venice, Dorsoduro n. 3825/E, 30123 Venice,
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationColumn Generation. ORLAB - Operations Research Laboratory. Stefano Gualandi. June 14, Politecnico di Milano, Italy
ORLAB - Operations Research Laboratory Politecnico di Milano, Italy June 14, 2011 Cutting Stock Problem (from wikipedia) Imagine that you work in a paper mill and you have a number of rolls of paper of
More information