The Concept of Bottleneck

Similar documents
Process design Push-pull boundary 35C03000 Process Analysis and Management Max Finne, Assistant Professor of Information and Service management

Managing risks in a multi-tier supply chain

The decision to produce multiple products on. Incorporating the Opportunity Cost of Setups into Production-Related Decisions. Fall

THE ANALYSIS OF PRODUCTION LINES BOTTLENECKS IDENTIFICATION AND WAYS OF MANAGEMENT

MIT 2.853/2.854 Introduction to Manufacturing Systems. Multi-Stage Control and Scheduling. Lecturer: Stanley B. Gershwin

Drum-Buffer-Rope in PlanetTogether Galaxy

Logistic and production Models

Network Flows. 7. Multicommodity Flows Problems. Fall 2010 Instructor: Dr. Masoud Yaghini

Optimizing Inplant Supply Chain in Steel Plants by Integrating Lean Manufacturing and Theory of Constrains through Dynamic Simulation

FIRST FUNDAMENTAL THEOREM OF WELFARE ECONOMICS

TRANSPORTATION PROBLEM AND VARIANTS

Herbie An Introduction to WiP Limits

Multi-node offer stack optimization over electricity networks

Digital Media Mix Optimization Model: A Case Study of a Digital Agency promoting its E-Training Services

A COMPARISON OF JOHNSON S RULE AND TOC BASED SCHEDULING METHODOLOGIES

Infor CloudSuite Industrial Whatever It Takes - Advanced Planning & Scheduling for Today s Manufacturer

Expert System for Mixed-Model Assembly Line Balancing

Production Planning under Uncertainty with Multiple Customer Classes

^ Springer. The Logic of Logistics. Theory, Algorithms, and Applications. for Logistics Management. David Simchi-Levi Xin Chen Julien Bramel

CHAPTER 4.0 SYNCHRONOUS MANUFACTURING SYSTEM

Business case studies. (Logistic and production models)

Multi-Stage Control and Scheduling

Price Tests for Entry into Markets in the Presence of Non-Convexities

A Case Study of Capacitated Scheduling

M. Luptáčik: Mathematical Optimization and Economic Analysis

A reverse discount model for dynamic demands. Abhishek Chakraborty. Indian Institute of Management Calcutta

Basic Linear Programming Concepts. Lecture 2 (3/29/2017)

Copyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and

Linear Programming. 1 Goals and Agenda. Management 560: Management Science. Tuesday, March 17, 2009

Production Planning of LCDs: Optimal Linear Programming and

This is a refereed journal and all articles are professionally screened and reviewed

Optimization Prof. Debjani Chakraborty Department of Mathematics Indian Institute of Technology, Kharagpur

Book Outline. Software Testing and Analysis: Process, Principles, and Techniques

A Diagnostic Approach to Scheduling

The 2x2 Exchange Economy. Joseph Tao-yi Wang 2013/10/2 (Lecture 8, Micro Theory I)

ISE480 Sequencing and Scheduling

CONVERTING SIMULATION DATA TO COMPARATIVE INCOME STATEMENTS

Managerial Accounting Prof. Dr. Varadraj Bapat School of Management Indian Institute of Technology, Bombay

The Five Focusing Steps

CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS

Understanding Some Unexpected Failures of the Theory of Constraints Product Mixes. Autoria: Alexandre Linhares

1 Introduction 1. 2 Forecasting and Demand Modeling 5. 3 Deterministic Inventory Models Stochastic Inventory Models 63

Linear Programming. BUS 735: Business Decision Making and Research. Wednesday, November 8, Lecture / Discussion. Worksheet problem.

CHAPTER 1 INTRODUCTION

The 2x2 Exchange Economy. Joseph Tao-yi Wang 2012/11/21 (Lecture 2, Micro Theory I)

JOB SHOP SCHEDULING TO MINIMIZE WORK-IN-PROCESS, EARLINESS AND TARDINESS COSTS ZHU ZHECHENG A THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY

Microeconomic Theory -1- Introduction and maximization

Modelling of Two-sided Assembly Line Balancing Problem with Resource Constraints

Scheduling and Coordination of Distributed Design Projects

Highlights of CCPM - Critical Chain Project Management The TOC way of managing projects By Oded Cohen International Director Goldratt Schools

Modelling of Two-sided Assembly Line Balancing Problem with Resource Constraints

David Simchi-Levi M.I.T. November 2000

Urban Transportation Planning Prof Dr. V. Thamizh Arasan Department of Civil Engineering Indian Institute Of Technology, Madras

Yield Frontier Analysis of Forest Inventory

Theory of Constraints. Activity-Based

Maximizing and satisficing in a choice model based on time allocation Raúl G. Sanchis 3,4, José-Manuel Rey 2, and Francisco Álvarez1

A Single Item Non Linear Programming (NLP) Economic Order Quantity Model with Space Constraint

Chapter 2. 2 Literature review

An Algorithm of Finite Capacity Material Requirement Planning System for Multi-stage Assembly Flow Shop

Principles of Inventory Management

Clearing Function Applied to Maintenance Planning

OPERATIONS RESEARCH Code: MB0048. Section-A

The Price of Anarchy in an Exponential Multi-Server

SENSITIVITY AND DUALITY ANALYSES OF AN OPTIMAL WATER TREATMENT COST MODEL FOR GHANA. Douglas Kwasi Boah, Stephen Boakye Twum and Kenneth B.

EconS 527 Homework 3 Answer Key. Consider a consumer with Cobb-Douglas utility function

Simulation Analytics

OMGT2146. Supply Chain Analysis and Design. Introduction to Modeling. Course Information. Week 1

Understanding UPP. Alternative to Market Definition, B.E. Journal of Theoretical Economics, forthcoming.

OPTIMIZATION OF ROCK STONE SELECTION IN SHORE PROTECTION PROJECTS - CASE STUDY: GAZA BEACH CAMP SHORE PROTECTION PROJECT

Dynamic Buffering of a Capacity Constrained Resource via the Theory of Constraints

IT 470a Six Sigma Chapter X

THE IMPACT OF THE AVAILABILITY OF RESOURCES, THE ALLOCATION OF BUFFERS AND NUMBER OF WORKERS ON THE EFFECTIVENESS OF AN ASSEMBLY MANUFACTURING SYSTEM

Modeling of competition in revenue management Petr Fiala 1

A Convex Primal Formulation for Convex Hull Pricing

University of Groningen. Effective monitoring and control with intelligent products Meyer, Gerben Gerald

Contents PREFACE 1 INTRODUCTION The Role of Scheduling The Scheduling Function in an Enterprise Outline of the Book 6

Development of New Paradigms of Freight Origin-Destination Synthesis that Use GPS Data

The five focusing steps of the Theory of Constraints have been successfully applied to the improvement

Multi-UAV Task Allocation using Team Theory

Vehicle Routing at a Food Service Marketplace

APPLYING THEORY OF CONSTRAINTS FOR IMPROVING BUSINESS RESULTS IN A NPD PROCESS

Burstiness-aware service level planning for enterprise application clouds

Assignment Technique for solving Transportation Problem A Case Study

People at work: Modelling human performance in shop floor for process improvement in manufacturing enterprises.

Justifying Simulation. Why use simulation? Accurate Depiction of Reality. Insightful system evaluations

Single Machine Scheduling with Interfering Job Sets

Job Batching and Scheduling for Parallel Non- Identical Machines via MILP and Petri Nets

Vehicle Routing Tank Sizing Optimization under Uncertainty: MINLP Model and Branch-and-Refine Algorithm

USING THE THEORY OF CONSTRAINTS TO PRODUCTION PROCESSES IMPROVEMENT

Marginal Cost Pricing in Hydro-Thermal Power Industries: Is a Capacity Charge Always Needed? 1

TU-C2020 Operations Management. Timo Seppälä

Shadow Prices. Joseph Tao-yi Wang 2013/9/13. (Lecture 2, Micro Theory I)

SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES

Simultaneous Perspective-Based Mixed-Model Assembly Line Balancing Problem

LEAN ADMINISTRATION.

XXXII. ROBUST TRUCKLOAD RELAY NETWORK DESIGN UNDER DEMAND UNCERTAINTY

KEY ISSUES in Advanced Operations Management. Timo Seppälä

LEAN PRODUCTION FACILITY LAYOUT.

Planning. Dr. Richard Jerz rjerz.com

250ST Optimization Models of Transport Networks

Transcription:

The Concept of Bottleneck Saral Mukherjee (Speaker) A. K. Chatterjee Abstract The paper provides a classification of bottleneck definitions available in literature and discusses several myths associated with the concept of The apparent diversity of definitions raises the question whether it is possible to have a single bottleneck definition which has applicability in diverse production/service environments. We propose an universally applicable bottleneck definition based on the concept of average shadow price and discuss the procedure for determination of bottleneck values for several production environments. 1 Introduction The roots of bottleneck focused approach in operations management can be traced back to the days of Henry Ford. In his effort to deliver an affordable car, Ford introduced the moving assembly line which exploited the economies of scale involved in producing a standard product in high volume. It was understood that the workstation with the maximum processing requirement, denoted as the bottleneck, would constrain the output of the system. This understanding was inherent in the attempt to balance capacity by ensuring that the total work was allocated equally among the workstations. The focus on bottlenecks was implicitly captured by the importance given to the capacity utilisation metric as the prime tool for managerial planning and control in such high volume low variety environment. The complexity of operations has increased tremendously since the days of Henry Ford. Single model assembly lines have given place to mixed model assembly lines. Inflexible transfer lines have yielded ground to various forms of flexible manufacturing systems. The need for constant product innovation and the resultant product proliferation has resulted in an increase in the variety in the product mix. The identification of bottleneck becomes much more difficult as we move from the high volume low variety repetitive manufacturing scenario towards low volume high variety job shops and finally to the project environment. Job shops and projects primarily compete on the dimension of time as opposed to a mass production system where throughput at the lowest cost is the primary concern. Thus the definition of bottleneck has to be agreed upon given that capacity is no longer approachable in job shops and projects in the same way as in assembly lines. For a practicing manager running a production or service set up, focusing on the bottleneck is an intuitive way of managing this complexity. Yet, as we show in this paper, management saralm@iimahd.ernet.in. P&QM Area, Indian Institute of Management, Ahmedabad, India. ac@iimcal.ac.in. Operations Management Group, Indian Institute of Management, Calcutta, India. 1

science literature does not provide a bottleneck definition which is universally valid for all production/service scenarios. The absence of a universally applicable definition implies the absence of any universally applicable bottleneck focused approach. This void was partially filled when [Goldratt and Cox(1984)] proposed the Theory of Constraints (TOC). As an operations management paradigm, TOC centered mainly on the identification and exploitation of bottlenecks. For the practicing manager, the acceptance of such a theory comes naturally as it exploits the fundamental intuition about bottlenecks carried over from the days of Henry Ford. This acceptance is reflected in the phenomenal success of Goldratt s novel The Goal. The criticism of Goldratt s bottleneck focused approach has centered around the lack of rigour in his work. We would like to make a distinction between the bottleneck focused approach per se and Goldratt s implementation of the bottleneck focused approach. A practitioner should not be forced to compromise rigour in order to follow a bottleneck focused approach. Management science researchers need to provide a scientifically rigorous bottleneck focused approach as a viable alternative to Goldratt s approach. The work of [Trietsch(2005)] is a step in this direction. Our effort in this paper is on similar lines and is grounded in the understanding that the bedrock of a bottleneck focused approach is the definition of bottleneck itself. The objective of this paper is to establish a universally valid bottleneck definition. The term universal has several connotations for this paper. Primarily our intention is to search for a bottleneck definition which has applicability in diverse production/service scenarios spanning project environment to continuous flow lines. Secondly, we hope that a universally accepted bottleneck definition would bridge the gap between theoreticians and practitioners. We show that the popularly used capacity based and critical path based bottleneck definitions are special cases of the universally valid bottleneck definition. As a result, we sensitise the practicing managers against overextending the definition valid for a particular scenario. At the same time, the existence of a universal definition having scientific validity means that practitioners do not have to sacrifice rigour while employing a bottleneck focused approach to problem solving. The foundation of this unified approach lies in understanding the similarity between the concepts of bottleneck and shadow price of resources. The shadow price for a resource in a mathematical programme provides the same managerial insights as does a bottleneck measure. The bottleneck definition proposed by us is an application of the concept of average shadow price in the context of operations management. We show how the definition can be applied in diverse production/service environments and discuss the procedure for determination of bottleneck values. The determination of the average shadow price is much more difficult than determining the marginal shadow price. The two prices would be equal if the Law of Diminishing Returns holds for a production/service environment. We provide an example to show that the Law of Diminishing Returns does not necessarily hold for all production/service environments. An interesting research question having significant implication for practitioners would then be to characterise environments where the two shadow prices are equivalent. We make a start by proving the equivalence of the average and marginal shadow prices for four specific environments. 2 Fundamental characteristics of bottlenecks The term bottleneck has been extensively used in operations management literature. Yet there are few instances where it has been explicitly defined. However, practitioners have a clear 2

understanding of the implications of a resource being a According to Goldratt, An hour lost at a bottleneck is an hour lost for the entire system. An hour saved at a non-bottleneck is a mirage. In our opinion, this statement captures the essence of the concept of It communicates in very simple terms the crucial role played by bottlenecks. Moreover, the statement is actionable in that it provides a clear focus for managerial planning and control activities. We choose this statement as the guiding principle in formulating a universally valid bottleneck definition. This action on our part is not because we consider Goldratt s words as infallible. Instead, we realise that this statement is nothing but an application of the well-known complimentary slackness conditions [Tucker(1956)] in a production/service context. The complimentary slackness conditions for linear and non-linear mathematical programmes state that dual variables (shadow prices) exist if and only if the corresponding constraints are binding. In the context of a production/service system, this translates to the fact that an improvement for the whole ( entire system ) is possible if and only if there is an improvement for a crucial part ( bottleneck ) of the whole. We have not come across a single published article where this connection between Goldratt s characterisation of bottlenecks and the fundamental Operations Research concept of complimentary slackness conditions has been highlighted. Definition 1 A bottleneck constrains the performance of a system. Note that a resource defined as a bottleneck according to Definition 1 would be in accordance with our guiding principle. The definition is also in accordance with the complimentary slackness conditions for the mathematical programme representing the production/service situation at hand. If a resource constrains the performance of a system then a manager can profitably utilise an additional availability of that resource. Hence the resource is a On the other hand, the manager cannot profitably employ extra capacity for a resource which already has enough slack. Hence such a resource is a non- While Definition 1 is intuitive, its theoretical validity rests on the existence of a valid shadow price definition. Since most production/service environments are likely to be formulated as integer programmes, we need a valid shadow price definition for integer programmes as a fundamental construct on which we can claim the validity of Definition 1. Such a construct is provided by the concept of average shadow price ASP, introduced by [Kim and Cho(1988)]. [Mukherjee and Chatterjee(2006a)] introduced ASPIRA, an average shadow price which allows integral availability of resources. Definition 2 A set of constraints with strictly positive average shadow price is defined as a Since Definition 2 is based on the concept of average shadow price, it has the characteristics that (i) it respects the complimentary slackness conditions and (ii) its existence and uniqueness is guaranteed. In addition, the integral availability of resources can be handled using ASPIRA. Furthermore, the attractiveness of this definition stems from its wide applicability. It can be used for finite planning horizon project and job shop environments as well as infinite horizon repetitive manufacturing environments. It does not assume any structural properties of the shop floor nor are decision maker s objectives hard coded into it. It does not specify any particular mode of capacity addition. Definition 2 provides a single reference point from which bottleneck definitions in particular production/service situations can be derived. 3

3 A classification of bottleneck definitions We classify the existing bottleneck definitions into five major groups. These are (i) Capacity based definitions (ii) Critical path based definitions (iii) Structure based definitions (iv) Algorithm based definitions and (v) System performance based definitions. Our focus is on production/service environments and we ignore references to bottlenecks in other Operations Research fields like the bottleneck assignment problem or the bottleneck traveling salesman problem. The classification exercise identified several myths associated with the concept of Myth 1: Any resource whose capacity is less than the demand placed on it is necessarily a Reality: A resource can be a non-bottleneck even if its capacity is less than the demand placed on it. Myth 2: The resource having highest capacity utilisation is necessarily the Reality: A resource can be a non-bottleneck even if its capacity utilisation is highest. Myth 3: The resource having highest workload is necessarily the Reality: A resource can be a non-bottleneck even if its workload is highest. Myth 4: Any resource with a queue before it is necessarily a Reality: A resource can be a non-bottleneck even if an infinite queue forms before it. Myth 5: The resource having the biggest queue before it is necessarily the Reality: A resource can be a non-bottleneck even if the queue before it is bigger than all other queues. Myth 6: A critical activity, path, chain or resource is necessarily a Reality: A critical activity, path, chain or resource may not be a Myth 7: A bottleneck resource is necessarily a critical resource. Reality: A resource can be a bottleneck even if it is non-critical. Myth 8: The Shifting Bottleneck heuristic is a bottleneck focused approach. Reality: The term bottleneck in the Shifting Bottleneck heuristic is a misnomer. The bottleneck definition adopted by us falls under the category of system performance based bottleneck definitions. While we do not claim to be the first to link the definition of bottleneck to system performance, our approach differs from others in providing a rigorous shadow price based theoretical framework on which the definition is based. We show how Definition 2 can be applied for diverse production environments like Projects, Job Shops, Batch Production, Assembly Lines and Continuous Flow Processes. An interesting research question is to identify situations where the average and marginal shadow prices are equivalent. For details, refer to [Mukherjee and Chatterjee(2006b)]. 4

4 Conclusions In this paper we have highlighted the existence of several bottleneck definitions in operations management literature. We have provided a classification of these bottleneck definitions. Many of these definitions do not conform to the idea of bottleneck as a constraining resource. We have proposed a universal bottleneck definition in conformance with the concept of shadow price of a resource. We have identified general conditions under which the average and marginal shadow prices would be equivalent. The equivalence of the two shadow prices has been established for four specific environments - project crashing under convex cost-time trade-offs, the 1 C max problem, the single model assembly line and the 1-commodity Continuous Flow Line. References [Goldratt and Cox(1984)] Goldratt, E. M., J. Cox. 1984. The Goal, North River Press, Crotonon-Hudson, NY. [Kim and Cho(1988)] Kim, S., S. Cho. 1988. A shadow price in integer programming for management decision. Eur. J. Oper. Res.37 328 335. [Mukherjee and Chatterjee(2006a)] Mukherjee, S., A. K. Chatterjee. 2006. The Average Shadow Price for MILPs with integral resource availability and its relationship to the Marginal Unit Shadow Price. Eur. J. Oper. Res.169 53 64 [Mukherjee and Chatterjee(2006b)] Mukherjee, S., A. K. Chatterjee. 2006. Unified Concept of Bottleneck IIMA Working Paper SeriesW.P. No. 2006-05-01 [Trietsch(2005)] Trietsch, D. 2005. From management by constraints (MBC) to management by criticalities (MBC II). Human Systems Management.24 105 115. [Tucker(1956)] Tucker, A. W. 1956. Dual systems of homogenous linear relations. Kuhn, H. W., A. W. Tucker. Linear Inequalities and Related Systems. Princeton University Press, Princeton. 5