07/09/2011. A.AMRANI-ZOUGGAR IMS-Lab, University Bordeaux1. These products specific management
|
|
- Rachel York
- 5 years ago
- Views:
Transcription
1 A.AMRANI-ZOUGGAR IMS-Lab, University Bordeaux These products specific management
2 What leads the industrialist to start projects? BENEFITS Ageing of the range Benchmarking, comparing the market and industrial evolution Appearance of a new technology Ex: AMOLED screen Leads the company to develop new project Arrival of a new low cost competitor Risk of threat for the company necessity to design new projects 3 3 Project Activity Non repetitive Irreversibles Decisions Strong uncertainty Production Activity Repetitive Periodic Decisions Weak uncertainty Strong influence of external variables Strong Influence of internal variables
3 Staff Turnover Management g change Hardware unavailability Requirements change Size underestimated 5 Projects don t often reach their objectives : No respect of lead time Important over costs Product technical quality insufficient Projects are running in a complex environment : Various actors in enterprises: engineering, production, marketing, having different objectives and different measures External environment difficult to master: market, policy, Competition NEED TO SPECIFC METHODS AND TOOLS 6 3
4 PERT method. How to draw PERT network? Kind of constraints Concepts Steps to follow margins calculation Total margin Free margin. Advanced PERT Probabilistic PERT PERT costs Kind of constraints Execution of a project, often, requires succession of tasks linking by some constraints. - Constraints of time: Leadtime to respect in performing the task (taking account the time of using resources) - Constraints of anteriority: Some tasks must be executed befor others - Constraints of simultaneity: Some tasks are performed in the same time PERT (Program Evaluation and Review Technique) charts represents the project schedule as an activity network.
5 Concepts - Task of project is represented by node - Duration of task is represented by an arc (branch) -Start nodeand Finish node are also represented For each activity, these values are estimated ES Earliest start time EF Earliest finish time LS Latest start time LF Latest finish time The length of each path has to be calculated The LONGEST path in the project is the CRITICAL PATH Steps to follow To draw PERT, 6 Big steps are required. Establish a list of tasks. Determine anteriority conditions 3. Draw PERT network. Calculate the earliest and latest dates 5. Calculation of margins 6.Found the critical path of the project 5
6 Steps to follow. Establish a list of tasks Enounce a list of tasks to perform Assess the durations of tasks (processing times) to determine the required resources Assign a codification to tasks to make easier the construction of the network. Establish a list of tasks Exemple : The building of storage warehouse Tasks Duration (t.u) A Study, realization and acceptance of plans B Preparation of the ground C Order materials (wood, bricks, cement, sheet for the roof) D Digging of the foundations E Doors, Windows orders F Delivery of materials G Casting of the foundations H Delivery of doors, windows 0 I Construction of the walls, the roof J Installation doors and windows 6
7 Steps to follow To draw PERT, 5 big steps are required. Determine anteriority conditions By answering these questions : Which task must be ended before another could start? Which task have to follow some tasks?. Determine anteriority conditions Previous tasks Task Following tasks - A C,D,E - B D A C F A,B D G A E H C F G D,F G I E H J G I J H,I J - 7
8 Steps to follow 3. Draw PERT network Network is made of enounced tasks. Tasks are the node and arcs are constraints of precedence E H 0 0 Start 0 A C F G I J End 0 B D. Calculate the earliest and latest dates Earliest start date of task i: The earliest date on which task i could start taking account the required time to process previous tasks Task i ESi ES = max( ES + p i j P(i) j ji ) Latest start date of task j: Task LSi The latest date on which task i must i absolutely start in order to not disturb and delay the overall project. LSi = min( LS j pij ) j F(i) 8
9 . Calculation of ES and LS 0/0 Start 0 0 0/0 A B D 0/7 /9 / 6/6 E H /7 C 5/8 7/0 F G I J 9/ 6/6 0 7/7 End ESi: Forward computation LSi: Backward computation 5. Calculation of margins Total margin Allowed flexibility for task without changing project duration M T i = LSi ESi 0 ESi Task i LSi MT EEi MT EEi Free margin Allowed flexibility of task i without delaying following tasks M F i = min( ES pij ESi) 0 j Task i EEi MF ESj Task j 9
10 6. Find a critical path / 6/6 E H 0/0 Start 0 0 0/0 /7 5/8 7/0 A C F G I J 9/ 6/6 B D 0/7 /9 Find the critical path each task whose MT=O Project duration (critical path) = 7 t.u Critical tasks are: A, E, H, J 0 TASK MT MF A 0 0 B 7 C 3 0 D 5 E 0 0 F 3 0 G 3 0 H 0 0 I 3 3 J 0 0 7/7 End P.E.R.T method. How to draw PERT network? Kind of constraints Concepts Steps to follow margins calculation Total margin Free margin. Advanced P.E.R.T Probabilistic PERT PERT costs 0
11 Probabilistic PERT Inside project appears some difficulties to get the exact durations of tasks Probabilistic PERT considers the uncertainity about the dates and durations of tasks Uncertainity of durations? Necessity to taking account delay variation in margins computations For each task, it is important to define to: Optimistic time, tr: realistic time (the most probabilistic) tp: pessemistic time Probabilistic PERT An assessment of random duration of tasks often follows probability distribution of type β β distribution is characterized by these parameters: Frequency of time existence The mean m Variance V Standard deviation σ to + tr + tp moyenne Mean = tm = 6 ( tp to) V = 6 to tr tm tp Time
12 Probabilistic PERT Objectives Probabilistic PERT allows to determine the probability of fulfilling project in certain duration with variable task s durations What is the probability that project would be performed in x units of time? Total duration of project is distributed according «normale distribution» gaussian curve, with a mean m equal to the sum of average durations of critical tasks The variance of sum of random variables is equal to the sum of variables. It becomes possible to determine standard deviation of critical path. n σ = σ i= i Probabilistic PERT Notions: Gauss/normal distribution * Sets of data to collect: Weights, Heights * Number of results (pulling) according to a sample Study of the distribution Normal distribution if the found values are distributed around a mean μ with standard deviation sigma σ Noted N(μ, σ ) Z has a standard normal distribution Z N(0, ), mean 0 and variance Its probability density function is usually denoted by F and is given by If X has a general normal distribution X~N(μ, σ ) Z P(X<Z) = F(Z) P(X<Z) = F(Z) It is necessary to transform in order to use probabilistic table: Standradizing transformation is of upmost importance. Then Z, defined by the standardizing transformation has a standard normal distribution.
13 Probabilistic PERT Once the mean and standard deviation calculated, the probability of realization is deduced The probability of realizing project of duration T in x unit of times P(T X) z X tm p ( T X ) = p T = F(Z) α ) σ F(Z) π(α) is a value to find in the table of normal distribution (it is a probability) Probabilistic PERT Normale distribution z Distribution function F(Z) Z Represent a probability F(-Z) =? 3
14 Probabilistic PERT: exercise The project manager of a Warehouse building has just made the assessment of durations. Task Durations (u.t) Previous Optim Real Pess tasks A 3 5 C, G, L B 3,5 8 - C 3 B, H D,5 3,5 7,5 B E B, G, L F A, D G D H,5 6 B I,5,5 6,5 J J 3 G, L K 9 A, F, I L,5 5 B, C, H Probabilistic PERT: exercise Classical PERT: Build the network of the project Calculate the average durations for each task Determine margins (free and total) for each task Deduce the critical path of this project Probabilistic PERT What is the probability to realize the construction in 35 days? What is the probability to realize the project in 9 days? What would be the limit path duration that ensures probability of 95% to realize the building
15 Probabilistic PERT : exercise Tâche to tr tp tm A 3 5 B 3,5 8 C 3 5 D,5 3,5 7,5 E F G to + tr + tp H,5 6 3 mean = tm = I,5,5 6,5 3 6 J 3 3 K 9 3 L,5 5 The mean of the values (tm) follows β distribution moyenne Continue to solve the problem 30 5
11/8/2018. Overview. PERT / CPM Part 2
/8/08 PERT / CPM Part BSAD 0 Dave Novak Fall 08 Source: Anderson et al., 0 Quantitative Methods for Business th edition some slides are directly from J. Loucks 0 Cengage Learning Overview Last class introduce
More informationCHAPTER 12. (The interpretation of the symbols used in the equations is given in page 3)
CHAPTER 12 The equations needed: (The interpretation of the symbols used in the equations is given in page 3) 1. ATI = t D 35 4. ws = I average weekly CU 2. I turn = CU I average 5. ds = I average daily
More informationProject Time Planning. Ahmed Elyamany, PhD
Project Time Planning Ahmed Elyamany, PhD 1 What is Planning The Development of a workable program of operations to accomplish established objectives when put into action. Done before project starts Planning
More informationPROGRAMMING CPM. Network Analysis. Goal:
PROGRAMMING CPM 5/21/13 Network Analysis Goal: Calculate completion time Calculate start and finish date for each activity Identify critical activities Identify requirements and flows of resources (materials,
More information. Introduction to CPM / PERT Techniques. Applications of CPM / PERT. Basic Steps in PERT / CPM. Frame work of PERT/CPM. Network Diagram Representation. Rules for Drawing Network Diagrams. Common Errors
More informationChapter 16: Program Evaluation and Review Techniques (PERT)
Chapter 16: Program Evaluation and Review Techniques (PERT) PERT PERT is a method for determining the length of a construction project and the probability of project completion by a specified date PERT
More informationA scheme developed by Du Pont to figure out
CPM Project Management scheme. A scheme developed by Du Pont to figure out Length of a normal project schedule given task durations and their precedence in a network type layout (or Gantt chart) Two examples
More informationNetwork Techniques - I. t 5 4
Performance:Slide.doc Network Techniques - I. t s v u PRT time/cost : ( Program valuation & Review Technique ) vent-on-node typed project-model with probabilistic (stochastic) data set as weights (inp)
More information4. Network Calculations
Construction Project Management (CE 110401346) 4. Network Calculations Dr. Khaled Hyari Department of Civil Engineering Hashemite University Calculations On a Precedence Network I Early Activity Start
More informationNetwork analysis. A project is a temporary endeavor undertaken to create a "unique" product or service
Network analysis Introduction Network analysis is the general name given to certain specific techniques which can be used for the planning, management and control of projects. One definition of a project
More informationSAMPLE STUDY MATERIAL. GATE, IES & PSUs Civil Engineering
SAMPLE STUDY MATERIAL Postal Correspondence Course GATE, IES & PSUs Civil Engineering CPM & CONSTRUCTION EQUIPMENT C O N T E N T 1. CPM AND PERT... 03-16 2. CRASHING OF NETWORK... 17-20 3. ENGINEERING
More informationProject Planning & Control Prof. Koshy Varghese Department of Civil Engineering Indian Institute of Technology, Madras
Project Planning & Control Prof. Koshy Varghese Department of Civil Engineering Indian Institute of Technology, Madras (Refer Slide Time: 00:16) Lecture - 52 PERT Background and Assumptions, Step wise
More informationMSA 640 Homework #2 Due September 17, points total / 20 points per question Show all work leading to your answers
Name MSA 640 Homework #2 Due September 17, 2010 100 points total / 20 points per question Show all work leading to your answers 1. The annual demand for a particular type of valve is 3,500 units. The cost
More informationMEI Decision Mathematics 1
Chapter assessment MEI Decision Mathematics Critical Path Analysis. The diagram below shows a precedence network for a particular project. 9 A() D(4) I(8) Durations are in days B() E() H(5) J(4) L() 5
More informationBenefits of PERT/CPM. 2018, Jayant Rajgopal
Project: ny set of complex, interrelated activities aimed at some specific goal. Typically, characterized by a clear starting point and a clear end point. Examples: onstruction (buildings, roads, bridges,
More information(1) The starting point is the precedence table (aka dependence table) Immediately preceding activities
Critical Path Analysis (10 pages; 1/5/16) fmng.uk (1) The starting point is the precedence table (aka dependence table) Example Activity Duration Immediately preceding activities A 4 - B 5 - C 6 A,B D
More informationProject management model for constructing a renewable energy plant
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 74 (207 ) 45 54 206 Global Congress on Manufacturing and Management Project management model for constructing a renewable energy
More informationSolving Fuzzy PERT Using Gradual Real Numbers
Solving Fuzzy PERT Using Gradual Real Numbers Jérôme FORTIN a, Didier DUBOIS a, a IRIT/UPS 8 route de Narbonne, 3062, Toulouse, cedex 4, France, e-mail: {fortin, dubois}@irit.fr Abstract. From a set of
More informationSimple Counter-terrorism Decision
A Comparative Analysis of PRA and Intelligent Adversary Methods for Counterterrorism Risk Management Greg Parnell US Military Academy Jason R. W. Merrick Virginia Commonwealth University Simple Counter-terrorism
More informationOperation management
Operation management Vigneron Loic December 3, 2008 1 Operations and productivity 1.1 Productivity Productivity = Units produced Imput used Units produced Labor productivity = Labor hours used One resource
More informationUsing Neutrosophic Sets to Obtain PERT Three-Times Estimates in Project Management
Using Neutrosophic Sets to Obtain PERT Three-Times Estimates in Project Management Mai Mohamed 1* Department of Operations Research Faculty of Computers and Informatics Zagazig University Sharqiyah Egypt
More information2. Project management
2. Project management In what follows, we consider production processes where only a single item of a specific product is produced in the planning horizon In this case specific instruments for planning
More informationST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1
ST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1 SUB:OPERATION RESEARCH CLASS: III B.SC SUB CODE:EMT617S SUB INCHARGE:S.JOHNSON SAVARIMUTHU 2 MARKS QUESTIONS 1. Write the general model of
More informationQi Jian-xun,Sun Dedong
Physics Procedia 24 (2012) 1530 1540 2012 International Conference on Applied Physics and Industrial Engineering One Improvement Method of Reducing Duration Directly to Solve Time-Cost Tradeoff Problem
More informationSample Chapter. Basic Hard Systems. Engineering: Part I
Basic Hard Systems 10 Engineering: Part I 10.1 Introduction: Hard Systems Analysis In Chapter 1 we dealt briefly with the rudiments of the systems approach to problem solving. In this chapter, we begin
More informationLet s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc.
Finite State Machines Introduction Let s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc. Such devices form
More informationA Critical Path Problem Using Triangular Neutrosophic Number
A Critical Path Problem Using Triangular Neutrosophic Number Excerpt from NEUTROSOPHIC OPERATIONAL RESEARCH, Volume I. Editors: Prof. Florentin Smarandache, Dr. Mohamed Abdel-Basset, Dr. Yongquan Zhou.
More informationCoordinated Aggregation of Distributed Resources
Coordinated Aggregation of Distributed Resources UC Berkeley October 13, 2011 Coordinated Aggregation 1 of 39 Co-conspirators Anand Subramanian, Manuel Garcia, Josh Taylor [Berkeley Students] Duncan Callaway,
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 informationToward the Resolution of Resource Conflict in a MPL-CCPM Representation Approach
Toward the Resolution of Resource Conflict in a MPL-CCPM Representation Approach MUNENORI KASAHARA Nagaoka University of Technology Nagaoka, Niigata 940-2188 JAPAN s063349@ics.nagaokaut.ac.jp HIROTAKA
More informationProject Management Prof. Raghunandan Sengupta Department of Industrial and Management Engineering Indian Institute of Technology Kanpur
Project Management Prof. Raghunandan Sengupta Department of Industrial and Management Engineering Indian Institute of Technology Kanpur Module No # 07 Lecture No # 35 Introduction to Graphical Evaluation
More informationSome Practical Issues in Inference in Hybrid Bayesian Networks with Deterministic Conditionals
Some Practical Issues in Inference in Hybrid Bayesian Networks with Deterministic Conditionals Prakash P. Shenoy School of Business University of Kansas Lawrence, KS 66045-7601 USA pshenoy@ku.edu Rafael
More informationA heuristic algorithm for the Aircraft Landing Problem
22nd International Congress on Modelling and Simulation, Hobart, Tasmania, Australia, 3 to 8 December 2017 mssanz.org.au/modsim2017 A heuristic algorithm for the Aircraft Landing Problem Amir Salehipour
More informationVehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology
Vehicle Routing and Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Part II: Algorithmic Enhancements Handling Practical Complexities
More informationOverall Plan of Simulation and Modeling I. Chapters
Overall Plan of Simulation and Modeling I Chapters Introduction to Simulation Discrete Simulation Analytical Modeling Modeling Paradigms Input Modeling Random Number Generation Output Analysis Continuous
More informationEmbedded Systems - FS 2018
Institut für Technische Informatik und Kommunikationsnetze Prof. L. Thiele Embedded Systems - FS 2018 Sample solution to Exercise 3 Discussion Date: 11.4.2018 Aperiodic Scheduling Task 1: Earliest Deadline
More informationA Critical Path Problem Using Triangular Neutrosophic Number
A ritical Path Problem Using Triangular Neutrosophic Number Mai Mohamed 1 Department of Operations Research Faculty of omputers and Informatics Zagazig University, Sharqiyah, Egypt Yongquan Zhou 2 ollege
More informationSOLVING STOCHASTIC PERT NETWORKS EXACTLY USING HYBRID BAYESIAN NETWORKS
SOLVING STOCHASTIC PERT NETWORKS EXACTLY USING HYBRID BAYESIAN NETWORKS Esma Nur Cinicioglu and Prakash P. Shenoy School of Business University of Kansas, Lawrence, KS 66045 USA esmanur@ku.edu, pshenoy@ku.edu
More informationNeutrosophic Sets, Project, Project Management, Gantt chart, CPM, PERT, Three-Time Estimate.
Using Neutrosophic Sets to Obtain PERT Three-Times Estimates in Project Management Excerpt from NEUTROSOPHIC OPERATIONAL RESEARCH, Volume I. Editors: Prof. Florentin Smarandache, Dr. Mohamed Abdel-Basset,
More informationDuration of online examination will be of 1 Hour 20 minutes (80 minutes).
Program Name: SC Subject: Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70 Duration: 80 mins Online Examination: Online examination is a Computer based examination.
More informationChapter 7 (Cont d) PERT
Chapter 7 (Cont d) PERT Project Management for Business, Engineering, and Technology Prepared by John Nicholas, Ph.D. Loyola University Chicago & Herman Steyn, PhD University of Pretoria Variability of
More informationTime Planning and Control. Time-Scaled Network
Time Planning and Control Time-Scaled Network Processes of Time Planning and Control 1.Visualize and define the activities..sequence the activities (Job Logic). 3.stimate the activity duration. 4.Schedule
More informationAnalysis of real-time system conflict based on fuzzy time Petri nets
Journal of Intelligent & Fuzzy Systems 26 (2014) 983 991 DOI:10.3233/IFS-130789 IOS Press 983 Analysis of real-time system conflict based on fuzzy time Petri nets Zhao Tian a,, Zun-Dong Zhang a,b, Yang-Dong
More informationCHAPTER-3 MULTI-OBJECTIVE SUPPLY CHAIN NETWORK PROBLEM
CHAPTER-3 MULTI-OBJECTIVE SUPPLY CHAIN NETWORK PROBLEM 3.1 Introduction A supply chain consists of parties involved, directly or indirectly, in fulfilling customer s request. The supply chain includes
More informationM.SC. MATHEMATICS - II YEAR
MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. MATHEMATICS - II YEAR DKM24 - OPERATIONS RESEARCH (From the academic year 2016-17)
More informationChapter 2. Planning Criteria. Turaj Amraee. Fall 2012 K.N.Toosi University of Technology
Chapter 2 Planning Criteria By Turaj Amraee Fall 2012 K.N.Toosi University of Technology Outline 1- Introduction 2- System Adequacy and Security 3- Planning Purposes 4- Planning Standards 5- Reliability
More informationA Critical Path Problem in Neutrosophic Environment
A Critical Path Problem in Neutrosophic Environment Excerpt from NEUTROSOPHIC OPERATIONAL RESEARCH, Volume I. Editors: Prof. Florentin Smarandache, Dr. Mohamed Abdel-Basset, Dr. Yongquan Zhou. Foreword
More informationThe Economics of E-commerce and Technology
The Economics of E-commerce and Technology Case Studies 1 Case Study Method } Management is a skill rather than a set of techniques } Requires practice on real problems } Problem sets not enough } A case
More informationProactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Journal of Artificial Intelligence Research 28 (2007) 183 232 Submitted 5/06; published 3/07 Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations J. Christopher Beck jcb@mie.utoronto.ca
More informationScheduling Markovian PERT networks to maximize the net present value: new results
Scheduling Markovian PERT networks to maximize the net present value: new results Hermans B, Leus R. KBI_1709 Scheduling Markovian PERT networks to maximize the net present value: New results Ben Hermans,a
More informationMathematics (JUN13MD0201) General Certificate of Education Advanced Level Examination June Unit Decision TOTAL.
Centre Number Candidate Number For Examiner s Use Surname Other Names Candidate Signature Examiner s Initials Mathematics Unit Decision 2 Thursday 13 June 2013 General Certificate of Education Advanced
More informationM.Sc. (Final) DEGREE EXAMINATION, MAY Final Year STATISTICS. Time : 03 Hours Maximum Marks : 100
(DMSTT21) M.Sc. (Final) DEGREE EXAMINATION, MAY - 2013 Final Year STATISTICS Paper - I : Statistical Quality Control Time : 03 Hours Maximum Marks : 100 Answer any Five questions All questions carry equal
More informationTime-optimal scheduling for high throughput screening processes using cyclic discrete event models
Mathematics and Computers in Simulation 66 2004 181 191 ime-optimal scheduling for high throughput screening processes using cyclic discrete event models E. Mayer a,, J. Raisch a,b a Fachgruppe System
More informationClassify a transfer function to see which order or ramp it can follow and with which expected error.
Dr. J. Tani, Prof. Dr. E. Frazzoli 5-059-00 Control Systems I (Autumn 208) Exercise Set 0 Topic: Specifications for Feedback Systems Discussion: 30.. 208 Learning objectives: The student can grizzi@ethz.ch,
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 informationCompletion Time of Fuzzy GERT-type Networks with Loops
Completion Time of Fuzzy GERT-type Networks with Loops Sina Ghaffari 1, Seyed Saeid Hashemin 2 1 Department of Industrial Engineering, Ardabil Branch, Islamic Azad university, Ardabil, Iran 2 Department
More informationHow to deal with uncertainties and dynamicity?
How to deal with uncertainties and dynamicity? http://graal.ens-lyon.fr/ lmarchal/scheduling/ 19 novembre 2012 1/ 37 Outline 1 Sensitivity and Robustness 2 Analyzing the sensitivity : the case of Backfilling
More informationPlanning and Scheduling of batch processes. Prof. Cesar de Prada ISA-UVA
Planning and Scheduling of batch processes Prof. Cesar de Prada ISA-UVA prada@autom.uva.es Outline Batch processes and batch plants Basic concepts of scheduling How to formulate scheduling problems Solution
More information57:022 Principles of Design II Midterm Exam #2 Solutions
57:022 Principles of Design II Midterm Exam #2 Solutions Part: I II III IV V Total Possible Pts: 20 15 12 16 12 75 PART ONE Indicate "+" if True and "O" if False: _+_a. If a component's lifetime has exponential
More informationRobust optimization for resource-constrained project scheduling with uncertain activity durations
Robust optimization for resource-constrained project scheduling with uncertain activity durations Christian Artigues 1, Roel Leus 2 and Fabrice Talla Nobibon 2 1 LAAS-CNRS, Université de Toulouse, France
More informationAn introduction to biostatistics: part 1
An introduction to biostatistics: part 1 Cavan Reilly September 6, 2017 Table of contents Introduction to data analysis Uncertainty Probability Conditional probability Random variables Discrete random
More informationA Probabilistic Framework for solving Inverse Problems. Lambros S. Katafygiotis, Ph.D.
A Probabilistic Framework for solving Inverse Problems Lambros S. Katafygiotis, Ph.D. OUTLINE Introduction to basic concepts of Bayesian Statistics Inverse Problems in Civil Engineering Probabilistic Model
More informationRisk Analysis Framework for Severe Accident Mitigation Strategy in Nordic BWR: An Approach to Communication and Decision Making
International Topical Meeting on Probabilistic Safety Assessment And Analysis, PSA 2017, September 24-28, 2017. Pittsburgh, PA. Risk Analysis Framework for Severe Accident Mitigation Strategy in Nordic
More informationBig 5 TH. The. Event THURSDAY. Why attend? Register today SEPTEMBER. FREE breakfast cobs and lunch provided. at Jewson Peterborough
The Big Event Register today Why attend? at Jewson Peterborough To secure your place call 01733 561 414 or email jason.fovargue@jewson.co.uk. Trade and public welcome Sustainable Building seminars every
More informationProving the central limit theorem
SOR3012: Stochastic Processes Proving the central limit theorem Gareth Tribello March 3, 2019 1 Purpose In the lectures and exercises we have learnt about the law of large numbers and the central limit
More informationApproximation Algorithms for scheduling
Approximation Algorithms for scheduling Ahmed Abu Safia I.D.:119936343, McGill University, 2004 (COMP 760) Approximation Algorithms for scheduling Leslie A. Hall The first Chapter of the book entitled
More informationNew Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks
New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks Patrick Andersen February 27, 2014 This project explores a recently developed type of scheduling problem that combines the two Operations
More informationCS325: Analysis of Algorithms, Fall Final Exam
CS: Analysis of Algorithms, Fall 0 Final Exam I don t know policy: you may write I don t know and nothing else to answer a question and receive percent of the total points for that problem whereas a completely
More informationGuidance document on How to perform a shredder campaign Background information
Guidance document on How to perform a shredder campaign Background information Prepared by ÖKOPOL GmbH Institut für Ökologie und Politik Nernstweg 32 34 D 22765 Hamburg www.oekopol.de info@oekopol.de Content
More information5. AN INTRODUCTION TO BUILDING PHYSICS
5. AN INTRODUCTION TO BUILDING PHYSICS P. Wouters, S. Martin ABSTRACT This chapter places the System Identification Competition in a broader context of evaluating the thermal performances of building components.
More informationProduct rule. Chain rule
Probability Recap CS 188: Artificial Intelligence ayes Nets: Independence Conditional probability Product rule Chain rule, independent if and only if: and are conditionally independent given if and only
More informationThe Instability of Correlations: Measurement and the Implications for Market Risk
The Instability of Correlations: Measurement and the Implications for Market Risk Prof. Massimo Guidolin 20254 Advanced Quantitative Methods for Asset Pricing and Structuring Winter/Spring 2018 Threshold
More informationDigital Microelectronic Circuits ( ) Logical Effort. Lecture 7: Presented by: Adam Teman
Digital Microelectronic ircuits (361-1-3021 ) Presented by: Adam Teman Lecture 7: Logical Effort Digital Microelectronic ircuits The VLSI Systems enter - BGU Lecture 7: Logical Effort 1 Last Lectures The
More informationScheduling with Constraint Programming. Job Shop Cumulative Job Shop
Scheduling with Constraint Programming Job Shop Cumulative Job Shop CP vs MIP: Task Sequencing We need to sequence a set of tasks on a machine Each task i has a specific fixed processing time p i Each
More informationDynamic Power Management under Uncertain Information. University of Southern California Los Angeles CA
Dynamic Power Management under Uncertain Information Hwisung Jung and Massoud Pedram University of Southern California Los Angeles CA Agenda Introduction Background Stochastic Decision-Making Framework
More informationNon-arithmetic approach to dealing with uncertainty in fuzzy arithmetic
Non-arithmetic approach to dealing with uncertainty in fuzzy arithmetic Igor Sokolov rakudajin@gmail.com Moscow State University Moscow, Russia Fuzzy Numbers Fuzzy logic was introduced mainly due to the
More informationSYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: production and operations management
Sample Questions: Section I: Subjective Questions 1. What are the inputs required to plan a master production schedule? 2. What are the different operations schedule types based on time and applications?
More informationB. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1)
B. Maddah INDE 504 Discrete-Event Simulation Output Analysis (1) Introduction The basic, most serious disadvantage of simulation is that we don t get exact answers. Two different runs of the same model
More informationCritical Paths Identification on Fuzzy Network Project
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 1 Ver. VI (Jan - Feb. 2015), PP 49-54 www.iosrjournals.org Critical Paths Identification on Fuzzy Network Project
More informationEmbedded Systems 14. Overview of embedded systems design
Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The
More informationFuzzy Numerical Results Derived From Crashing CPM/PERT Networks of Padma Bridge in Bangladesh
Fuzzy Numerical Results Derived From Crashing CPM/PERT Networks of Padma Bridge in Bangladesh Md. Mijanoor Rahman 1, Mrinal Chandra Barman 2, Sanjay Kumar Saha 3 1 Assistant Professor, Department of Mathematics,
More informationIntro. ANN & Fuzzy Systems. Lecture 15. Pattern Classification (I): Statistical Formulation
Lecture 15. Pattern Classification (I): Statistical Formulation Outline Statistical Pattern Recognition Maximum Posterior Probability (MAP) Classifier Maximum Likelihood (ML) Classifier K-Nearest Neighbor
More informationCHAPTER 8 Viterbi Decoding of Convolutional Codes
MIT 6.02 DRAFT Lecture Notes Fall 2011 (Last update: October 9, 2011) Comments, questions or bug reports? Please contact hari at mit.edu CHAPTER 8 Viterbi Decoding of Convolutional Codes This chapter describes
More informationTractable Inference in Hybrid Bayesian Networks with Deterministic Conditionals using Re-approximations
Tractable Inference in Hybrid Bayesian Networks with Deterministic Conditionals using Re-approximations Rafael Rumí, Antonio Salmerón Department of Statistics and Applied Mathematics University of Almería,
More informationModeling Uncertainty in Linear Programs: Stochastic and Robust Linear Programming
Modeling Uncertainty in Linear Programs: Stochastic and Robust Programming DGA PhD Student - PhD Thesis EDF-INRIA 10 November 2011 and motivations In real life, Linear Programs are uncertain for several
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 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 informationPareto Efficiency in Robust Optimization
Pareto Efficiency in Robust Optimization Dan Iancu Graduate School of Business Stanford University joint work with Nikolaos Trichakis (HBS) 1/26 Classical Robust Optimization Typical linear optimization
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 informationComplexity of Routing Problems with Release Dates and Deadlines
Complexity of Routing Problems with Release Dates and Deadlines Alan Erera, Damian Reyes, and Martin Savelsbergh H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology
More informationApplications of Petri Nets
Applications of Petri Nets Presenter: Chung-Wei Lin 2010.10.28 Outline Revisiting Petri Nets Application 1: Software Syntheses Theory and Algorithm Application 2: Biological Networks Comprehensive Introduction
More informationReal-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm
Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should
More information30.3. LU Decomposition. Introduction. Prerequisites. Learning Outcomes
LU Decomposition 30.3 Introduction In this Section we consider another direct method for obtaining the solution of systems of equations in the form AX B. Prerequisites Before starting this Section you
More informationCompletion Time in Dynamic PERT Networks 57 job are nished, as well as that the associated service station has processed the same activity of the prev
Scientia Iranica, Vol. 14, No. 1, pp 56{63 c Sharif University of Technology, February 2007 Project Completion Time in Dynamic PERT Networks with Generating Projects A. Azaron 1 and M. Modarres In this
More informationLogical Time. 1. Introduction 2. Clock and Events 3. Logical (Lamport) Clocks 4. Vector Clocks 5. Efficient Implementation
Logical Time Nicola Dragoni Embedded Systems Engineering DTU Compute 1. Introduction 2. Clock and Events 3. Logical (Lamport) Clocks 4. Vector Clocks 5. Efficient Implementation 2013 ACM Turing Award:
More informationEE 302 Division 1. Homework 6 Solutions.
EE 3 Division. Homework 6 Solutions. Problem. A random variable X has probability density { C f X () e λ,,, otherwise, where λ is a positive real number. Find (a) The constant C. Solution. Because of the
More informationMBA Statistics COURSE #4
MBA Statistics 51-651-00 COURSE #4 Simple and multiple linear regression What should be the sales of ice cream? Example: Before beginning building a movie theater, one must estimate the daily number of
More informationR O B U S T E N E R G Y M AN AG E M E N T S Y S T E M F O R I S O L AT E D M I C R O G R I D S
ROBUST ENERGY MANAGEMENT SYSTEM FOR ISOLATED MICROGRIDS Jose Daniel La r a Claudio Cañizares Ka nka r Bhattacharya D e p a r t m e n t o f E l e c t r i c a l a n d C o m p u t e r E n g i n e e r i n
More informationLab 2: Photon Counting with a Photomultiplier Tube
Lab 2: Photon Counting with a Photomultiplier Tube 1 Introduction 1.1 Goals In this lab, you will investigate properties of light using a photomultiplier tube (PMT). You will assess the quantitative measurements
More informationBayesian Networks 2:
1/27 PhD seminar series Probabilistics in Engineering : Bayesian networks and Bayesian hierarchical analysis in engineering Conducted by Prof. Dr. Maes, Prof. Dr. Faber and Dr. Nishijima Bayesian Networks
More information