On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Can Oz Fikri Karaesmen SMMSO 2015 3 June 2015.

Slides:



Advertisements
Similar presentations
Introduction to Game Theory
Advertisements

Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
Hadi Goudarzi and Massoud Pedram
Markov Decision Process
“Make to order or Make to Stock Model: and Application” S.Rajagopalan By: ÖNCÜ HAZIR.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Chunyang Tong Sriram Dasu Information & Operations Management Marshall School of Business University of Southern California Los Angeles CA Dynamic.
1 Outline  single-period stochastic demand without fixed ordering cost  base-stock policy  minimal expected cost  maximal expected profit  (s, S)
Optimal Pricing and Replenishment in an Inventory System Owen Wu University of British Columbia June 11, 2004 Joint work with Hong Chen and David Yao.
1 FIFTH International Conference on ``Analysis of Manufacturing Systems -- Production Management'‘ Zakynthos, Greece, 2005 QUEUEING MODELS FOR MANAGING.
/faculteit technologie management Modelling Imperfect Advance Demand Information and Analysis of Optimal Inventory Policies Tarkan Tan Technische Universiteit.
Robust Allocation of a Defensive Budget Considering an Attacker’s Private Information Mohammad E. Nikoofal and Jun Zhuang Presenter: Yi-Cin Lin Advisor:
Queueing Theory: Recap
MBA 201A Section 6: Game Theory and Review. Overview  Game Theory  Costs  Pricing  Price Discrimination  Long Run vs. Short Run  PS 5.
SA-1 1 Probabilistic Robotics Planning and Control: Markov Decision Processes.
Queuing Models Basic Concepts
1 HEURISTICS FOR DYNAMIC SCHEDULING OF MULTI-CLASS BASE-STOCK CONTROLLED SYSTEMS Bora KAT and Zeynep Müge AVŞAR Department of Industrial Engineering Middle.
Markov Decision Models for Order Acceptance/Rejection Problems Florian Defregger and Heinrich Kuhn Florian Defregger and Heinrich Kuhn Catholic University.
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Queueing Theory: Part I
On the interaction between resource flexibility and flexibility structures Fikri Karaesmen, Zeynep Aksin, Lerzan Ormeci Ko ç University Istanbul, Turkey.
A Scalable Network Resource Allocation Mechanism With Bounded Efficiency Loss IEEE Journal on Selected Areas in Communications, 2006 Johari, R., Tsitsiklis,
Markov Decision Processes
Course outline I Homogeneous goods Introduction Game theory
Limiting probabilities. The limiting probabilities P j exist if (a) all states of the Markov chain communicate (i.e., starting in state i, there is.
Lecture 14 – Queuing Systems
L/O/G/O Equilibrium prices for providers in Queueing System Petrozavodsk Nina Plaksina Petrozavodsk State University 2011 year.
Dimitrios Konstantas, Evangelos Grigoroudis, Vassilis S. Kouikoglou and Stratos Ioannidis Department of Production Engineering and Management Technical.
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
M ANAGERIAL ECONOMI X. CONTENTS… DEFINITION T.E.T V/S M.E.T WAT’S NEW IN MET PROBLEMS IN M.E.T MET & STATISTICS MET & O.R MET & MANAGEMENT ACCOUNTING.
Queueing Theory Models Training Presentation By: Seth Randall.
ECES 741: Stochastic Decision & Control Processes – Chapter 1: The DP Algorithm 1 Chapter 1: The DP Algorithm To do:  sequential decision-making  state.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
A limit order market is a real world institution for characterizing the financial sector, and it is also a paradigm for describing trading mechanisms more.
Chapter 10. Simulation An Integrated Approach to Improving Quality and Efficiency Daniel B. McLaughlin Julie M. Hays Healthcare Operations Management.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
ECES 741: Stochastic Decision & Control Processes – Chapter 1: The DP Algorithm 31 Alternative System Description If all w k are given initially as Then,
Analysis of M/M/c/N Queuing System With Balking, Reneging and Synchronous Vacations Dequan Yue Department of Statistics, College of Sciences Yanshan University,
Channel Coordination and Quantity Discounts Z. Kevin Weng Management Science, Volume 41, Issue 9 (September, 1995), Prepared by: Çağrı LATİFOĞLU.
1 Queueing Theory Frank Y. S. Lin Information Management Dept. National Taiwan University
1 Elements of Queuing Theory The queuing model –Core components; –Notation; –Parameters and performance measures –Characteristics; Markov Process –Discrete-time.
Chapter 16 Capacity Planning and Queuing Models
1 Inventory Management (Deterministic Model) Coordination Mechanisms for a Distribution System with One Supplier and Multiple Retailers Prof. Dr. Jinxing.
1 The Base Stock Model. 2 Assumptions  Demand occurs continuously over time  Times between consecutive orders are stochastic but independent and identically.
“Make to order - Make to Stock Production Systems By: ÖNCÜ HAZIR.
Price Differentiation for Communication Networks Shuqin (Helen) Li and Jianwei Huang, IEEE Transactions on Networking, Forthcoming.
The production inventory problem What is the expected inventory level? What is expected backorder level? What is the expected total cost? What is the optimal.
1 1 Slide © 2005 Thomson/South-Western MANAGMENT SCIENCE n Chapter 1: Introduction Problem solving and decision making; quantitative analysis and decision.
Why Wait?!? Bryan Gorney Joe Walker Dave Mertz Josh Staidl Matt Boche.
Chapter 11 Rivalry, Oligopoly, and Monopolistic Competition Introduction to Economics (Combined Version) 5th Edition.
Machine interference problem: introduction
Pricing with Markups in Competitive Markets with Congestion Nicolás Stier-Moses, Columbia Business School Joint work with José Correa, Universidad Adolfo.
The (Q, r) Model.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
Channel Coordination and Quantity Discounts Z. Kevin Weng Presented by Jing Zhou.
SBE Supply Chain Seminar Series Nov. 30, 2007 Slide #1 Inventory Competition for Newsvendors under the Profit (and Revenue) Satisficing Objective Xuan.
1 Chapter 4 Single Stage Produce-to-Stock Better customer service Lower manufacturing costs (setups) More uniform utilization.
SIMULATION EXAMPLES. Monte-Carlo (Static) Simulation Estimating profit on a sale promotion Estimating profit on a sale promotion Estimating profit on.
Markov Decision Process (MDP)
Managerial Economics Game Theory Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr. Arto.
Decentralized Multi-Echelon Supply Chains: Incentives and Information Hau Lee Seungjin Whang presented by Evren Sarınalbant.
Example 31: Solve the following game by equal gains method: Y I II I II I X II II
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Managerial Decision Making Chapter 13 Queuing Models.
Flows and Networks Plan for today (lecture 4):
Chapter 18 Working Capital Management
Queueing networks.
Presentation transcript:

On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Can Oz Fikri Karaesmen SMMSO June 2015

Agenda Introduction Model definition Solution Procedure Computational Study Future Research

Introduction On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels

Introduction On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Decision-making entities Risk neutral Fixed reward vs. Waiting cost

Introduction On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Inventory position of the system is not shared with the customers, only production target and service rate

Introduction On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Fixed service rate server Fixed payment from joining customers vs. Inventory holding cost

Literature Strategic customers in queueing systems Naor, P Edelson, N.M., D.K. Hildebrand 1975 Hassin, R., M. Haviv 2003 Strategic customers in make-to-stock systems

Model Definition Strategic customers arrive at an inventory system that is operated by a base-stock policy Customer’s joining decision is based on other customers’ decisions Producer is the leader in the Stackelberg game and acts knowing customers’ decisions

Different versions Customer types Exogenous customers vs. strategic customers Homogenous vs. heterogeneous customers Demand Single unit vs. multiple unit Partial vs. full batches Information Observable vs. unobservable queue length Exit strategy Balking vs. staying Service quality Perfect vs. stochastic service quality

Different versions Customer types Exogenous customers vs. strategic customers Homogenous vs. heterogeneous customers Demand Single unit vs. multiple unit Partial vs. full batches Information Observable vs. unobservable queue length Exit strategy Balking vs. staying Service quality Perfect vs. stochastic service quality

Model Notation Customer’s problem Poisson arrivals(rate λ ) with unit demand Unobservable queue length, Reward for finished service, R-p Waiting cost per unit time, c May not join the system (customer’s decision) Will not leave the system after joining Producer’s problem Exponential production time with rate μ Revenue per customer, p Holding cost per unit time, h No backordering or waiting cost Sets the production limit S (producer’s decision) Customers and producer studied Buzacott&Shanthikumar 1993 and were very good students in stochastic models course

Order of Events Customers know R, c, p and λ. Producer announces target inventory level S and service rate μ. Customers decide on their individual joining probability q. Producer knew the joining probability and set S to maximize his profit.

M/M/1 queue Our System Equivalent System

Useful Results where E[W] is the expected waiting time and E[I] is the expected inventory level q is the joining probability S is the production limit Buzacott&Shanthikumar 1993

Considering expected waiting time and the reward, each customer makes a decision Customer’s Decision From queueing counterpart we know equilibrium joining probability is 0 when All customers might join the system ifOther than these cases equilibrium joining probability is unique and solves Equation (I)

Customer’s Decision Let’s assume q + >q is the joining probability, then some customers will left since their reward is negative Similarly if q - <q percent is the equilibrium joining probability then some customers will increase their joining probability

Customer’s Joining Rate

q S is a non-decreasing function of S After a threshold level joining probability is 1 Equilibrium Joining Probability

Tries to maximize his profit by setting the inventory target S where the expected inventory level is Producer’s decision set is bounded Producer’s Problem

Step 1:Set S = 0, calculate the equilibrium joining rate and resulting profit for the producer Step 2: If q S ≠ 0, set S = S+1 go to Step 1 else go to Step 3 Step 3: Find the maximizer of the expected profit among the calculated

Tries to maximize total system profit by deciding on arrival rate λ and inventory target S For fixed λ, optimal S is the solution of Equation (II) (Buzacott&Shanthikumar 1993) Social Optimization

p ~ DU[1,20] and λ ~ CU[0,0.97] Lower profitability R/c=2 vs higher profitability R/c=10 Customer’s willingness to join is increasing Computational Study SettingLow R/cHigh R/cR/c<p/hR/c=p/hR/c>p/h hpCU[0,1]pCU[0,1]/5 Rp+DU[1,20] p+DU[1,10]p+DU[1,20]p+DU[1,40] cRCU[0,1]RCU[0,1]/5

Joining rate comparison

Target inventory level comp.

Profit comparison

Profit comparison cont’d MetricLow R/cR/c<p/hR/c=p/hR/c>p/h T( λ D,S D )/ T( λ C,S C ) Π ( λ D,S D )/ Π ( λ C,S C ) θ ( λ D,S D )/ θ ( λ C,S C ) % of instances customer loss391253

Conclusion Developed a make-to-stock production system with strategic customers Characterized customers’ equilibrium joining probability and producer’s optimal decision Identified cases where centralization is profitable

Future Research Fully observable system Finished the analysis of centralized and decentralized problems Showed the concavity of producer’s profit function Showed the optimality of base stock policy and Partially observable system Comparison with pure queueing system