An Integrated OR/CP Method for Planning and Scheduling
|
|
- Alexander Fleming
- 5 years ago
- Views:
Transcription
1 An Integrated OR/CP Method for Plannng and Schedulng John Hooer Carnege Mellon Unversty IT Unversty of Copenhagen June 2005
2 The Problem Allocate tass to facltes. Schedule tass assgned to each faclty. Subect to deadlnes. Facltes may run at dfferent speeds and ncur dfferent costs. Cumulatve schedulng Several tass may run smultaneously on a faclty. But total resource consumpton must never eceed lmt. 2
3 Approach In practce problem s often solved by gve-and-tae. If schedule doesn t wor schedulers telephone planners and as for a dfferent allocaton Repeat untl everyone can lve wth the soluton. Benders decomposton s a mathematcal formalzaton of ths process. Plannng s the master problem. Schedulng s the subproblem. Telephone calls are Benders cuts. Use logc-based Benders. Classcal Benders requres that the subproblem be a lnear or nonlnear programmng problem. 3
4 Approach Decomposton permts hybrd soluton: Apply MIP to plannng master problem. MIP s generally better at resource allocaton. Apply CP to schedulng subproblem. CP s generally better at schedulng. 4
5 Prevous Wor 995 JH & Yan Apply logc-based Benders to crcut verfcaton. Better than BDDs when crcut contans error JH Formulate general logc-based Benders. Specalzed Benders cuts must be desgned for each problem class. Branch-and-chec proposed. 200 Jan & Grossmann Apply logc-based Benders to multple-machne schedulng usng CP/MIP. Substantal speedup. But easy problem for Benders approach 5
6 200 Thorstensson Apply branch and chec to CP/MIP. -2 orders of magntude speedup on multple machne schedulng 2002 Tmpe Apply logc-based Benders to polypropylene batch processng at BASF. Solved prevously nsoluble problem n 0 mn JH Ottosson Apply logc-based Benders to IP and SAT. Potentally useful for stochastc IP. Substantal advantage when subproblem decouples nto 20 or more scenaros Cambazard et al. Apply logc-based Benders mn conflct cuts to real-tme tas allocaton & schedulng. CP solves both master and subproblem. 6
7 2004 JH Apply logc-based Benders to mn cost and mn maespan plannng & cumulatve schedulng problems. 00 to 000 tmes faster than CP MIP 2005 JH Mn total tardness mn number of late obs. At least 0 tmes faster for mn tardness much better solutons. 00 to 000 tmes faster for mn number of late obs. 7
8 ogc-based Benders Decomposton mn subect to f C y y D y D y Basc dea: Search over values of n master problem. For each eamned solve subproblem for y. mn z Master Problem Subproblem subect to z z B D y all D y mn y subect to C y D y Benders cuts for all teratons f y y Soluton of master problem 8
9 ogc-based Benders Decomposton mn Subproblem subect to f C y y y D y Soluton of subproblem dual s a proof that cost can be no less than the optmal cost when s.t. B Subproblem dual ma v C v R y P P f Q y We use the same proof schema to derve a vald lower bound B for any. z B Benders cut a type of nogood forces master problem to loo at a value of other than to get a lower cost. v 9
10 Applyng Benders to Plannng & Schedulng Decompose problem nto assgnment resource-constraned assgn tass schedulng to facltes schedule tass on each faclty Use logc-based Benders to ln these. Solve: master problem wth MIP -- good at resource allocaton subproblem wth Constrant Programmng -- good at schedulng We wll use Benders cuts that requre no nformaton from the CP soluton process. 0
11 Notaton p processng tme of tas on faclty c resource consumpton of tas on faclty C resources avalable on faclty C tas c Faclty Faclty 2 tas 4 tas 5 C 2 c 22 tas 3 tas 2 p p 22 Total resource consumpton C at all tmes.
12 Obectve functons Mnmze cost g y faclty assgned to tas Fed cost of assgnng tas to faclty y Mnmze maespan ma { t p y } Start tme of tas 2
13 Obectve functons y Mnmze no. late tass δ p δ α f α > 0 0 otherwse t d Due date for tas Mnmze tardness p y d { } α ma 0 α t 3
14 mn subect to Mnmze cost: MIP Model f tas starts at tme pont t on faclty t N t t t t t g t t p t t ' 0 0 < t ' {0} t all all all c t t t ' wth wth Tas starts at one tme on one faclty Tass underway at tme t consume C n C all t resources t d > N p < p t Tass observe tme wndows 4
15 5 p d t C y c y p y t g y y all 0 all cumulatve subect to mn Mnmze Cost: CP Model Observe tme wndows Observe resource lmt on each faclty y faclty assgned to tas start tmes of tass assgned to faclty
16 Mnmze Cost: ogc-based Benders C mn subect to Master Problem: Assgn tass to facltes tas d g d p c all Benders cuts tas 4 tas 5 C d d all all dstnct Relaaton of subproblem: Area d r of tass due before d must ft before d. d 6
17 Subproblem: Schedule tass assgned to each faclty Solve by constrant programmng soluton of master problem cumulatve 0 t d t p c C all et J h set of tass assgned to faclty n teraton h. If subproblem s nfeasble soluton of subproblem dual s a proof that not all tass n J h can be assgned to faclty. Ths provdes the bass for a smple Benders cut. 7
18 mn subect to Master Problem wth Benders Cuts Solve by MIP d c J d h all p r C d all {0} Benders cuts all all dstnct h d 8
19 C Mnmze Maespan: ogc-based Benders Master Problem: Assgn tass to facltes mn subect to M maespan all M p C Benders cuts c all act vty actvty 4 actvty 5 Relaaton of subproblem: Area of tass provdes lower bound on maespan. 9
20 Subproblem: Schedule tass assgned to each faclty Solve by constrant programmng mn M subect to M t 0 t d d cumulatve t p c all all C all et J h set of tass assgned to machne n teraton h. We get a Benders cut even when subproblem s feasble. 20
21 The Benders cut s based on: emma. If we remove tass s from a faclty the mnmum maespan on that faclty s reduced by at most s p ma d s s { d } mn { } Assumng all deadnes d are the same we get the Benders cut * M M h p J h Mn maespan on faclty n last teraton 2
22 M Why does ths wor? Assume all deadlnes are the same. Add tass s sequentally at end of optmal schedule for other tass Case I: resultng schedule meets deadlne Optmal maespan for tass s m Optmal maespan for all tass * Mˆ M ˆ s M p Feasble maespan for all tass tass s m tas tas s s s M ˆ * p M M d * ˆ p Deadlne for all tass 22
23 Case II: resultng schedule eceeds deadlne Optmal maespan for tass s m Optmal maespan for all tass * Mˆ M ˆ s M p Maespan no longer feasble tass s m tas tas s M s Deadlne for all tass * * d and M ˆ p > d M ˆ M p d s 23
24 mn subect to Master Problem: Assgn tass to facltes Assume all deadlnes are the same Solve by MIP M M M C M {0} all * h p J c all p Relaaton all h Benders cuts Maespan on faclty n teraton h 24
25 Mnmze Number of ate Jobs: ogc-based Benders mn s.t. Master Problem: Assgn tass to facltes C d ma Benders cuts d d all c d p 0 { p } all d all Number of late tass Relaaton of subproblem: Dvde ecess area of tass by longest processng tme. all dstnct d 25
26 Benders cuts To etract some dual nformaton re-solve the schedulng subproblem a few tmes wth some tass removed. Use greedy algorthm to dentfy 0 J h et a set of tass that can be ontly removed from J h faclty wthout reducng mn number of late tass a set of tass that can be ontly removed wthout reducng mn no of late tass more than Ths yelds Benders cuts: * h * h * h J * h h \ J 0 h J h \ J h all h all h 26
27 Mnmze Tardness: ogc-based Benders Master Problem: Assgn tass to facltes mn s.t. T T T T p c C d d second relaaton of Benders cuts all T 0 tardness all d all all subproblem Relaaton of subproblem dstnct d 27
28 Second relaaton of subproblem emma. Consder a mn tardness problem that schedules tass n on faclty where d d n. The mn tardness T* s bounded below by n where p π c d π C and π s a permutaton of n such that p π c π p π c π n n 28
29 Idea of proof For a permutaton σ of n let σ σ where σ p π c d π σ C n et σ 0 σ 0 n be order of obs n any optmal soluton so that t and mn tardness s T* t σ 0 σ 0 n Consder bubble sort on σ 0 σ 0 n to obtan n. et σ 0 σ S be resultng sequence of permutatons so that σ s σ s dffer by a swap and σ s. 29
30 30 Now we have T S s s * 0 σ σ σ σ snce c p C t π π n s s s s s n s s s s s 2 2 σ σ σ σ σ σ σ σ σ σ swap and So 0 B A b a b A A a s s s s s s σ σ σ σ σ σ snce A a B b
31 3 From the lemma we can wrte the relaaton n T where d c p C π π π To lnearze ths we wrte n T and M d c p C π π π d c p C M π π where
32 Benders cuts To etract some dual nformaton re-solve the schedulng subproblem a few tmes wth some tass removed. 0 J h et {tass that can be ndvdually removed wthout reducng mn tardness} 0 T h mn tardness f all tass n are removed smultaneously 0 J h Ths yelds Benders cuts: T T T T 0 h * h T T 0 h * h J J h h \ J 0 h all h all h 32
33 Computatonal Results Random problems on facltes. Facltes run at dfferent speeds. All release tmes 0. Mn cost and maespan problems: all tass have same deadlne. Tardness problems: random due date parameters set so that a few tass tend to be late. No precedence or other sde constrants. Maes problem harder. Implement wth OP Studo CPEX for MIP. IOG Scheduler for CP. Use AssgnAlternatves & SetTmes. 33
34 Mn cost 2 facltes Computaton tme n seconds Average of 5 nstances shown Jobs MIP* CP Benders At least one problem n the 5 eceeded 7200 sec 2 hours 34
35 Mn cost 3 facltes Computaton tme n seconds Average of 5 nstances shown Tass MIP* CP Benders * *CPEX ran out of memory on or more problems. At least one problem n the 5 eceeded 7200 sec 2 hours 35
36 Mn cost 4 facltes Computaton tme n seconds Average of 5 nstances shown Jobs MIP* CP Benders * *CPEX ran out of memory on or more problems. At least one problem n the 5 eceeded 7200 sec 2 hours 36
37 Mn maespan 2 facltes Average of 5 nstances shown Jobs MIP CP Benders At least one problem n the 5 eceeded 7200 sec 2 hours 37
38 Mn maespan 3 facltes Average of 5 nstances shown Jobs MIP CP Benders At least one problem n the 5 eceeded 7200 sec 2 hours 38
39 Mn maespan 4 facltes Average of 5 nstances shown Jobs MIP CP Benders At least one problem n the 5 eceeded 7200 sec 2 hours 39
40 Scalng up the Benders Method Average of 5 nstances shown Tass Facltes Mn cost sec Mn maespan sec At least one problem n the 5 eceeded 7200 sec 2 hours 40
41 Bounds Provded by Benders Mn maespan problems unsolved after 2 hours Tass Facltes Best soluton value ower bound
42 Mn number of late tass 3 facltes Smaller problems Tass Tme sec CP MIP Benders Mn late tass error
43 Mn number of late tass 3 facltes arger problems For 6 tass: average tme rato MIP/Benders 295 Tass Tme sec MIP Benders Best soluton MIP Benders > > > > > >7200 > > > > > Boldface optmalty proved 43
44 Mn tardness 3 facltes Smaller problems Tass Tme sec CP MIP Benders Mn tardness > >7200 > > > > > >
45 Mn tardness 3 facltes arger problems For 6 tass: average tme rato MIP/Benders 25 Tass Tme sec MIP Benders Best soluton MIP Benders > >7200 > >7200 > >7200 > >7200 > > > >7200 > >7200 > Boldface optmalty proved 45
46 Future Research Implement branch-and-chec for Benders problem. Eplot dual nformaton from the subproblem soluton process e.g. edge fndng. Eplore other problem classes. Mn maespan cost wth release dates Integrated long- and short-term schedulng Vehcle routng SAT subproblem s renamable Horn Stochastc IP 46
Planning and Scheduling to Minimize Makespan & Tardiness. John Hooker Carnegie Mellon University September 2006
Plannng and Schedulng to Mnmze Makespan & ardness John Hooker Carnege Mellon Unversty September 2006 he Problem Gven a set of tasks, each wth a deadlne 2 he Problem Gven a set of tasks, each wth a deadlne
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationA Search-Infer-and-Relax Framework for. Integrating Solution Methods. Carnegie Mellon University CPAIOR, May John Hooker
A Search-Infer-and-Rela Framework for Integratng Soluton Methods John Hooker Carnege Mellon Unversty CPAIOR, May 005 CPAIOR 005 Why ntegrate soluton methods? One-stop shoppng. One solver does t all. CPAIOR
More informationIntegrated approach in solving parallel machine scheduling and location (ScheLoc) problem
Internatonal Journal of Industral Engneerng Computatons 7 (2016) 573 584 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationBenders Decomposition
Benders Decomposton John Hooker Carnege Mellon Unversty CP Summer School Cork, Ireland, June 206 Outlne Essence of Benders decomposton Smple eample Logc-based Benders Inference dual Classcal LP dual Classcal
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationGlobal Optimization of Truss. Structure Design INFORMS J. N. Hooker. Tallys Yunes. Slide 1
Slde 1 Global Optmzaton of Truss Structure Desgn J. N. Hooker Tallys Yunes INFORMS 2010 Truss Structure Desgn Select sze of each bar (possbly zero) to support the load whle mnmzng weght. Bar szes are dscrete.
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationThis is the Pre-Published Version.
Ths s the Pre-Publshed Verson. Abstract In ths paper we consder the problem of schedulng obs wth equal processng tmes on a sngle batch processng machne so as to mnmze a prmary and a secondary crtera. We
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationA FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS
Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationTRANSPOSE ON VERTEX SYMMETRIC DIGRAPHS
TRANSPOSE ON VERTEX SYMMETRIC DIGRAPHS Vance Faber Center for Computng Scences, Insttute for Defense Analyses Abstract. In [] (and earler n [3]), we defned several global communcaton tasks (unversal exchange,
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationCombining Constraint Programming and Integer Programming
Combnng Constrant Programmng and Integer Programmng GLOBAL CONSTRAINT OPTIMIZATION COMPONENT Specal Purpose Algorthm mn c T x +(x- 0 ) x( + ()) =1 x( - ()) =1 FILTERING ALGORITHM COST-BASED FILTERING ALGORITHM
More information10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization
10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationCommon loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:
15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationCS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang
CS DESIGN ND NLYSIS OF LGORITHMS DYNMIC PROGRMMING Dr. Dasy Tang Dynamc Programmng Idea: Problems can be dvded nto stages Soluton s a sequence o decsons and the decson at the current stage s based on the
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationTutorial: Operations Research and Constraint Programming. Why Integrate OR and CP? Computational Advantage of Integrating CP and OR
Computatonal Advantage of Integratng CP and OR Usng CP + relaaton from MILP Tutoral: Operatons Research and Constrant Programmng Focacc, Lod, Mlano (999) Problem Lesson tmetablng Speedup to tmes faster
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationDepartment of Computer Science Artificial Intelligence Research Laboratory. Iowa State University MACHINE LEARNING
MACHINE LEANING Vasant Honavar Bonformatcs and Computatonal Bology rogram Center for Computatonal Intellgence, Learnng, & Dscovery Iowa State Unversty honavar@cs.astate.edu www.cs.astate.edu/~honavar/
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationLecture 20: November 7
0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationMean Field / Variational Approximations
Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but
More informationCombining Examinations to Accelerate Timetable Construction
Combnng Examnatons to Accelerate Tmetable Constructon Graham Kendall Jawe L School of Computer Scence, Unversty of Nottngham, UK {gxk wl}@cs.nott.ac.uk Abstract: In ths paper we propose a novel approach
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationLagrangian Primal Dual Algorithms in Online Scheduling
Lagrangan Prmal Dual Algorthms n Onlne Schedulng Nguyen Km Thang IBISC, Unversty of Evry Val d Essonne, France Abstract We present a prmal-dual approach to desgn algorthms n onlne schedulng. Our approach
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationEmbedded Systems. 4. Aperiodic and Periodic Tasks
Embedded Systems 4. Aperodc and Perodc Tasks Lothar Thele 4-1 Contents of Course 1. Embedded Systems Introducton 2. Software Introducton 7. System Components 10. Models 3. Real-Tme Models 4. Perodc/Aperodc
More informationSingle-machine scheduling with trade-off between number of tardy jobs and compression cost
Ths s the Pre-Publshed Verson. Sngle-machne schedulng wth trade-off between number of tardy jobs and compresson cost 1, 2, Yong He 1 Department of Mathematcs, Zhejang Unversty, Hangzhou 310027, P.R. Chna
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationPower Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization
Power Allocaton/Beamformng for DF MIMO Two-Way Relayng: Relay and Network Optmzaton Je Gao, Janshu Zhang, Sergy A. Vorobyov, Ha Jang, and Martn Haardt Dept. of Electrcal & Computer Engneerng, Unversty
More informationOptimal Scheduling Algorithms to Minimize Total Flowtime on a Two-Machine Permutation Flowshop with Limited Waiting Times and Ready Times of Jobs
Optmal Schedulng Algorthms to Mnmze Total Flowtme on a Two-Machne Permutaton Flowshop wth Lmted Watng Tmes and Ready Tmes of Jobs Seong-Woo Cho Dept. Of Busness Admnstraton, Kyongg Unversty, Suwon-s, 443-760,
More informationPortfolios with Trading Constraints and Payout Restrictions
Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty
More informationModeling with Metaconstraints and Semantic Typing of Variables
Modelng wth Metaconstrants and Semantc Typng of Varables André Cré Unversty of Toronto John Hooker Carnege Mellon Unversty Tallys Yunes Unversty of Mam INFORMS Journal on Computng (2016) 1-13 Basc Problem
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationThe strict priority scheduler
6. SP and GPS schedulers Pag. The strct prorty scheduler The strct prorty scheduler s very smple and effcent In the followng, we wll carry out the analyss of ths scheduler to determne the formulas for
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More information36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to
ChE Lecture Notes - D. Keer, 5/9/98 Lecture 6,7,8 - Rootndng n systems o equatons (A) Theory (B) Problems (C) MATLAB Applcatons Tet: Supplementary notes rom Instructor 6. Why s t mportant to be able to
More informationOn Energy-Optimal Voltage Scheduling for Fixed-Priority Hard Real-Time Systems
On Energy-Optmal Voltage Schedulng for Fxed-Prorty Hard Real-Tme Systems HAN-SAEM YUN and JIHONG KIM Seoul Natonal Unversty We address the problem of energy-optmal voltage schedulng for fxed-prorty hard
More informationManaging Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration
Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationEstimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort
Estmatng Delas Would be nce to have a back of the envelope method for szng gates for speed Logcal Effort ook b Sutherland, Sproull, Harrs Chapter s on our web page Gate Dela Model Frst, normalze a model
More informationAnalysis of Queuing Delay in Multimedia Gateway Call Routing
Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms CSE 53 Lecture 4 Dynamc Programmng Junzhou Huang, Ph.D. Department of Computer Scence and Engneerng CSE53 Desgn and Analyss of Algorthms The General Dynamc Programmng Technque
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationIJRSS Volume 2, Issue 2 ISSN:
IJRSS Volume, Issue ISSN: 49-496 An Algorthm To Fnd Optmum Cost Tme Trade Off Pars In A Fractonal Capactated Transportaton Problem Wth Restrcted Flow KAVITA GUPTA* S.R. ARORA** _ Abstract: Ths paper presents
More informationConic Programming in GAMS
Conc Programmng n GAMS Armn Pruessner, Mchael Busseck, Steven Drkse, Ale Meeraus GAMS Development Corporaton INFORMS 003, Atlanta October 19- Drecton What ths talk s about Overvew: the class of conc programs
More informationSupport Vector Machines
CS 2750: Machne Learnng Support Vector Machnes Prof. Adrana Kovashka Unversty of Pttsburgh February 17, 2016 Announcement Homework 2 deadlne s now 2/29 We ll have covered everythng you need today or at
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationQuadratic speedup for unstructured search - Grover s Al-
Quadratc speedup for unstructured search - Grover s Al- CS 94- gorthm /8/07 Sprng 007 Lecture 11 001 Unstructured Search Here s the problem: You are gven a boolean functon f : {1,,} {0,1}, and are promsed
More informationA Hybrid MILP/CP Decomposition Approach for the Continuous Time Scheduling of Multipurpose Batch Plants
A Hybrd MILP/CP Decomposton Approach for the Contnuous Tme Schedulng of Multpurpose Batch Plants Chrstos T. Maravelas, Ignaco E. Grossmann Carnege Mellon Unversty, Department of Chemcal Engneerng Pttsburgh,
More informationCHAPTER III Neural Networks as Associative Memory
CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people
More informationLecture 10: Euler s Equations for Multivariable
Lecture 0: Euler s Equatons for Multvarable Problems Let s say we re tryng to mnmze an ntegral of the form: {,,,,,, ; } J f y y y y y y d We can start by wrtng each of the y s as we dd before: y (, ) (
More informationPROBLEM SET 7 GENERAL EQUILIBRIUM
PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject
More informationNatural Language Processing and Information Retrieval
Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support
More informationA NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011
A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegan Busness School 2011 Functons featurng constant elastcty of substtuton CES are wdely used n appled economcs and fnance. In ths note, I do two thngs. Frst,
More informationBoostrapaggregating (Bagging)
Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationLecture 14 (03/27/18). Channels. Decoding. Preview of the Capacity Theorem.
Lecture 14 (03/27/18). Channels. Decodng. Prevew of the Capacty Theorem. A. Barg The concept of a communcaton channel n nformaton theory s an abstracton for transmttng dgtal (and analog) nformaton from
More informationNeural networks. Nuno Vasconcelos ECE Department, UCSD
Neural networs Nuno Vasconcelos ECE Department, UCSD Classfcaton a classfcaton problem has two types of varables e.g. X - vector of observatons (features) n the world Y - state (class) of the world x X
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationA Modeling System to Combine Optimization and Constraint. Programming. INFORMS, November Carnegie Mellon University.
A Modelng Sstem to Combne Optmzaton and Constrant Programmng John Hooker Carnege Mellon Unverst INFORMS November 000 Based on ont work wth Ignaco Grossmann Hak-Jn Km Mara Axlo Osoro Greger Ottosson Erlendr
More informationInterconnect Optimization for Deep-Submicron and Giga-Hertz ICs
Interconnect Optmzaton for Deep-Submcron and Gga-Hertz ICs Le He http://cadlab.cs.ucla.edu/~hele UCLA Computer Scence Department Los Angeles, CA 90095 Outlne Background and overvew LR-based STIS optmzaton
More information