The two-machine flowshop total completion time problem: A branch-and-bound based on network-flow formulation
|
|
- Abigail Berry
- 5 years ago
- Views:
Transcription
1 The two-machine flowshop total completion time problem: A branch-and-bound based on network-flow formulation Boris Detienne 1, Ruslan Sadykov 1, Shunji Tanaka 2 1 : Team Inria RealOpt, University of Bordeaux, France 2 : Department of Electrical Engineering, Kyoto University, Japan Multidisciplinary International Scheduling conference: Theory and Application MISTA 2015 August 25th, 2015 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 1 / 43
2 Outline 1 Introduction Problem description Literature Contribution 2 Lower bounds Network flow formulation Extended network flow formulation 3 Branch-and-bound 4 Numerical results B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 2 / 43
3 1 Introduction Problem description Literature Contribution 2 Lower bounds 3 Branch-and-bound 4 Numerical results B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 3 / 43
4 Two-machine flow-shop problem F2 ST SI C i Input data: A set I of n jobs composed of 2 operations The first operation is processed on machine 1, the second on machine 2 For all i I, s 2 i is the sequence-independent setup time on machine 2 Assumption: data are integer and deterministic Constraints Each machine can process only one operation at a time Operations of a same job cannot be processed simultaneously Objective Find a schedule that minimizes the sum of the completion times of the jobs on the second machine. B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 4 / 43
5 Example i p 1 i p 2 i s 2 i B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 5 / 43
6 Example i p 1 i p 2 i s 2 i B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 5 / 43
7 Example i p 1 i p 2 i s 2 i B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 5 / 43
8 Example i p 1 i p 2 i s 2 i B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 5 / 43
9 Example i p 1 i p 2 i s 2 i Cost of the schedule: = 40 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 5 / 43
10 Properties of the problem Complexity Strongly NP-hard [Conway et al., 1967] Dominating solutions There is a least one optimal schedule that is: active (operations are performed as soon as possible, no unforced idle time) such that the sequences of the jobs on both machines are the same (permutation schedule) [Conway et al., 1967, Allahverdi et al., 1999] The problem comes to find one optimal sequence of jobs. B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 6 / 43
11 Literature Lower bounds and exact algorithms L.B.: Single machine problems [Ignall and Schrage, 1965], [Ahmadi and Bagchi, 1990], [Della Croce et al., 1996], [Allahverdi, 2000] Branch-and-bound, up to 10, 15 and 30 jobs (p i 20), 20 jobs (p i 100) L.B.: Lagrangian relaxation of precedence constraints [van de Velde, 1990], [Della Croce et al, 2002], [Gharbi et al., 2013] Branch-and-bound, up to 20 and 45 jobs (p i 10) L.B.: linear relaxation of a positional/assignment model [Akkan and Karabati, 2004], [Hoogeven et al., 2006], [Haouari and Kharbeche, 2013], [Gharbi et al., 2013] : 35 jobs (p i 100) L.B.: Lagrangian relaxation of the job cardinality ctr., flow model [Akkan and Karabati, 2004] Branch-and-bound, up to 60 jobs (p i 10), 45 jobs (p i 100) B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 7 / 43
12 Contribution Branch-and-bound based on the network flow model of [Akkan and Karabati, 2004] Improvements Stronger lower bound by using a larger size network Advantages Stronger Lagrangian relaxation bound Allows integration of dominance rules inside the network Disadvantages (Too) high memory and CPU time requirements Reduction of the size of the network using Lagrangian cost variable fixing Extension to sequence-independent setup times B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 8 / 43
13 1 Introduction 2 Lower bounds Network flow formulation Extended network flow formulation 3 Branch-and-bound 4 Numerical results B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 9 / 43
14 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables L c k = C2 [k] C1 : time lag elapsed between the completion of the job in [k] position k on machine 1 and on machine 2 Total completion time B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 10 / 43
15 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables L c k = C2 [k] C1 : time lag elapsed between the completion of the job in [k] position k on machine 1 and on machine 2 Total completion time B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 10 / 43
16 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables L c k = C2 [k] C1 : time lag elapsed between the completion of the job in [k] position k on machine 1 and on machine 2 Total completion time B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 10 / 43
17 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables L c k = C2 [k] C1 : time lag elapsed between the completion of the job in [k] position k on machine 1 and on machine 2 Total completion time B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 10 / 43
18 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables L c k = C2 [k] C1 : time lag elapsed between the completion of the job in [k] position k on machine 1 and on machine 2 Total completion time 3p Lc 1 2p Lc 2 p Lc 3 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 10 / 43
19 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables L c k = C2 [k] C1 : time lag elapsed between the completion of the job in [k] position k on machine 1 and on machine 2 Total completion time 3p Lc 1 2p Lc 2 p Lc 3 n k=1 C2 [k] = n k=1 (n k + 1)p 1 [k] + Lc k B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 11 / 43
20 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables Recursive formula for lag: L c k 0, = max L c k 1 + s2 [k] p1 + p 2 [k] [k] Total completion time 3p Lc 1 2p Lc 2 p Lc 3 n k=1 C2 [k] = n k=1 (n k + 1)p 1 [k] + Lc k B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 11 / 43
21 Network flow formulation [Akkan et Karabati, 2004] Lag-based models The contribution of a job to the objective function only depends on: Its position in the sequence Its lag, which is directly deduced from the lag of the preceding job Structure of the network One node a pair (position, lag) One arc the processing of a job initial node determines the position terminal node determines the lag The cost of an arc is the corresponding contribution to the objective function B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 12 / 43
22 Network flow formulation [Akkan et Karabati, 2004]: G 1 p 1 = (10, 7); p 2 = (7, 3); p 3 = (1, 3) l = 3 cost= = 24 l = 3 l = 3 1 l = 5 cost=6 cost=37 l = 7 l = 5 2 l = 7 2 l = 7 l = 9 l = 9 l = 11 k = 0 k = 1 k = 2 k = 3 k = 4 Shortest path + Each job is processed exactly once B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 13 / 43
23 Network flow formulation [Akkan et Karabati, 2004]: G 1 p 1 = (10, 7); p 2 = (7, 3); p 3 = (1, 3) l = 3 cost= = 24 l = 3 l = 3 1 l = 5 cost=6 cost=37 l = 7 l = 5 2 l = 7 2 l = 7 l = 9 l = 9 l = 11 k = 0 k = 1 k = 2 k = 3 k = 4 Shortest path + Each job is processed once L.B. by Lagrangian relaxation B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 13 / 43
24 Network flow formulation [Akkan et Karabati, 2004]: G 1 Disadvantage: many infeasible paths "weak" lower bound l = 3 l = 3 l = 3 1 l = 5 l = 7 l = 5 l = l = 7 l = 9 l = 9 l = 11 k = 0 k = 1 k = 2 k = 3 k = 4 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 14 / 43
25 Extended network flow formulation: G 2 Structure of the network One node a triplet (position, lag, job) One arc the processing of a job initial node determines the position and the job terminal node determines the lag and the next job The cost of an arc is the corresponding contribution to the objective function B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 15 / 43
26 Extended network G 2 l = 7 l = 7 l = 7 l = 3 J3 l = 3 l = 3 k = 0 k = 1 k = 2 k = 3 k = 4 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 16 / 43
27 Extended network G 2 - Example of reduction l = 7 l = 7 l = 7 l = 3 J3 l = 3 l = 3 k = 0 k = 1 k = 2 k = 3 k = 4 Jobs cannot be processed twice consecutively B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 17 / 43
28 Extended network G 2 - Example of reduction l = 7 l = 7 l = 3 l = 3 l = 3 k = 0 k = 1 k = 2 k = 3 k = 4 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 18 / 43
29 Extended network G 2 - Example of reduction l = 7 l = 7 l = 3 l = 3 l = 3 k = 0 k = 1 k = 2 k = 3 k = 4 If p 1 i + s2 j p 1 j + s2 i, p2 i + s2 i p 2 j + s2 j, and p2 j p 2 i, then i j [Allahverdi, 2000] B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 19 / 43
30 Extended network G 2 - Example of reduction l = 7 l = 3 l = 3 k = 0 k = 1 k = 2 k = 3 k = 4 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 20 / 43
31 Extended network G 2 - Example of reduction Given a position k, a lag l and a sub-sequence σ: f (k, l, σ): cost of scheduling σ at (k, l) L(k, l, σ): lag of the last job of σ scheduled at (k, l) Dominance Sub-sequence σ is dominated at (k, l) by sub-sequence σ if: The set of jobs in σ and σ is the same f (k, l, σ) > f (k, l, σ ) The partial schedule up to the end of σ will be less costly L(k, l, σ) L(k, l, σ ) The partial schedule after σ will not be more costly B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 21 / 43
32 Extended network G 2 - Example of reduction f (k = 1,, σ = (, )) = 37 L(k = 1,, σ = (, )) = 9 l = 7 l = 3 J 4 l = 9 J 4 l = 7 l = 3 f (k = 1,, σ = (, )) = 22 L(k = 1,, σ = (, )) = 7 k = 0 k = 1 k = 2 k = 3 k = 4 Example: σ = 2 allows us to remove some arcs B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 22 / 43
33 Lagrangian cost variable fixing Additional input data An upper bound UB of the optimum is known Principle Assume that one dominant optimal solution satisfies hypothesis h The optimal path goes through a given arc Compute a (Lagrangian) lower bound LB h under h If LB h > UB, then h is not satisfied in any optimal dominant solution The arc can be removed from the graph B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 23 / 43
34 Lagrangian cost variable fixing (1) Removing arcs from the network Hypothesis: the path goes through e [Ibaraki and Nakamura, 1994] Given Lagrangian multipliers π v J i e w J j SP(w, ) SP(0, v) SP(e) = SP(, v) + cost(e) + SP(w, ) If SP(e) j π j > UB, then e is part of no optimal solution. Computing SP(e) for all e E is done in O( E )-time B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 24 / 43
35 Lagrangian cost variable fixing (2) Removing arcs from the network [Detienne et al., 2012] Given Lagrangian multipliers π and a job J i SP i (0, v) v J i e w J j SP i (w, ) e represents J i SP i (a, b) : SP from a to b going through no arc representing J i SP i (e) = SP i (, v) + cost(e) + SP i (w, ) If SP i (e) j π j > UB, then e is part of no optimal solution. Computing SP i (e) for all e E and i I is done in O(n E )-time B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 25 / 43
36 Lagrangian cost variable fixing (2) Removing arcs from the network [Detienne et al., 2012] Given Lagrangian multipliers π and a job J i SP i (0, v) SP i (0, v) v J k e w J j SP i (w, ) SP i (w, ) e does not represent J i SP i (a, b) : SP from a to b going through exactly one arc representing J i SP i (e) = min{sp i (, v) + cost(e) + SP i (w, ), SP i (, v) + cost(e) + SP i (w, )} If SP i (e) j π j > UB, then e is part of no optimal solution. Computing SP i (e) for all e E and i I is done in O(n E )-time B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 26 / 43
37 1 Introduction 2 Lower bounds 3 Branch-and-bound 4 Numerical results B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 27 / 43
38 Preprocessing Initial upper bound A good feasible solution is obtained by a local search procedure Dynasearch [Tanaka, 2010] Pre-computation of lower bounds Construction of network G 1 Lagrangian cost variable fixing (subgradient procedure) Construction of the extended network G 2 from G 1 Lagrangian cost variable fixing (subgradient procedure) For the best Lagrangian multipliers, SP i (v, ) and SP i (v, ) are stored for each i I and v V B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 28 / 43
39 Branching scheme Solution space explored Feasible sequences of jobs Feasible constrained paths in G 2 Depth-First Search, starting from start node Branching Current sequence σ ( path) is extended with job J i iff: There is a corresponding arc in G 2 All predecessors of J i are in σ and J i is not in σ The sequence of the last 5 jobs obtained would not be dominated by one of its permutations The sequence is not dominated by a previously explored sequence (Memory Dominance Rule, [Baptiste et al., 2004], [T Kindt et al., 2004], [Kao et al., 2008]) B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 29 / 43
40 Lower bound for σ path ending at v in G 2 Lower bound coming from jobs not sequenced yet LB 1 = cost(σ) + max SP i (v, ) π i i/ σ i/ σ Lower bound coming from sequenced jobs LB 2 = cost(σ) + max SP i(v, ) i σ Computing max{lb 1, LB 2 } is done in (n)-time. i/ σ π i B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 30 / 43
41 Tentative upper bound Weakness of the approach If the initial upper bound is too large, variable fixing is not efficient. Overall procedure 1 Build and filter G 2 using the initial upper bound (dynasearch) 2 If G 2 is sufficiently small, run the Branch-and-Bound, STOP 3 Build and filter G 2 using a tentative upper bound 4 Run the Branch-and-Bound 5 If a feasible solution is found, it is optimal, STOP 6 Otherwise, increase the tentative upper bound and go to 3 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 31 / 43
42 1 Introduction 2 Lower bounds 3 Branch-and-bound 4 Numerical results B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 32 / 43
43 No setup times - F 2 C i Coded in C++ (MS VS 2012) MS Windows 8 laptop with 16GB RAM and Intel Core Instances Randomly generated [Akkan and Karabati, 2004], [Haouari and Kharbeche 2013] Up to 100 jobs, p 1 i and p 2 i are drawn from [1, 100] Results for 100 job instances (40 instances) Avg. time: 216 s., Max. time: 602 s. Tentative upper bound is useless Root gap Variable fixing reduces the number of arcs by a factor 5 Avg.: 166K nodes, 1.4M arcs, Max.: 239K nodes, 2.9M arcs B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 33 / 43
44 Sequence-independent setup times - F 2 ST SI C i Instances Subset of the testbed of [Gharbi et al., 2013] Up to 100 jobs, p 1 i, p2 i and s 2 i are drawn from [1, 100] Results for 100 job instances (200 instances) Avg. time: 935 s., Max. time: 6443 s. Tentative upper bound is critical Reduces the number of arcs from 18.5M to 2.2M at the root node Lagrangian Variable fixing + Tentative upper bound reduce the number of arcs by a factor 17 Avg.: 237K nodes, 2.2M arcs, Max.: 440K nodes, 4.9M arcs B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 34 / 43
45 Conclusion Contributions New lower bound for F2 C i and F2 ST SI C i Efficient management of the size of the extended network Dominance rules are embedded in the structure of the network The lower bound is used with success in an exact solving approach All 100-job instances of our test bed are solved in less than two hours 98% are solved in less than one hour Future directions Use Successive Sublimation Dynamic Programming instead of Branch-and-Bound Adapt for other min-sum objective functions? Adapt for more than two machines permutation flowshop? B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 35 / 43
46 Thank you for your attention B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 36 / 43
47 Network flow formulation [Akkan et Karabati, 2004]: G 1 V 1, A 1 : sets of nodes and arcs x v,w,j : amount of flow on the arc representing j between nodes v and w min c v,w,j x v,w,j (v,w,j) A 1 s.t. x v,w,j = x w,v,j v V 1 {(0, 0), (n + 1, 0)} (v,w,j) A 1 (w,v,j) A 1 x v,w,j = 1 j = 1,..., n (v,w,j) A 1 x 0,w,j = 1 (0,w,j) A 1 x v,w,j {0, 1} (v, w, j) E 1 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 37 / 43
48 Lower bound by Lagrangian relaxation V 1, A 1 : sets of nodes and arcs x v,w,j : amount of flow on the arc representing j between nodes v and w n L(π) = min c v,w,j x v,w,j + π j x v,w,j 1 (v,w,j) A 1 j=1 (v,w):(v,w,j) A 1 s.t. x v,w,j = x w,v,j v V 1 {(0, 0), (n + 1, 0)} (v,w,j) A 1 (w,v,j) A 1 x v,w,j = 1 j = 1,..., n (v,w,j) A 1 x 0,w,j = 1 (0,w,j) A 1 x v,w,j {0, 1} (v, w, j) A 1 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 38 / 43
49 Lower bound by Lagrangian relaxation V 1, A 1 : sets of nodes and arcs x v,w,j : amount of flow on the arc representing j between nodes v and w L(π) = min s.t. (v,w,j) A 1 cv,w,j +π j xv,w,j n j=1 π j x v,w,j = x w,v,j v V 1 {(0, 0), (n + 1, 0)} (v,w,j) A 1 (w,v,j) A 1 x v,w,j = 1 j = 1,..., n (v,w,j) A 1 x 0,w,j = 1 (0,w,j) A 1 x v,w,j {0, 1} (v, w, j) A 1 Subproblem: shortest path in the network B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 39 / 43
50 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables C m : completion time of the job in position k on machine m [k] L c k : time lag elapsed between the completion of the job in position k on machines 1 and 2 L c k 0, = C2 [k] C1 [k] = max L c k 1 + s2 [k] p1 + p 2 [k] [k] L c 1 + s2 [2] p1 [2] Lc 2 = p2 [2] B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 40 / 43
51 Lag-based models [Akkan and Karabati], [Gharbi et al.] Lag variables C m : completion time of the job in position k on machine m [k] L c k : time lag elapsed between the completion of the job in position k on machines 1 and 2 L c k 0, = C2 [k] C1 [k] = max L c k 1 + s2 [k] p1 + p 2 [k] [k] L c 2 + s2 [3] > p1 [3] Lc 3 = Lc 2 + s2 [3] p1 [3] + p2 [3] L c 1 + s2 [2] p1 [2] Lc 2 = p2 [2] B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 40 / 43
52 Lag-based models Formulating the objective function Minimizing the sum of completion times: n n C 2 [k] = C 1 [k] + Lc k k=1 = = k=1 n k p 1 [r] + Lc k k=1 n k=1 r=1 (n k + 1)p 1 [k] + Lc k B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 41 / 43
53 Example p 1 = (3, 5); p 2 = (7, 4); p 3 = (2, 7) = = Cost of the schedule: ( ) + ( ) + ( ) = 43 B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 42 / 43
54 Lower bound for σ path ending at v in G 2 Lower bound coming from jobs not sequenced yet LB 1 = cost(σ) + max SP i (v, ) π i i/ σ i/ σ Lower bound coming from sequenced jobs LB 2 = cost(σ) + max SP i(v, ) i σ Computing max{lb 1, LB 2 } is done in (n)-time. i/ σ π i B. Detienne, R. Sadykov, S. Tanaka Two-machine flow-shop 43 / 43
A new Lagrangian bound for the min-sum job-shop scheduling
A new Lagrangian bound for the min-sum job-shop scheduling Shunji Tanaka, Ruslan Sadykov, Boris Detienne To cite this version: Shunji Tanaka, Ruslan Sadykov, Boris Detienne. A new Lagrangian bound for
More informationOn the exact solution of a large class of parallel machine scheduling problems
1 / 23 On the exact solution of a large class of parallel machine scheduling problems Teobaldo Bulhões 2 Ruslan Sadykov 1 Eduardo Uchoa 2 Anand Subramanian 3 1 Inria Bordeaux and Univ. Bordeaux, France
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 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 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 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 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 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 informationProjection in Logic, CP, and Optimization
Projection in Logic, CP, and Optimization John Hooker Carnegie Mellon University Workshop on Logic and Search Melbourne, 2017 Projection as a Unifying Concept Projection is a fundamental concept in logic,
More informationDecision Diagrams for Discrete Optimization
Decision Diagrams for Discrete Optimization Willem Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Acknowledgments: David Bergman, Andre Cire, Samid
More informationTravelling Salesman Problem
Travelling Salesman Problem Fabio Furini November 10th, 2014 Travelling Salesman Problem 1 Outline 1 Traveling Salesman Problem Separation Travelling Salesman Problem 2 (Asymmetric) Traveling Salesman
More informationInteger Programming. Wolfram Wiesemann. December 6, 2007
Integer Programming Wolfram Wiesemann December 6, 2007 Contents of this Lecture Revision: Mixed Integer Programming Problems Branch & Bound Algorithms: The Big Picture Solving MIP s: Complete Enumeration
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 informationFeasibility Pump Heuristics for Column Generation Approaches
1 / 29 Feasibility Pump Heuristics for Column Generation Approaches Ruslan Sadykov 2 Pierre Pesneau 1,2 Francois Vanderbeck 1,2 1 University Bordeaux I 2 INRIA Bordeaux Sud-Ouest SEA 2012 Bordeaux, France,
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 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 INTEGRATED COLUMN GENERATION AND LAGRANGIAN RELAXATION FOR SOLVING FLOWSHOP PROBLEMS TO MINIMIZE THE TOTAL WEIGHTED TARDINESS
International Journal of Innovative Computing, Information and Control ICIC International c 2011 ISSN 1349-4198 Volume 7, Number 11, November 2011 pp. 6453 6471 AN INTEGRATED COLUMN GENERATION AND LAGRANGIAN
More informationAn Exact Algorithm for the Steiner Tree Problem with Delays
Electronic Notes in Discrete Mathematics 36 (2010) 223 230 www.elsevier.com/locate/endm An Exact Algorithm for the Steiner Tree Problem with Delays Valeria Leggieri 1 Dipartimento di Matematica, Università
More informationMulti-Skill Resource-Constrained Project Scheduling: Formulation and Inequalities
Multi-Skill Resource-Constrained Project Scheduling: Formulation and Inequalities Isabel Correia, Lídia Lampreia Lourenço and Francisco Saldanha-da-Gama CIO Working Paper 17/2008 Multi-Skill Resource-Constrained
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
More informationSingle Machine Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 8 Single Machine Models 1. Dispatching Rules 2. Single Machine Models Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Dispatching
More informationA Column Generation Based Heuristic for the Dial-A-Ride Problem
A Column Generation Based Heuristic for the Dial-A-Ride Problem Nastaran Rahmani 1, Boris Detienne 2,3, Ruslan Sadykov 3,2, François Vanderbeck 2,3 1 Kedge Business School, 680 Cours de la Libération,
More informationStabilization in Column Generation: numerical study
1 / 26 Stabilization in Column Generation: numerical study Artur Pessoa 3 Ruslan Sadykov 1,2 Eduardo Uchoa 3 François Vanderbeck 2,1 1 INRIA Bordeaux, France 2 Univ. Bordeaux I, France 3 Universidade Federal
More informationPart 4. Decomposition Algorithms
In the name of God Part 4. 4.4. Column Generation for the Constrained Shortest Path Problem Spring 2010 Instructor: Dr. Masoud Yaghini Constrained Shortest Path Problem Constrained Shortest Path Problem
More informationInteger Programming Reformulations: Dantzig-Wolfe & Benders Decomposition the Coluna Software Platform
Integer Programming Reformulations: Dantzig-Wolfe & Benders Decomposition the Coluna Software Platform François Vanderbeck B. Detienne, F. Clautiaux, R. Griset, T. Leite, G. Marques, V. Nesello, A. Pessoa,
More informationJob Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment Matthias Horn 1, Günther Raidl 1, and Christian Blum 2 1 Institute of Computer
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 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 informationEmbedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i
Embedded Systems 15-1 - REVIEW: Aperiodic scheduling C i J i 0 a i s i f i d i Given: A set of non-periodic tasks {J 1,, J n } with arrival times a i, deadlines d i, computation times C i precedence constraints
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective Vehicle routing problem 1 / 33 Cutting stock
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 informationNo-Idle, No-Wait: When Shop Scheduling Meets Dominoes, Eulerian and Hamiltonian Paths
No-Idle, No-Wait: When Shop Scheduling Meets Dominoes, Eulerian and Hamiltonian Paths J.C. Billaut 1, F.Della Croce 2, Fabio Salassa 2, V. T kindt 1 1. Université Francois-Rabelais, CNRS, Tours, France
More informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
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 informationFlow Shop and Job Shop Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 11 Flow Shop and Job Shop Models 1. Flow Shop 2. Job Shop Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Resume Permutation
More informationMinimum Linear Arrangements
Minimum Linear Arrangements Rafael Andrade, Tibérius Bonates, Manoel Câmpelo, Mardson Ferreira ParGO - Research team in Parallel computing, Graph theory and Optimization Department of Statistics and Applied
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 informationRCPSP Single Machine Problems
DM204 Spring 2011 Scheduling, Timetabling and Routing Lecture 3 Single Machine Problems Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. Resource
More informationSingle Machine Problems Polynomial Cases
DM204, 2011 SCHEDULING, TIMETABLING AND ROUTING Lecture 2 Single Machine Problems Polynomial Cases Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline
More informationFH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs
FH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs Nadjat Meziani 1 and Mourad Boudhar 2 1 University of Abderrahmane Mira Bejaia, Algeria 2 USTHB University Algiers, Algeria ro nadjet07@yahoo.fr
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 informationThermal Unit Commitment Problem
Thermal Unit Commitment Problem Moshe Potsane, Luyanda Ndlovu, Simphiwe Simelane Christiana Obagbuwa, Jesal Kika, Nadine Padayachi, Luke O. Joel Lady Kokela, Michael Olusanya, Martins Arasomwa, Sunday
More informationContents college 5 and 6 Branch and Bound; Beam Search (Chapter , book)! general introduction
Contents college 5 and 6 Branch and Bound; Beam Search (Chapter 3.4-3.5, book)! general introduction Job Shop Scheduling (Chapter 5.1-5.3, book) ffl branch and bound (5.2) ffl shifting bottleneck heuristic
More informationInteger Programming Part II
Be the first in your neighborhood to master this delightful little algorithm. Integer Programming Part II The Branch and Bound Algorithm learn about fathoming, bounding, branching, pruning, and much more!
More informationPedro Munari - COA 2017, February 10th, University of Edinburgh, Scotland, UK 2
Pedro Munari [munari@dep.ufscar.br] - COA 2017, February 10th, University of Edinburgh, Scotland, UK 2 Outline Vehicle routing problem; How interior point methods can help; Interior point branch-price-and-cut:
More informationColumn generation for extended formulations
EURO J Comput Optim (2013) 1:81 115 DOI 10.1007/s13675-013-0009-9 ORIGINAL PAPER Column generation for extended formulations Ruslan Sadykov François Vanderbeck Received: 5 May 2012 / Accepted: 21 December
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 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 informationMinimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds Cyril Briand 1,a,b, Samia Ourari c a CNRS ; LAAS ; 7 avenue du colonel Roche, F-31077 Toulouse,
More informationA comparison of sequencing formulations in a constraint generation procedure for avionics scheduling
A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling Department of Mathematics, Linköping University Jessika Boberg LiTH-MAT-EX 2017/18 SE Credits: Level:
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 informationIntroduction to Integer Linear Programming
Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.
More informationComplexity analysis of job-shop scheduling with deteriorating jobs
Discrete Applied Mathematics 117 (2002) 195 209 Complexity analysis of job-shop scheduling with deteriorating jobs Gur Mosheiov School of Business Administration and Department of Statistics, The Hebrew
More informationDisconnecting Networks via Node Deletions
1 / 27 Disconnecting Networks via Node Deletions Exact Interdiction Models and Algorithms Siqian Shen 1 J. Cole Smith 2 R. Goli 2 1 IOE, University of Michigan 2 ISE, University of Florida 2012 INFORMS
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 informationDiscrete (and Continuous) Optimization WI4 131
Discrete (and Continuous) Optimization WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek e-mail: C.Roos@ewi.tudelft.nl
More informationon a Single Machine Stephane Dauzere-Peres a Marc Sevaux b Helleveien 30 N-5035 Bergen-Sandviken, Norway Ecole des Mines de Nantes
Using Lagrangean Relaxation to Minimize the (Weighted) Number of Late Jobs on a Single Machine Stephane Dauzere-Peres a Marc Sevaux b a Department of Finance and Management Science Norwegian School of
More informationA Note on Symmetry Reduction for Circular Traveling Tournament Problems
Mainz School of Management and Economics Discussion Paper Series A Note on Symmetry Reduction for Circular Traveling Tournament Problems Timo Gschwind and Stefan Irnich April 2010 Discussion paper number
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 informationDevelopment of the new MINLP Solver Decogo using SCIP - Status Report
Development of the new MINLP Solver Decogo using SCIP - Status Report Pavlo Muts with Norman Breitfeld, Vitali Gintner, Ivo Nowak SCIP Workshop 2018, Aachen Table of contents 1. Introduction 2. Automatic
More informationLogic, Optimization and Data Analytics
Logic, Optimization and Data Analytics John Hooker Carnegie Mellon University United Technologies Research Center, Cork, Ireland August 2015 Thesis Logic and optimization have an underlying unity. Ideas
More informationPart III: Traveling salesman problems
Transportation Logistics Part III: Traveling salesman problems c R.F. Hartl, S.N. Parragh 1/282 Motivation Motivation Why do we study the TSP? c R.F. Hartl, S.N. Parragh 2/282 Motivation Motivation Why
More informationDecision Diagrams for Sequencing and Scheduling
Decision Diagrams for Sequencing and Scheduling Willem-Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Plan What can MDDs do for Combinatorial Optimization?
More informationNetwork Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 6. Lagrangian Relaxation 6.3 Lagrangian Relaxation and Integer Programming Fall 2010 Instructor: Dr. Masoud Yaghini Integer Programming Outline Branch-and-Bound Technique
More informationDecision Diagrams: Tutorial
Decision Diagrams: Tutorial John Hooker Carnegie Mellon University CP Summer School Cork, Ireland, June 2016 Decision Diagrams Used in computer science and AI for decades Logic circuit design Product configuration
More informationOn the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms
On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms Anne Benoit, Fanny Dufossé and Yves Robert LIP, École Normale Supérieure de Lyon, France {Anne.Benoit Fanny.Dufosse
More informationAlgorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling.
Algorithm Design Scheduling Algorithms Part 2 Parallel machines. Open-shop Scheduling. Job-shop Scheduling. 1 Parallel Machines n jobs need to be scheduled on m machines, M 1,M 2,,M m. Each machine can
More informationCoalition Structure Generation in Multi-Agent Systems With Positive and Negative Externalities
Coalition Structure Generation in Multi-Agent Systems With Positive and Negative Externalities Talal Rahwan 1, Tomasz Michalak 2, Nicholas R. Jennings 1, Michael Wooldridge 2, Peter McBurney 2 1 School
More informationTable of Contents. Best-Case Lower Bounds in a Group Sequence for the Job Shop Problem. Group Sequencing. Introduction IFAC 2008 WC
Table of Contents Best-Case Lower Bounds in a Group Sequence for the Job Shop Problem 1 Introduction Group Sequencing Guillaume Pinot Nasser Mebarki 3 The Best-Case Completion Time of an Operation IRCCyN
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 informationOptimisation Constraints
Optimisation Constraints Nicolas Beldiceanu Mats Carlsson SICS Lägerhyddsvägen 5 SE-75237 Uppsala, Sweden {nicolas,matsc}@sics.se Situation for LP/IP Optimisation is a basic idea in math programming: minimize
More information5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1
5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Definition: An Integer Linear Programming problem is an optimization problem of the form (ILP) min
More informationEvent-based formulations for the RCPSP with production and consumption of resources
Event-based formulations for the RCPSP with production and consumption of resources Oumar KONE 1, Christian ARTIGUES 1, Pierre LOPEZ 1, and Marcel MONGEAU 2 May 2010 1: CNRS ; LAAS ; 7 avenue du colonel
More informationThe Challenge Roadef - Équipe S23
The Challenge Roadef - Équipe S23 Antoine Rozenknop 1 Roberto Wolfler Calvo 1 Daniel Chemla 2 Laurent Alfandari 3 Lucas Létocart 1 Guillaume Turri 1 1 LIPN, University of Paris Nord, Villetaneuse, France
More informationScheduling with AND/OR Precedence Constraints
Scheduling with AND/OR Precedence Constraints Seminar Mathematische Optimierung - SS 2007 23th April 2007 Synthesis synthesis: transfer from the behavioral domain (e. g. system specifications, algorithms)
More informationA Lagrangian bound for many-to-many assignment problems - Additional Results
Noname manuscript No. (will be inserted by the editor) A Lagrangian bound for many-to-many assignment problems - Additional Results Igor Litvinchev Socorro Rangel Jania Saucedo May, 2008 / last updated:
More informationPart III: Traveling salesman problems
Transportation Logistics Part III: Traveling salesman problems c R.F. Hartl, S.N. Parragh 1/74 Motivation Motivation Why do we study the TSP? it easy to formulate it is a difficult problem many significant
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 informationTopics in Approximation Algorithms Solution for Homework 3
Topics in Approximation Algorithms Solution for Homework 3 Problem 1 We show that any solution {U t } can be modified to satisfy U τ L τ as follows. Suppose U τ L τ, so there is a vertex v U τ but v L
More 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 informationA LAGRANGIAN RELAXATION FOR CAPACITATED SINGLE ALLOCATION P-HUB MEDIAN PROBLEM WITH MULTIPLE CAPACITY LEVELS
A LAGRANGIAN RELAXATION FOR CAPACITATED SINGLE ALLOCATION P-HUB MEDIAN PROBLEM WITH MULTIPLE CAPACITY LEVELS Ching-Jung Ting Department of Industrial Engineering and Management, Yuan Ze University Kuo-Rui
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 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 informationLinear integer programming and its application
Linear integer programming and its application Presented by Dr. Sasthi C. Ghosh Associate Professor Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata, India Outline Introduction
More informationarxiv: v1 [math.oc] 20 Mar 2019
Heterogeneous Prestressed Precast Beams Multiperiod Production Planning Problem: Modeling and Solution Methods Kennedy Anderson Guimarães de Araújo a,1,, Tibérius de Oliveira e Bonates a,2, Bruno de Athayde
More informationSolving Elementary Shortest-Path Problems as Mixed-Integer Programs
Gutenberg School of Management and Economics Discussion Paper Series Solving Elementary Shortest-Path Problems as Mixed-Integer Programs Michael Drexl and Stefan Irnich Januar 2012 Discussion paper number
More informationPolynomially solvable and NP-hard special cases for scheduling with heads and tails
Polynomially solvable and NP-hard special cases for scheduling with heads and tails Elisa Chinos, Nodari Vakhania Centro de Investigación en Ciencias, UAEMor, Mexico Abstract We consider a basic single-machine
More informationTwo Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem
Two Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem Özlem Ergun Industrial and Systems Engineering, Georgia Institute of Technology,
More informationOn bilevel machine scheduling problems
Noname manuscript No. (will be inserted by the editor) On bilevel machine scheduling problems Tamás Kis András Kovács Abstract Bilevel scheduling problems constitute a hardly studied area of scheduling
More informationA Branch and Bound Algorithm for the Project Duration Problem Subject to Temporal and Cumulative Resource Constraints
A Branch and Bound Algorithm for the Project Duration Problem Subject to Temporal and Cumulative Resource Constraints Christoph Schwindt Institut für Wirtschaftstheorie und Operations Research University
More informationProjection, Consistency, and George Boole
Projection, Consistency, and George Boole John Hooker Carnegie Mellon University CP 2015, Cork, Ireland Projection as a Unifying Concept Projection underlies both optimization and logical inference. Optimization
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 informationScheduling Home Hospice Care with Logic-Based Benders Decomposition
Scheduling Home Hospice Care with Logic-Based Benders Decomposition John Hooker Carnegie Mellon University Joint work with Aliza Heching Ryo Kimura Compassionate Care Hospice CMU Lehigh University October
More informationJob Sequencing Bounds from Decision Diagrams
Job Sequencing Bounds from Decision Diagrams J. N. Hooker Carnegie Mellon University June 2017 Abstract. In recent research, decision diagrams have proved useful for the solution of discrete optimization
More informationA Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/221353491 A Column Generation Based Destructive Lower Bound for Resource Constrained Project
More information4/12/2011. Chapter 8. NP and Computational Intractability. Directed Hamiltonian Cycle. Traveling Salesman Problem. Directed Hamiltonian Cycle
Directed Hamiltonian Cycle Chapter 8 NP and Computational Intractability Claim. G has a Hamiltonian cycle iff G' does. Pf. Suppose G has a directed Hamiltonian cycle Γ. Then G' has an undirected Hamiltonian
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 informationIntroduction to Integer Programming
Lecture 3/3/2006 p. /27 Introduction to Integer Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Lecture 3/3/2006 p. 2/27 Contents IP formulations and examples Total unimodularity
More informationMinimizing Mean Flowtime and Makespan on Master-Slave Systems
Minimizing Mean Flowtime and Makespan on Master-Slave Systems Joseph Y-T. Leung,1 and Hairong Zhao 2 Department of Computer Science New Jersey Institute of Technology Newark, NJ 07102, USA Abstract The
More informationA polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs Bertrand Hellion, Bernard Penz, Fabien Mangione aboratoire G-SCOP n o
More information