On the interaction between resource flexibility and flexibility structures Fikri Karaesmen, Zeynep Aksin, Lerzan Ormeci Ko ç University Istanbul, Turkey.

Slides:



Advertisements
Similar presentations
Hadi Goudarzi and Massoud Pedram
Advertisements

Lesson 08 Linear Programming
Logistics Network Configuration
CWI PNA2, Reading Seminar, Presented by Yoni Nazarathy EURANDOM and the Dept. of Mechanical Engineering, TU/e Eindhoven September 17, 2009 An Assortment.
Computational Stochastic Optimization:
Short-Term Fairness and Long- Term QoS Lei Ying ECE dept, Iowa State University, Joint work with Bo Tan, UIUC and R. Srikant, UIUC.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
IFIP Performance 2007 On Processor Sharing (PS) and Its Applications to Cellular Data Network Provisioning Yujing Wu, Carey Williamson, Jingxiang Luo Department.
1 Adaptive resource management with dynamic reallocation for layered multimedia on wireless mobile communication net work Date : 2005/06/07 Student : Jia-Hao.
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.
Network Bandwidth Allocation (and Stability) In Three Acts.
Using Simulation-based Stochastic Approximation to Optimize Staffing of Systems with Skills-Based-Routing WSC 2010, Baltimore, Maryland Avishai Mandelbaum.
MODELING AND ANALYSIS OF AN AUCTION- BASED LOGISTICS MARKET Barış Tan Semra Ağralı and Fikri Karaesmen Department of Industrial Engineering Koç University,
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Customer Service in Pull Production Systems Mark L. SPEARMAN Presented By: Ahu SOYLU.
Combining Multipath Routing and Congestion Control for Robustness Peter Key.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
1 Chapter 7 Dynamic Job Shops Advantages/Disadvantages Planning, Control and Scheduling Open Queuing Network Model.
Optimization Using Matrix Geometric and Cutting Plane Methods Sachin Jayaswal Beth Jewkes Department of Management Sciences University of Waterloo & Saibal.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Buffer Management for Shared- Memory ATM Switches Written By: Mutlu Apraci John A.Copelan Georgia Institute of Technology Presented By: Yan Huang.
Dimitrios Konstantas, Evangelos Grigoroudis, Vassilis S. Kouikoglou and Stratos Ioannidis Department of Production Engineering and Management Technical.
Asaf Cohen (joint work with Rami Atar) Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan March 11,
Soumya Sen, K. Yamauchi, Roch Guerin and Kartik Hosanagar ESE, Wharton University of Pennsylvania 11.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
Chapter 1 Introduction to Simulation
EE 685 presentation Distributed Cross-layer Algorithms for the Optimal Control of Multi-hop Wireless Networks By Atilla Eryılmaz, Asuman Özdağlar, Devavrat.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
Modeling.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
© 2009 IBM Corporation 1 Improving Consolidation of Virtual Machines with Risk-aware Bandwidth Oversubscription in Compute Clouds Amir Epstein Joint work.
Kevin Ross, UCSC, September Service Network Engineering Resource Allocation and Optimization Kevin Ross Information Systems & Technology Management.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Using shadow prices in a linear programing representation of Kanban system dynamics to maximize system throughput George Liberopoulos  Kostas Takoumis.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Can Oz Fikri Karaesmen SMMSO June 2015.
OPSM 405 Service Management Class 18: Managing capacity Koç University Zeynep Aksin
Blind Fair Routing in Large-Scale Service Systems Mor Armony Stern School of Business, NYU *Joint work with Amy Ward TexPoint fonts used in EMF. Read the.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
18 Management of Waiting Lines.
1 Optimal Inventory-Backorder Tradeoff in an Assemble-to-Order System with Random Leadtimes Yingdong Lu – IBM T.J. Watson Research Center Jing-Sheng Song.
Networks Plan for today (lecture 8): Last time / Questions? Quasi reversibility Network of quasi reversible queues Symmetric queues, insensitivity Partial.
Tactical Planning in Healthcare with Approximate Dynamic Programming Martijn Mes & Peter Hulshof Department of Industrial Engineering and Business Information.
Dynamic Pricing with Risk Analysis and Target Revenues Baichun Xiao Long Island University.
Approximating the Performance of Call Centers with Queues using Loss Models Ph. Chevalier, J-Chr. Van den Schrieck Université catholique de Louvain.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
BSnetworks.pptTKK/ComNet Research Seminar, SRPT Applied to Bandwidth Sharing Networks (to appear in Annals of Operations Research) Samuli Aalto.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Lecture 20 Review of ISM 206 Optimization Theory and Applications.
Towards Robust Revenue Management: Capacity Control Using Limited Demand Information Michael Ball, Huina Gao, Yingjie Lan & Itir Karaesmen Robert H Smith.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
BAHIR DAR UNIVERSITY Institute of technology Faculty of Computing Department of information technology Msc program Distributed Database Article Review.
Building Business Transformation Capabilities Our perspective on the building blocks, structure and critical success factors to impact change Gillian.
Load Balancing and Data centers
Modeling and Simulation (An Introduction)
Simulation Statistics
CHAPTER 8 Operations Scheduling
Course Summary Organization: A process providing goods and services based on a set of inputs, including raw material, capital, labor and knowledge. The.
Professor Arne Thesen, University of Wisconsin-Madison
Optimization of Wireless Station Time Slot Allocation with Consideration of Throughput and Delay Constraints 指導教授:林永松 博士 研究生:林岦毅.
Provision of Multimedia Services in based Networks
Simulation Modeling.
Flows and Networks Plan for today (lecture 6):
SRPT Applied to Bandwidth Sharing Networks
Buffer Management for Shared-Memory ATM Switches
Presentation transcript:

On the interaction between resource flexibility and flexibility structures Fikri Karaesmen, Zeynep Aksin, Lerzan Ormeci Ko ç University Istanbul, Turkey Sponsored by a KUMPEM research grant FIFTH INTERNATIONAL CONFERENCE ON "Analysis of Manufacturing Systems –Production Management" May 20-25, Zakynthos Island, Greece

Outline Motivation The methodology Some structural results Numerical examples Work-in-Progress

Resource flexibility in practice: multilingual call (contact) centers Compaq’s call centers in Ireland: supports nine European languages Toshiba call center in Istanbul: eight European languages Similar centers for Dell, Gateway, IBM, DHL, Intel, etc. Language and cultural know-how mix. Language and technical skills mix. Excellent example of multi-skill service structure

Resource flexibility Part of a general framework that encompasses manufacturing and services –Flexible manufacturing capacity: assigning demand types to flexible plants –FMS: routing parts to the right flexible machine –Human resources: cross-training of workers or service representatives

Emerging questions What is the value of cross-training? What can be expected out of a good dynamic routing system? What is the right scale of flexibility? –is everyone x-trained? –if only some, how many? What is the right scope of flexibility? –can x-trained personnel deal with all calls? –if not, what is the right skills mix?

Related literature Process Flexibility –Jordan and Graves (1995): manufacturing flexibility, demand-plant assignments (motivated by a GM case) –Graves and Tomlin (2003) –Iravani, Van Oyen and Sims (2005) –Aksin and Karaesmen (2004) Flexible servers in queueing systems –Van Oyen, Senturk-Gel, Hopp (2001) –Pinker and Shumsky (2000) –Chevalier, Shumsky, Tabordon (2004) –Aksin and Karaesmen (2002) –Hopp, Tekin, Van Oyen (2004) Review papers –Sethi and Sethi (1990) –Hopp, Van Oyen (2004)

Methodological issues Static –Network flow problem with random demand –Framework of Jordan and Graves (1995) –Simplistic but captures basic characteristic of problem –Enables structural properties Dynamic –Can take into account queueing, abandonments, blocking –Difficult to decouple staffing question from call routing –Stochastic dynamic optimization problem –Very difficult problem in general

The Network Flow Model The system is represented by a graph. An arc between demand i and resource j implies that demand i can be treated by resource j. Without loss of generality, each demand type has a main corresponding department. demandscapacities C1C1 C2C2 C3C3 No resource flexibility demandscapacities C1C1 C2C2 C3C3 Partial resource flexibility

Definitions and Assumptions Demand =( 1, 2,.. n ) is a random vector. Capacities and flexibility structure are given. The allocation (routing) takes place after the realization of the demand. Plausible objective: maximization of expected throughput (flow) Solve max-flow problem for each possible realization and take expectations (over the random demand vector). Easy to simulate, difficult to establish structural results.

Some useful properties E[T 1 ]E[T 2 ]E[T 3 ] Obviously: And less obviously: More flexibility is better! Diminishing returns to flexibility!

Some useful properties E[T 1 ] E[T 4 ] E[T 3 ]E[T 2 ] Expected throughput is submodular in any two parallel arcs. Parallel arcs are substitutes!

Some useful properties E[T 1 ]E[T 2 ] If capacity is symmetric, then: Balanced flexibility is better!

The right scale of flexibility Not all service representatives / workers have multiple skills. Let  be the proportion of service representatives with multiple skills What is the right level of  ? What happens to the preceding properties as  changes?

The right scale of flexibility With the additional constraint: For any realization the following LP must be solved:

The right scale of flexibility E[T|  =0] E[T|  =0.2]E[T|  =0.4] Expected throughput is concave in . Diminishing returns to scale!

Examples: effects of scale E[T 1 ]E[T 2 ] E[T 3 ] E[T 4 ]

Examples: effects of scale E[T 1 ]E[T 2 ] E[T 3 ] E[T 4 ]

Example: scale, and variability of demand E[T 1 ]E[T 2 ] E[T 3 ] E[T 4 ]

Robustness of the results: comparison with a call center model A call center with N customer classes and departments Arrivals occur according to Poisson processes with rates i Processing times (talk times) are exponentially distributed with rate . Limited number of waiting spaces. Impatient customers abandon the queue: abandonment times are exponentially distributed with rate . C servers per department.

Methodology Call routing policies have an effect on the performance. Difficult stochastic dynamic control problem in multiple dimensions We extend a bound/approximation by Kelly by reducing the problem to N single dimensional Markov Decision Processes Combine the solutions of the MDPs in a concave optimization problem (an LP). Solve the LP: the result is a bound on the expected throughput per unit time which is fairly tight.

A numerical example: the symmetric case A three class call center All parameters symmetric (call volumes, service rates, abandonment parameters) Five servers, twenty five phone lines for each class Vary scale: 0-5 x-trained servers Vary flexibility structure

Results  Expected Throughput E[T 1 ]E[T 2 ] E[T 3 ] E[T 4 ]

Flexibility Insights Obvious result: more flexibility is better Balanced skill sets are better –spread out flexibility rather than exclusive flexibility High scale is desireable but.. –diminishing returns to scale –marginal value of scale increases with better scope for low levels of scale –scale and scope decisions interact –good skill-set design is essential for optimal cross- training practice

Managerial Implications Start with skill-set design; determining the right scale should follow this design decision: what type of flexibility followed by how much If the call center deals with calls that share similar parameters (symmetric) prefer a low scope strategy at high scale to a high scope strategy at low scale. For large call centers, even low scope and low scale should be sufficient (20% flexible capacity?) For smaller call centers higher scope is desirable.

Future and ongoing work On network flow models –More structural results on scale effects –A complete numerical study –Flexibility/capacity interactions On queueing models –Call routing policies –Capacity design Some information available at: