Benchmarking Non-First-Come-First-Served Component Allocation in an Assemble-To-Order System
|
|
- Everett McDowell
- 5 years ago
- Views:
Transcription
1 Benchmarking Non-First-Come-First-Served Component Allocation in an Assemble-To-Order System Kai Huang McMaster University June 4, 2013 Kai Huang (McMaster University) Fields Institute June 4, / 26
2 Table of Contents 1 Introduction 2 Non-First-Come-First-Served Component Allocation Last-Come-First-Served-Within-One-Period (LCFP) Product-Based-Priority-Within-Time-Windows (PTW) 3 Demand Fulfillment Rates Demand Fulfillment Rates of the LCFP Rule Demand Fulfillment Rates of the PTW Rule 4 Inventory Replenishment Policy Base Stock Level Optimization of the LCFP Rule Base Stock Level Optimization of the PTW Rule 5 Benchmark Models 6 Numerical Experiment 7 Conclusions Kai Huang (McMaster University) Fields Institute June 4, / 26
3 Assemble-To-Order System (ATOS) Two levels: Products and components.? F A J I F K? J I H A F A E I D A J? K I J A A Kai Huang (McMaster University) Fields Institute June 4, / 26
4 Assemble-To-Order System (ATOS) Two levels: Products and components.? F A J I F K? J I H A F A E I D A J In the middle of single-echelon and two-echelon.? K I J A A Kai Huang (McMaster University) Fields Institute June 4, / 26
5 Assemble-To-Order System (ATOS) Assumptions: Periodic review. Kai Huang (McMaster University) Fields Institute June 4, / 26
6 Assemble-To-Order System (ATOS) Assumptions: Periodic review. Independent base stock policy for each component. Kai Huang (McMaster University) Fields Institute June 4, / 26
7 Assemble-To-Order System (ATOS) Assumptions: Periodic review. Independent base stock policy for each component. Consignment policy: once a unit of component is assigned to an order, it is not available to other orders anymore even if it still stays in the inventory. Kai Huang (McMaster University) Fields Institute June 4, / 26
8 Assemble-To-Order System (ATOS) Assumptions: Periodic review. Independent base stock policy for each component. Consignment policy: once a unit of component is assigned to an order, it is not available to other orders anymore even if it still stays in the inventory. Optimization problems: Base stock level optimization. Component allocation optimization. Kai Huang (McMaster University) Fields Institute June 4, / 26
9 Last-Come-First-Served-Within-One-Period (LCFP) In a period, the unfulfilled orders come from t 1,t 1 +1,,t 1,t: FCFS: Fulfill the orders in the sequence t1,t 1 +1,,t 1,t. LCFP: Fulfill the orders in the sequence t,t1,t 1 +1,,t 1. Kai Huang (McMaster University) Fields Institute June 4, / 26
10 Product-Based-Priority-Within-Time-Windows (PTW) Each product has a priority j and a time window w j. Kai Huang (McMaster University) Fields Institute June 4, / 26
11 Product-Based-Priority-Within-Time-Windows (PTW) Each product has a priority j and a time window w j. Product j can only be considered for fulfillment from period t +w j onward. Kai Huang (McMaster University) Fields Institute June 4, / 26
12 Product-Based-Priority-Within-Time-Windows (PTW) Each product has a priority j and a time window w j. Product j can only be considered for fulfillment from period t +w j onward. The fulfillment follows the priority list. Kai Huang (McMaster University) Fields Institute June 4, / 26
13 Product-Based-Priority-Within-Time-Windows (PTW) Each product has a priority j and a time window w j. Product j can only be considered for fulfillment from period t +w j onward. The fulfillment follows the priority list. Example: Let w 1 = 0,w 2 = 1,w 3 = 2. Then the sequence of satisfying the demands P 1,t,P 2,t,P 3,t will be P 1,t,P 2,t 1,P 3,t 2,P 1,t+1,P 2,t,P 3,t 1,P 1,t+2,P 2,t+1,P 3,t. Kai Huang (McMaster University) Fields Institute June 4, / 26
14 Demand Fulfillment Rates of the LCFP Rule The amount of inventory committed to the demand D i,t should be E i,t = Min{(S i D i [t L i 1,t 1]) + +D i,t Li 1,D i,t }, while in FCFS, this amount is Min{(S i D i [t L i,t 1]) +,D i,t }. Kai Huang (McMaster University) Fields Institute June 4, / 26
15 Demand Fulfillment Rates of the LCFP Rule (Zero Time Window) Lemma The available on-hand inventory at the end of period t is (S i D i [t L i,t]) + under the LCFP rule, which is the same as that under the FCFS rule. Theorem The demand D i,t will be satisfied exactly in period t if and only if (S i D i [t L i 1,t 1]) + +D i,t Li 1 D i,t under the LCFP rule. Kai Huang (McMaster University) Fields Institute June 4, / 26
16 Demand Fulfillment Rates of the LCFP Rule (Positive Time Window) Theorem The demand D i,t will be satisfied within a time window w 1 if and only if (S i D i [t L i 1,t 1]) + +D i,t Li 1 D i,t (i.e. E i,t = D i,t ), or, (S i D i [t L i 1,t 1]) + +D i,t Li 1 < D i,t (i.e. E i,t < D i,t ) and S i D i [t L i +w,t] w s=1 E i,t+s 0, under the LCFP rule. Kai Huang (McMaster University) Fields Institute June 4, / 26
17 Demand Fulfillment Rates of the PTW Rule (Zero Time Window) Theorem When the PTW rule is applied, the net inventory just before satisfying the demand a ij P j,t in period t +w j is: S i D i [t L i +w j,t 1] k:k<j s:s t,s+w k t+w j a ik P k,s + k:k>j s:s<t,s+w k t+w j a ik P k,s. Kai Huang (McMaster University) Fields Institute June 4, / 26
18 Demand Fulfillment Rates of the PTW Rule (Positive Time Window) Theorem When the PTW rule is applied, the net inventory just before satisfying the demand a ij P j,t in period t +w j +δ j is: S i D i [t L i +w j +δ j,t 1] k:k<j s:s t,s+w k t+w j a ik P k,s + k:k>j s:s<t,s+w k t+w j a ik P k,s. Kai Huang (McMaster University) Fields Institute June 4, / 26
19 Base Stock Level Optimization of the LCFP Rule Min c i S i i M s.t. P{(S i D L i+1 i ) + +D i,t Li 1 D i,t, i : a ij > 0} α j j. Kai Huang (McMaster University) Fields Institute June 4, / 26
20 Base Stock Level Optimization of the LCFP Rule Observation Assume the LCFP rule is applied, and the demands in the same period follow a multi-variate normal distribution, and the demands from different periods are i.i.d. Let X be defined as: {S : P{(S i D L i+1 i ) + +D i,t Li 1 D i,t, i : a ij > 0} α j j}, where S = (S i ) i M R M + is the vector of nonnegative base stock levels. The set X is not necessarily convex. Kai Huang (McMaster University) Fields Institute June 4, / 26
21 Illustration S S 1 Kai Huang (McMaster University) Fields Institute June 4, / 26
22 Base stock Level Optimization of the PTW Rule where Min c i S i i M s.t. P{X j it S i, i : a ij > 0} α j j. X j it = D i [t L i +w j,t 1] + k:k j 0 q w j w k a ik P k,t+q k:k>j 0<q w k wj a ikp k,t q. Kai Huang (McMaster University) Fields Institute June 4, / 26
23 Base stock Level Optimization of the PTW Rule Theorem Assume the PTW rule is applied, and the demands in the same period follow a multi-variate normal distribution, and the demands from different periods are i.i.d. Let X be defined as: {S : P{X j it S i, i : a ij > 0} α j j}, where S = (S i ) i M R M + The set X is convex. is the vector of nonnegative base stock levels. Kai Huang (McMaster University) Fields Institute June 4, / 26
24 Solution Strategies Use the Sample Average Approximation algorithm to solve the base stock level optimization of the LCFP rule. Kai Huang (McMaster University) Fields Institute June 4, / 26
25 Solution Strategies Use the Sample Average Approximation algorithm to solve the base stock level optimization of the LCFP rule. Use a line search algorithm to solve the base stock level optimization of the PTW rule. Kai Huang (McMaster University) Fields Institute June 4, / 26
26 Observation of Component Allocation Optimizaiton under FCFS Theorem For a periodic review ATO system with component base stock policy and FCFS allocation, let x jk be the number of product j assembled in period t +k for the demand P j,t. Then the set of feasible component allocation decisions x = (x jk ) j,k is characterized by: X = {(x jk ) j,k : L+1 k µ=0 k µ=0 k=0 x jk = P j,t j N n j=1 a ijx jµ Oi k i M,k < k,k L n j=1 a ijx jµ = D i,t i M,k k,k L }, x jk Z + j N,k L where O k i = Min{(S i D i [t L i +k,t 1]) +,D i,t } and k = Min{k L : O k i = D i,t } and Z + is the set of nonnegative integers. Kai Huang (McMaster University) Fields Institute June 4, / 26
27 Benchmark for the Demand Fulfillment Rates under FCFS C 1 (S,ξ(ω)) = Min f 1 (S,ξ(ω),x,z) s.t. P j,t w j k=0 x jk P j,t z j j N z j {0,1} j N x X, where z = (z j ) j N and f 1 (S,ξ(ω),x,z) = n j=1 1 n z j. Kai Huang (McMaster University) Fields Institute June 4, / 26
28 Benchmark for the Operational Costs under FCFS where C 3 (S,ξ(ω)) = Min f 3 (S,ξ(ω),x) s.t. x X, f 3 (S,ξ(ω),x) = m i=1 h i[(s i D L i i ) + n j=1 a ijp j,t ] + + m L+1 n i=1 µ=0 j=1 a ijx jµ ) + n j=1 k=0 h i(oi k k L+1 k=0 b j(p j,t k µ=0 x jµ) Kai Huang (McMaster University) Fields Institute June 4, / 26
29 Instances Agrawal and Cohen (2001) Kai Huang (McMaster University) Fields Institute June 4, / 26
30 Instances Agrawal and Cohen (2001) Zhang (1997) Kai Huang (McMaster University) Fields Institute June 4, / 26
31 Instances Agrawal and Cohen (2001) Zhang (1997) Cheng et al. (2002) Kai Huang (McMaster University) Fields Institute June 4, / 26
32 Performance Measure of the LCFP Rule FCFS FS LCFS FS FCFS GCF LCFS GCF FCFS LFF LCFS LFF Benchmark Figure : Comparison of demand fulfillment rates Kai Huang (McMaster University) Fields Institute June 4, / 26
33 Performance Measure of the LCFP Rule FCFS FS 400 LCFS FS FCFS GCF 350 LCFS GCF FCFS LFF 300 LCFS LFF Benchmark Figure : Comparison of operatoinal costs Kai Huang (McMaster University) Fields Institute June 4, / 26
34 Performance Measure of the PTW Rule FCFS GCF 0.75 LCFS GCF FCFS LFF LCFS LFF 0.7 PTW PTW * Benchmark Figure : Comparison of demand fulfillment rates Kai Huang (McMaster University) Fields Institute June 4, / 26
35 Performance Measure of the PTW Rule FCFS GCF LCFS GCF FCFS LFF LCFS LFF PTW PTW * Benchmark Figure : Comparison of operational costs Kai Huang (McMaster University) Fields Institute June 4, / 26
36 Conclusions The consignment property is the key in the analysis of the non-fcfs component allocation policies. Kai Huang (McMaster University) Fields Institute June 4, / 26
37 Conclusions The consignment property is the key in the analysis of the non-fcfs component allocation policies. Chance-constrained programs naturally arise from ATO system optimization. Kai Huang (McMaster University) Fields Institute June 4, / 26
38 Conclusions The consignment property is the key in the analysis of the non-fcfs component allocation policies. Chance-constrained programs naturally arise from ATO system optimization. The Sample Average Approximation algorithm is viable in solving small to medium instances. Kai Huang (McMaster University) Fields Institute June 4, / 26
On Component Commonality for Assemble-to-Order Systems
On Component Commonality for Assemble-to-Order Systems Hongfeng Liang Advanced Optimization Laboratory McMaster University August 01, 2014 Joint work with Antoine Deza, Kai Huang, Xiao Jiao Wang Outline
More informationNo-Holdback Allocation Rules for Continuous-Time Assemble-to-Order Systems
OPERATIONS RESEARCH Vol. 58, No. 3, May June 2010, pp. 691 705 issn 0030-364X eissn 1526-5463 10 5803 0691 informs doi 10.1287/opre.1090.0785 2010 INFORMS No-Holdback Allocation Rules for Continuous-Time
More informationTHREE ESSAYS ON RESOURCE ALLOCATION PROBLEMS: INVENTORY MANAGEMENT IN ASSEMBLE-TO-ORDER SYSTEMS AND ONLINE ASSIGNMENT OF FLEXIBLE RESOURCES
The Pennsylvania State University The Graduate School Department of Management Science and Information Systems THREE ESSAYS ON RESOURCE ALLOCATION PROBLEMS: INVENTORY MANAGEMENT IN ASSEMBLE-TO-ORDER SYSTEMS
More informationOptimal Policies for an Assemble-to-Order N-System
Optimal Policies for an Assemble-to-Order N-System Lijian Lu Jing-Sheng Song Hanqin Zhang NUS Business School, National University of Singapore, Singapore Fuqua School of Business, Duke University, Durham,
More informationAsymptotically Optimal Inventory Control For Assemble-to-Order Systems
Asymptotically Optimal Inventory Control For Assemble-to-Order Systems Marty Reiman Columbia Univerisity joint work with Mustafa Dogru, Haohua Wan, and Qiong Wang May 16, 2018 Outline The Assemble-to-Order
More informationA Primal-Dual Algorithm for Computing a Cost Allocation in the. Core of Economic Lot-Sizing Games
1 2 A Primal-Dual Algorithm for Computing a Cost Allocation in the Core of Economic Lot-Sizing Games 3 Mohan Gopaladesikan Nelson A. Uhan Jikai Zou 4 October 2011 5 6 7 8 9 10 11 12 Abstract We consider
More informationModeling Flows of Engines Through Repair Facilities When Inputs Are Time-Varying
Modeling Flows of Engines Through Repair Facilities When Inputs Are Time-Varying John A. Muckstadt January, 2015 1 Introduction In this paper we present two types of models that can be employed to analyze
More informationA A Multi-Echelon Inventory Model for a Reparable Item with one-for. for- one Replenishment
A A Multi-Echelon Inventory Model for a Reparable Item with one-for for- one Replenishment Steve Graves, 1985 Management Science, 31(10) Presented by Hongmin Li This summary presentation is based on: Graves,
More informationA Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem
A Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem Dimitris J. Bertsimas Dan A. Iancu Pablo A. Parrilo Sloan School of Management and Operations Research Center,
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 1
MATH 56A: STOCHASTIC PROCESSES CHAPTER. Finite Markov chains For the sake of completeness of these notes I decided to write a summary of the basic concepts of finite Markov chains. The topics in this chapter
More informationThe Retail Planning Problem Under Demand Uncertainty. UCLA Anderson School of Management
The Retail Planning Problem Under Demand Uncertainty George Georgiadis joint work with Kumar Rajaram UCLA Anderson School of Management Introduction Many retail store chains carry private label products.
More informationChance Constrained Data Envelopment Analysis The Productive Efficiency of Units with Stochastic Outputs
Chance Constrained Data Envelopment Analysis The Productive Efficiency of Units with Stochastic Outputs Michal Houda Department of Applied Mathematics and Informatics ROBUST 2016, September 11 16, 2016
More informationAppendix - E-Companion
Article submitted to Operations Research; manuscript no. Please, provide the manuscript number! 1 Appendix - E-Companion Appendix A: Derivation of optimal supply volume The supply volume x 1 was treated
More informationProbability and Stochastic Processes Homework Chapter 12 Solutions
Probability and Stochastic Processes Homework Chapter 1 Solutions Problem Solutions : Yates and Goodman, 1.1.1 1.1.4 1.3. 1.4.3 1.5.3 1.5.6 1.6.1 1.9.1 1.9.4 1.10.1 1.10.6 1.11.1 1.11.3 1.11.5 and 1.11.9
More informationChapter 16 focused on decision making in the face of uncertainty about one future
9 C H A P T E R Markov Chains Chapter 6 focused on decision making in the face of uncertainty about one future event (learning the true state of nature). However, some decisions need to take into account
More informationPerformance Analysis and Evaluation of Assemble-to-Order Systems with Stochastic Sequential Lead Times
OPERATIONS RESEARCH Vol. 54, No. 4, July August 2006, pp. 706 724 issn 0030-364X eissn 1526-5463 06 5404 0706 informs doi 10.1287/opre.1060.0302 2006 INFORMS Performance Analysis and Evaluation of Assemble-to-Order
More informationExpected Time Delay in Multi-Item Inventory Systems with Correlated Demands
Expected Time Delay in Multi-Item Inventory Systems with Correlated Demands Rachel Q. Zhang Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109 Received
More information7.1 INTRODUCTION. In this era of extreme competition, each subsystem in different
7.1 INTRODUCTION In this era of extreme competition, each subsystem in different echelons of integrated model thrives to improve their operations, reduce costs and increase profitability. Currently, the
More informationA Customer-Item Decomposition Approach to Stochastic Inventory Systems with Correlation
A Customer-Item Decomposition Approach to Stochastic Inventory Systems with Correlation Yimin Yu Saif Benjaafar Program in Industrial and Systems Engineering University of Minnesota, Minneapolis, MN 55455
More informationThe Markov Decision Process (MDP) model
Decision Making in Robots and Autonomous Agents The Markov Decision Process (MDP) model Subramanian Ramamoorthy School of Informatics 25 January, 2013 In the MAB Model We were in a single casino and the
More informationOptimal Control of Stochastic Inventory System with Multiple Types of Reverse Flows. Xiuli Chao University of Michigan Ann Arbor, MI 48109
Optimal Control of Stochastic Inventory System with Multiple Types of Reverse Flows Xiuli Chao University of Michigan Ann Arbor, MI 4809 NCKU Seminar August 4, 009 Joint work with S. Zhou and Z. Tao /44
More information2001, Dennis Bricker Dept of Industrial Engineering The University of Iowa. DP: Producing 2 items page 1
Consider a production facility which can be devoted in each period to one of two products. For simplicity, we assume that the production rate is deterministic and that production is always at full capacity.
More informationThe network maintenance problem
22nd International Congress on Modelling and Simulation, Hobart, Tasmania, Australia, 3 to 8 December 2017 mssanz.org.au/modsim2017 The network maintenance problem Parisa Charkhgard a, Thomas Kalinowski
More informationComparison of Sums of Independent Identically Distributed Random Variables
Comparison of Sums of Independent Identically Distributed Random Variables S.J. Montgomery-Smith* Department of Mathematics, University of Missouri, Columbia, MO 65211. ABSTRACT: Let S k be the k-th partial
More informationOn spare parts optimization
On spare parts optimization Krister Svanberg Optimization and Systems Theory, KTH, Stockholm, Sweden. krille@math.kth.se This manuscript deals with some mathematical optimization models for multi-level
More informationIEOR 6711: Stochastic Models I. Solutions to Homework Assignment 9
IEOR 67: Stochastic Models I Solutions to Homework Assignment 9 Problem 4. Let D n be the random demand of time period n. Clearly D n is i.i.d. and independent of all X k for k < n. Then we can represent
More informationA Decomposition Approach for a Class of Capacitated Serial Systems 1
A Decomposition Approach for a Class of Capacitated Serial Systems 1 Ganesh Janakiraman 2 IOMS-OM Group Stern School of Business New York University 44 W. 4th Street, Room 8-71 New York, NY 10012-1126.
More informationOptimal Control of a Production-Inventory System with both Backorders and Lost Sales
Optimal Control of a Production-Inventory System with both Backorders and Lost Sales Saif Benjaafar Mohsen ElHafsi Tingliang Huang 3 Industrial & Systems Engineering, Department of Mechanical Engineering,
More information2-Vehicle Cost Varying Transportation Problem
Journal of Uncertain Systems Vol.8, No.1, pp.44-7, 14 Online at: www.jus.org.uk -Vehicle Cost Varying Transportation Problem Arpita Panda a,, Chandan Bikash Das b a Department of Mathematics, Sonakhali
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 informationCoordinated Replenishments at a Single Stocking Point
Chapter 11 Coordinated Replenishments at a Single Stocking Point 11.1 Advantages and Disadvantages of Coordination Advantages of Coordination 1. Savings on unit purchase costs.. Savings on unit transportation
More informationNeville s Method. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Neville s Method
Neville s Method MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have learned how to approximate a function using Lagrange polynomials and how to estimate
More informationEasy and not so easy multifacility location problems... (In 20 minutes.)
Easy and not so easy multifacility location problems... (In 20 minutes.) MINLP 2014 Pittsburgh, June 2014 Justo Puerto Institute of Mathematics (IMUS) Universidad de Sevilla Outline 1 Introduction (In
More informationImproving Supply Chain Performance: Real-Time Demand Information and Flexible Deliveries
Improving Supply Chain Performance: Real-Time Demand Information and Flexible Deliveries Kevin H. Shang Sean X. Zhou Geert-Jan van Houtum The Fuqua School of Business, Duke University, Durham, North Carolina
More informationChapter 3 Interpolation and Polynomial Approximation
Chapter 3 Interpolation and Polynomial Approximation Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Polynomial Interpolation
More informationOptimal and Heuristic Echelon ( r, nq, T ) Policies in Serial Inventory Systems with Fixed Costs
OPERATIONS RESEARCH Vol. 58, No. 2, March April 2010, pp. 414 427 issn 0030-364X eissn 1526-5463 10 5802 0414 informs doi 10.1287/opre.1090.0734 2010 INFORMS Optimal and Heuristic Echelon ( r, nq, T )
More informationBatch delivery scheduling with simple linear deterioration on a single machine 1
Acta Technica 61, No. 4A/2016, 281 290 c 2017 Institute of Thermomechanics CAS, v.v.i. Batch delivery scheduling with simple linear deterioration on a single machine 1 Juan Zou 2,3 Abstract. Several single
More informationOn service level measures in stochastic inventory control
On service level measures in stochastic inventory control Dr. Roberto Rossi The University of Edinburgh Business School, The University of Edinburgh, UK roberto.rossi@ed.ac.uk Friday, June the 21th, 2013
More informationGeneral Equilibrium with Production
General Equilibrium with Production Ram Singh Microeconomic Theory Lecture 11 Ram Singh: (DSE) General Equilibrium: Production Lecture 11 1 / 24 Producer Firms I There are N individuals; i = 1,..., N There
More informationON THE STRUCTURE OF OPTIMAL ORDERING POLICIES FOR STOCHASTIC INVENTORY SYSTEMS WITH MINIMUM ORDER QUANTITY
Probability in the Engineering and Informational Sciences, 20, 2006, 257 270+ Printed in the U+S+A+ ON THE STRUCTURE OF OPTIMAL ORDERING POLICIES FOR STOCHASTIC INVENTORY SYSTEMS WITH MINIMUM ORDER QUANTITY
More informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationExample: physical systems. If the state space. Example: speech recognition. Context can be. Example: epidemics. Suppose each infected
4. Markov Chains A discrete time process {X n,n = 0,1,2,...} with discrete state space X n {0,1,2,...} is a Markov chain if it has the Markov property: P[X n+1 =j X n =i,x n 1 =i n 1,...,X 0 =i 0 ] = P[X
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationOn the approximation problem of common fixed points for a finite family of non-self asymptotically quasi-nonexpansive-type mappings in Banach spaces
Computers and Mathematics with Applications 53 (2007) 1847 1853 www.elsevier.com/locate/camwa On the approximation problem of common fixed points for a finite family of non-self asymptotically quasi-nonexpansive-type
More informationMULTI-PERIOD MULTI-DIMENSIONAL KNAPSACK PROBLEM AND ITS APPLICATION TO AVAILABLE-TO-PROMISE
MULTI-PERIOD MULTI-DIMENSIONAL KNAPSACK PROBLEM AND ITS APPLICATION TO AVAILABLE-TO-PROMISE Hoong Chuin LAU and Min Kwang LIM School of Computing National University of Singapore, 3 Science Drive 2, Singapore
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo
More informationStability, Queue Length and Delay of Deterministic and Stochastic Queueing Networks Cheng-Shang Chang IBM Research Division T.J. Watson Research Cente
Stability, Queue Length and Delay of Deterministic and Stochastic Queueing Networks Cheng-Shang Chang IBM Research Division T.J. Watson Research Center P.O. Box 704 Yorktown Heights, NY 10598 cschang@watson.ibm.com
More information1 if the i-th toss is a Head (with probability p) ξ i = 0 if the i-th toss is a Tail (with probability 1 p)
6 Chapter 3. Markov Chain: Introduction Whatever happened in the past, be it glory or misery, be Markov! 3.1. Examples Example 3.1. (Coin Tossing.) Let ξ 0 0 and, for i 1, 1 if the i-th toss is a Head
More informationA Location-Inventory Problem for Customers with. Time Constraints
A Location-Inventory Problem for Customers with Time Constraints A LOCATION-INVENTORY PROBLEM FOR CUSTOMERS WITH TIME CONSTRAINTS BY FAN E, B.Sc. a thesis submitted to the school of computational science
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
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 informationAggregate Planning. Production Planning and Control. Anadolu Üniversitesi Mühendislik Mimarlık Fakültesi Endüstri Mühendisliğ Bölümü
Aggregate Planning Production Planning and Control Anadolu Üniversitesi Mühendislik Mimarlık Fakültesi Endüstri Mühendisliğ Bölümü Example 3.1 Washing Machine Plant Model Number Number of Worker-Hours
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More information1 Positive Ordering Costs
IEOR 4000: Production Management Professor Guillermo Gallego November 15, 2004 1 Positive Ordering Costs 1.1 (Q, r) Policies Up to now we have considered stochastic inventory models where decisions are
More informationLecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2
More informationApplication 1 - People Allocation in Line Balancing
Chapter 9 Workforce Planning Introduction to Lecture This chapter presents some applications of Operations Research models in workforce planning. Work force planning would be more of a generic application
More informationClassification of Dantzig-Wolfe Reformulations for MIP s
Classification of Dantzig-Wolfe Reformulations for MIP s Raf Jans Rotterdam School of Management HEC Montreal Workshop on Column Generation Aussois, June 2008 Outline and Motivation Dantzig-Wolfe reformulation
More informationOn-Line Algorithms for Due Date Quotation with Lateness Penalties
Principal Investigator/Project Director: Philip Kaminsky Institution: University of California, Berkeley. Award Number: DMI-0092854 Program: DMII OR/SEE Project Title: CAREER: Scheduling of Large Scale
More informationFoundations for the New Keynesian Model. Lawrence J. Christiano
Foundations for the New Keynesian Model Lawrence J. Christiano Objective Describe a very simple model economy with no monetary frictions. Describe its properties. markets work well Modify the model to
More informationA Duality-Based Relaxation and Decomposition Approach for Inventory Distribution Systems
A Duality-Based Relaxation and Decomposition Approach for Inventory Distribution Systems Sumit Kunnumkal, 1 Huseyin Topaloglu 2 1 Indian School of Business, Gachibowli, Hyderabad 500032, India 2 School
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationLinear programming: introduction and examples
Linear programming: introduction and examples G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Linear
More informationTutorial: System-Oriented Inventory Models for Spare Parts Geert-Jan van Houtum
YEQT VIII, 3-5 November, 2014 Eindhoven Tutorial: System-Oriented Inventory Models for Spare Parts Geert-Jan van Houtum Literature Seminal paper: Sherbrooke, C.C., METRIC: A multi-echelon technique for
More informationIntegrated optimization approach to order allocation and delivery problem of online supermarket
30 2 2015 4 JOURNAL OF SYSTEMS ENGINEERING Vol.30 No.2 Apr. 2015 1, 2, 1 (1., 116024; 2., 102206) :,,,.,,,,. C W,.. : ; ; ; - (LRP); : TP273 : A : 1000 5781(2015)02 0251 08 doi: 10.13383/j.cnki.jse.2015.02.013
More informationExtended Job Shop Scheduling by Object-Oriented. Optimization Technology
Extended Job Shop Scheduling by Object-Oriented Optimization Technology Minoru Kobayashi, Kenji Muramatsu Tokai University Address: 1117 Kitakaname, Hiratsuka, Kanagawa, 259-1292, Japan Telephone: +81-463-58-1211
More informationNon-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions
Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Mitra Nasri Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany nasri@eit.uni-kl.de
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More informationControl-Oriented Approaches to Inventory Management in Semiconductor Manufacturing Supply Chains
Control-Oriented Approaches to Inventory Management in Semiconductor Manufacturing Supply Chains Daniel E. Rivera, Wenlin Wang, Martin W. Braun* Control Systems Engineering Laboratory Department of Chemical
More informationThis operation is - associative A + (B + C) = (A + B) + C; - commutative A + B = B + A; - has a neutral element O + A = A, here O is the null matrix
1 Matrix Algebra Reading [SB] 81-85, pp 153-180 11 Matrix Operations 1 Addition a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn + b 11 b 12 b 1n b 21 b 22 b 2n b m1 b m2 b mn a 11 + b 11 a 12 + b 12 a 1n
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More informationA Randomized Linear Program for the Network Revenue Management Problem with Customer Choice Behavior. (Research Paper)
A Randomized Linear Program for the Network Revenue Management Problem with Customer Choice Behavior (Research Paper) Sumit Kunnumkal (Corresponding Author) Indian School of Business, Gachibowli, Hyderabad,
More informationResearch Article An Optimal Decision Model of Production-Inventory with MTS and ATO Hybrid Model Considering Uncertain Demand
Mathematical Problems in Engineering Volume 2015, Article ID 241536, 12 pages http://dx.doi.org/10.1155/2015/241536 Research Article An Optimal Decision Model of Production-Inventory with MTS and ATO Hybrid
More informationABSOLUTELY FLAT IDEMPOTENTS
ABSOLUTELY FLAT IDEMPOTENTS JONATHAN M GROVES, YONATAN HAREL, CHRISTOPHER J HILLAR, CHARLES R JOHNSON, AND PATRICK X RAULT Abstract A real n-by-n idempotent matrix A with all entries having the same absolute
More informationSUPPLY CHAIN SCHEDULING: ASSEMBLY SYSTEMS. Zhi-Long Chen. Nicholas G. Hall
SUPPLY CHAIN SCHEDULING: ASSEMBLY SYSTEMS Zhi-Long Chen Nicholas G. Hall University of Pennsylvania The Ohio State University December 27, 2000 Abstract We study the issue of cooperation in supply chain
More informationMarkov Chains. Chapter 16. Markov Chains - 1
Markov Chains Chapter 16 Markov Chains - 1 Why Study Markov Chains? Decision Analysis focuses on decision making in the face of uncertainty about one future event. However, many decisions need to consider
More informationA New Algorithm and a New Heuristic for Serial Supply Systems.
A New Algorithm and a New Heuristic for Serial Supply Systems. Guillermo Gallego Department of Industrial Engineering and Operations Research Columbia University Özalp Özer Department of Management Science
More informationInterchanging fill rate constraints and backorder costs in inventory models
Int. J. Mathematics in Operational Research, Vol. 4, No. 4, 2012 453 Interchanging fill rate constraints and backorder costs in inventory models Jiang Zhang* Department of Management, Marketing, and Decision
More informationConstrained Inventory Allocation
Constrained Inventory Allocation Phillip G. Bradford Michael N. Katehakis January 25, 2006 SYNOPTIC ABSTRACT Supply constraints may include minimum supply commitments and maximum delivery limits. Given
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More informationLab Objective: Introduce some of the basic optimization functions available in the CVXOPT package
Lab 14 CVXOPT Lab Objective: Introduce some of the basic optimization functions available in the CVXOPT package Notebox: CVXOPT is not part of the standard library, nor is it included in the Anaconda distribution.
More informationAnalysis and Evaluation of An Assemble-to-Order System with Batch Ordering Policy and Compound Poisson Demand
Analysis and Evaluation of An Assemble-to-Order System with Batch Ordering Policy and Compound Poisson Demand Yao Zhao Department of Management Science and Information Systems Rutgers University. Newark,
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
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 informationDesigning the Distribution Network for an Integrated Supply Chain
Designing the Distribution Network for an Integrated Supply Chain Jia Shu and Jie Sun Abstract We consider an integrated distribution network design problem in which all the retailers face uncertain demand.
More informationTRANSPORTATION PROBLEMS
63 TRANSPORTATION PROBLEMS 63.1 INTRODUCTION A scooter production company produces scooters at the units situated at various places (called origins) and supplies them to the places where the depot (called
More informationConcepts and Applications of Stochastically Weighted Stochastic Dominance
Concepts and Applications of Stochastically Weighted Stochastic Dominance Jian Hu Department of Industrial Engineering and Management Sciences Northwestern University jianhu@northwestern.edu Tito Homem-de-Mello
More informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More informationDesigning Optimal Pre-Announced Markdowns in the Presence of Rational Customers with Multi-unit Demands - Online Appendix
087/msom070057 Designing Optimal Pre-Announced Markdowns in the Presence of Rational Customers with Multi-unit Demands - Online Appendix Wedad Elmaghraby Altan Gülcü Pınar Keskinocak RH mith chool of Business,
More informationORIE 6334 Spectral Graph Theory October 25, Lecture 18
ORIE 6334 Spectral Graph Theory October 25, 2016 Lecturer: David P Williamson Lecture 18 Scribe: Venus Lo 1 Max Flow in Undirected Graphs 11 Max flow We start by reviewing the maximum flow problem We are
More informationIntroduction to linear programming
Chapter 2 Introduction to linear programming 2.1 Single-objective optimization problem We study problems of the following form: Given a set S and a function f : S R, find, if possible, an element x S that
More informationA Single-Unit Decomposition Approach to Multiechelon Inventory Systems
OPERATIONS RESEARCH Vol. 56, No. 5, September October 2008, pp. 1089 1103 issn 0030-364X eissn 1526-5463 08 5605 1089 informs doi 10.1287/opre.1080.0620 2008 INFORMS A Single-Unit Decomposition Approach
More informationAverage-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints
Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Keqin Li Department of Computer Science State University of New York New Paltz, New
More informationarxiv: v2 [cs.ds] 27 Nov 2014
Single machine scheduling problems with uncertain parameters and the OWA criterion arxiv:1405.5371v2 [cs.ds] 27 Nov 2014 Adam Kasperski Institute of Industrial Engineering and Management, Wroc law University
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationwhere u is the decision-maker s payoff function over her actions and S is the set of her feasible actions.
Seminars on Mathematics for Economics and Finance Topic 3: Optimization - interior optima 1 Session: 11-12 Aug 2015 (Thu/Fri) 10:00am 1:00pm I. Optimization: introduction Decision-makers (e.g. consumers,
More informationA Model of Endogenous Cross-Holdings in Oligopoly
A Model of Endogenous Cross-Holdings in Oligopoly Cheng-Zhong Qin, Shengping Zhang, and Dandan Zhu February 6, 2012 Abstract A network approach is proposed to analyze endogenous cross-holdings and their
More informationDesign of Global Supply Chains
Design of Global Supply Chains Marc Goetschalckx Carlos Vidal Tjendera Santoso IERC Cleveland, Spring 2000 Marc Goetschalckx Overview Global Supply Chain Problem Bilinear Transfer Price Formulation Iterative
More informationA Dynamic model for requirements planning with application to supply chain optimization
This summary presentation is based on: Graves, Stephen, D.B. Kletter and W.B. Hetzel. "A Dynamic Model for Requirements Planning with Application to Supply Chain Optimization." Operations Research 46,
More informationHousing Market Monitor
M O O D Y È S A N A L Y T I C S H o u s i n g M a r k e t M o n i t o r I N C O R P O R A T I N G D A T A A S O F N O V E M B E R İ Ī Ĭ Ĭ E x e c u t i v e S u m m a r y E x e c u t i v e S u m m a r y
More information