MANAGERIAL ECONOMICS & DECISION SCIENCES; OPERATIONS
Senior Associate Dean: Curriculum and Teaching
Harold L. Stuart Professor of Managerial Economics
Professor of Operations Management
Jan A. Van Mieghem is Senior Associate Dean: Curriculum and Teaching, the Harold L. Stuart Distinguished Professor of Managerial Economics and Professor of Operations Management at the Kellogg School of Management at Northwestern University. From 2006 – 2009, he served as the chairman of the Department of Managerial Economics and Decision Sciences. He received his PhD from Stanford University.
His research and teaching focuses on product, service and supply chain operations and studies both strategic questions as well as tactical execution. He is past editor of the operations and supply chain area of Operations Research and has served on the editorial board of several professional journals. He is the author of over 30 academic articles published in the leading journals, and of two textbooks. The first book is on operations management and his new book on operations strategy was published in September 2007. His paper co-authored with Marty Lariviere received the first MSOM best paper award in 2007
Cycle Time Management
Response Time Management
Tactical Operations
- Recent Media Coverage
Economist Intelligence Unit: Executive Briefing: Global dual sourcing strategies - 7/3/2009
See all Kellogg in the Media
- Recent Kellogg News
Intensive ‘mini MBA’ program offers new Kellogg faculty tools to excel - 9/12/2008
See all Kellogg News
1/01/2006
When designing a sourcing strategy in practice, a key task is to determine the average order rates placed to each source because that affects costs and supplier management. We consider a firm that has access to a responsive near-shore source (e.g., Mexico) and a low-cost offshore source (e.g., China). The firm must determine an inventory sourcing policy to satisfy random demand over time. Unfortunately, the optimal policy is too complex to allow a direct answer to our key question. Therefore, we analyze a tailored base-surge (TBS) sourcing policy that is simple, used in practice, and captures the classic tradeoff between cost and responsiveness. The TBS policy replenishes at a constant rate from the offshore source and produces at the near shore plant only when inventory is below a target. The constant base allocation allows the offshore facility to focus on cost efficiency while the nearshore’s quick response capability is utilized only dynamically to guarantee high service. The research goals are to i) determine the allocation of random demand into base and surge capacity, ii) estimate corresponding working capital requirements, and iii) identify and value the key drivers of dual sourcing. Given that even this simple TBS policy is not amenable to exact analysis, we investigate a Brownian approximation that yields a simple “square-root” formula that is insightful to answer our questions and sufficiently accurate for practice, as is demonstrated with a validation study.
This paper examines how internal competiton and judicious rework allocation can improve qualty and bottom line results. It is motivated by the practive of a service operations firm, Memphis Auto Auctions. MAA uses a non conventional rework allocation process, according to which each team is paid only if the work is of good quality. All payments for units that are reworked are made to the competing (other)team. This internal competition contrasts with the conventional one, that assigns rework back to the original one. In this paper, we investigate quality improvement incentives of the this rework allocation and payment scheme.
We investigate how network design impacts capacity requirements and responsiveness, which is a natural performance indicator of quality of service. Inspired by the contrasting network design approaches of FedEx and UPS, we study when two service classes (e.g., express or regular) should be served by dedicated resources (e.g., air or ground) or by an integrated network. We present analytic expressions for the delay distributions and the network integration value, which show how the value of network integration depends on the quality of service guarantees (speed and reliability of service) and the demand characteristics (averages volume and variance of each service class and their correlation). Our results suggests that operating dedicated networks is a fine strategy (meaning that network integration is of little value) if the firm primarily serves express requests with high reliability and if the correlation with regular requests is not strongly negative.
Moving production to low-wage countries may reduce manufacturing costs, but increases logistics costs and introduces foreign trade barriers, among others. This paper studies a manufacturer's multi-market facility network design problem and investigates the offshoring decision from a network capacity investment perspective. We analyze a firm that manufactures two products to serve two geographically separated markets using a common component and two localized final assembly. The common part can be transported between the two markets that have different demand and economic characteristics. Two strategic network design questions arise naturally in this context: (1) Should the common part be produced centrally or in two local facilities? (2) If a centralization strategy is adopted for the common component, which market should the facility be located in? We present a transportation cost threshold that captures costs, revenues, and demand risks, and below which centralization is optimal. The optimal location of commonality crucially depends on the relative magnitude of price and manufacturing cost differentials but also on demand size and uncertainty. Incorporating scale economies further enlarges the centralization's optimality region. Finally, we translate our results into managerial insights for assessing the value of offshoring through direct capacity investment.
This paper studies how judicious resource allocation in networks mitigates risk. Theory is presented for general utility functions and mean-variance formulations and is illustrated with networks featuring resource diversification, flexibility (e.g., inventory substitution), and sharing (commonality). In contrast to single-resource settings, risk-averse newsvendors may invest more in networks than risk-neutral newsvendors: some resources and even total spending may exceed risk-neutral levels. With normally distributed demand, risk-averse newsvendors change resource levels roughly proportionally to demand variance while risk-neutral agents adjust only proportionally to standard deviation. Two effects explain this operational hedge and suggest rules of thumb for strategic placement of safety capacity and inventory in networks. (1) Risk pooling suggests re-balancing capacity toward inexpensive resources that serve lower profit variance markets. This highlights the role of profit variance (instead of demand variance) in risk-averse network investment. (2) Ex-post revenue maximization suggests re-balancing capacity toward flexible but away from shared capacity when markets differ in profitability. Capacity imbalance and allocation flexibility thus mitigate profit risk and truly are operational hedges.
We study how multi-product queueing systems should be controlled so that sojourn times (or end-to-end delays) do not exceed specified leadtimes. The network dynamically decides when to admit new arrivals and how to sequence the jobs in the system. To analyze this difficult problem, we propose an approach based on fluid model analysis that translates the leadtime specifications into deterministic constraints on the queue length vector. The main benefit of this approach is that it is possible (and relatively easy) to construct scheduling and multi-product admission policies for leadtime control. Additional results are: (a) While this approach is simpler than a heavy-traffic approach, the admission policies that emerge from it are also more specific than, but consistent with, those from heavy-traffic analysis, (b) A simulation study gives a first indication that the policies also perform well in stochastic systems, (c) Our approach specifies a "tailored" admission region for any given sequencing policy. Such joint admission and sequencing control is "robust" in the following sense: system performance is relatively insensitive to the particular choice of sequencing rule when used in conjunction with tailored admission control. As an example, we discuss the tailored admission regions for two well-known sequencing policies: Generalized Processor Sharing and Generalized Longest Queue. (d) While we first focus on the multi-product single server system, we do extend to networks and identify some subtleties.
Commonality strategies assemble different products from at least one common component and one other product-specific component. The distinguishing feature of commonality, i.e., the presence of dedicated components to be assembled with a common component, is shown to be mathematically inconsequential in the sense that the unified commonality problem for two products can be reduced to an equivalent substitution flexibility problem without those dedicated components. This significant simplification provides the first general, closed-form condition for commonality adoption and identifies its value drivers. Commonality is optimal even for perfectly correlated demands if products have sufficiently different margins. This introduces the "revenue maximization option" of commonality as a second benefit that is independent of the traditional risk pooling benefit. "Pure commonality" strategies are never optimal unless complexity costs are introduced. Dual sourcing, externalities and operational hedging features of commonality are discussed.
A delay-sensitive customer prefers arriving for service when few or no other customers are in the system. We consider how such a customer should strategically arrive to a service system. We present a model in which strategic customers acting in a self-interested fashion give rise to Poisson arrivals.
This article reviews the literature on strategic capacity management concerned with determining the sizes, types, and timing of capacity investments and adjustments under uncertainty. Specific attention is given to recent developments to incorporate multiple decision makers, multiple capacity types, hedging and risk aversion. Capacity is a measure of processing abilities and limitations and is represented as a vector of stocks of various processing resources, while investment is the change of capacity and includes expansion and contraction. After discussing general issues in capacity investment problems, the article reviews models of capacity investment under uncertainty in three settings: The first reviews optimal capacity investment by single and multiple risk-neutral decision makers in a stationary environment where capacity remains constant. Allowing for multiple capacity types, the associated optimal capacity portfolio specifies the amounts and locations of safety capacity in a processing network. Its key feature is that it is unbalanced, i.e., regardless of how uncertainties are realized, one typically will never fully utilize all capacities. The second setting reviews the adjustment of capacity over time and the structure of optimal investment dynamics. The article ends by reviewing how to incorporate risk-aversion in capacity investment and contrasts hedging strategies involving financial versus operational means.
Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: any class k job arriving at time t must be served by its due date t+D_{k}. Equivalently, its delay ¦Ó_{k} must not exceed a given delay or lead-time D_{k}. In a stochastic system the constraint ¦Ó_{k}¡ÜD_{k} must be interpreted in a probabilistic sense. Regardless of the precise probabilistic formulation, however, the associated optimal control problem is intractable with exact analysis. This article proposes a new formulation that incorporates the constraint through a sequence of convex-increasing delay cost functions. This formulation reduces the intractable optimal scheduling problem into one for which the Generalized c¦Ì (Gc¦Ì) scheduling rule is known to be asymptotically optimal. The Gc¦Ì rule simplifies here to a generalized longest queue (GLQ) or generalized largest delay (GLD) rule, which are defined as follows. Let N_{k} be the number of class k jobs in system, ¦Ë_{k} their arrival rate and a_{k} the age of their oldest job in the system. GLQ and GLD are dynamic priority rules, parameterized by ¦È: GLQ(¦È) serves FIFO within class and prioritizes the class with highest index ¦È_{k}N_{k}, whereas GLD(¦È) uses index ¦È_{k}¦Ë_{k}a_{k}. The argument is presented first intuitively, but is followed by a limit analysis that expresses the cost objective in terms of the maximal due-date violation probability. This proves that GLQ(¦È_{∗}) and GLD(¦È_{∗}), where ¦È_{∗,k}=1/¦Ë_{k}D_{k}, asymptotically minimize the probability of maximal due-date violation in heavy traffic. Specifically, they minimize liminf_{n¡ú¡Þ}Pr{max_{k}sup_{s¡Ê[0,t]}((¦Ó_{k}(ns))/(n^{1/2}D_{k}))¡Ýx} for all positive t and x, where ¦Ó_{k}(s) is the delay of the most recent class k job that arrived before time s. GLQ with appropriate parameter ¦È_{¦Á} also reduces "total variability" because it asymptotically minimizes a weighted sum of ¦Á^{th} delay moments. Properties of GLQ and GLD, including an expression for their asymptotic delay distributions, are presented.
We introduce a class of models, called newsvendor networks, that generalizes the well-known newsven- dor model along three dimensions. Newsvendor networks model the flow of multiple products through multiple processing and storage points over multiple time periods. Such models provide a parsimonious framework to study various problems of stochastic capacity investment and inventory procurement. Newsvendor networks can feature commonality, flexibility, substitution or transshipment in addition to assembly and distribution. Newsvendor networks are stochastic models with recourse that are characterized by linear revenue and cost structures and a linear input-output transformation. While capacity and inventory decisions are locked in before demand uncertainty is resolved as usual, some managerial discretion can remain via ex-post input-output activity decisions. This discretion is captured through non-basic activities that model input- or resource-substitution and that result in subtle pooling effects. Non-basic activities are never used in a deterministic environment; their value stems from the discre- tionary flexibility to meet stochastic demand deviations from the operating point. The optimal capacity and inventory decisions balance overages with underages. Continuing the classic newsvendor analogy, the optimal balancing conditions can be interpreted as specifying multiple "critical fractiles" of the multivariate demand distribution. This paper shows that the properties of optimal single-period newsvendor network solutions extend to a dynamic setting under plausible conditions. Indeed, we establishes dynamic optimality of inventory and capacity policies for the lost sales case. Depending on the non-basic activities, this also extends to the backordering case. Analytic and simulation-based solution techniques and graphical interpretations are presented and illustrated by a comprehensive example that features input substitution and a flexible processing resource.
We present an integrated approach to pricing and scheduling for services that are differentiated in terms of throughput, delay and loss specifications. The key building block to the model are quality value curves that specify a user's value of higher quality levels. From the analysis emerges a pricing rule that charges based on rate and quality grade, and a dynamic scheduling rule, called the Gc-mu rule. The analysis also derives the economically-optimal probabilistic QoS guarantee parameters. We compare our model to the deterministic approach of QoS guarantees using burstiness con- straints and fair scheduling rules. The scheduling that arises from such deterministic approach is the well-known Generalized Processor Sharing (GPS). A comparative analysis inspires the fair Gc-mu-PS rule as the scheduling rule that combines the unique strengths of GPS and Gc-mu. This Gc-mu-PS rule is proposed as a tailored scheduling solution for both the Expedited Forwarding class and the four Assured Forwarding classes in the lETF's Differentiated Services.
This article studies the optimal prices and service quality grades that a queuing system—the "firm"—provides to heterogeneous, utility-maximizing customers who measure quality by their experienced delay distributions. Results are threefold: First, delay cost curves are in- troduced that allow for a flexible description of a customer's quality sensitivity. Second, a comprehensive executable approach is proposed that analytically specifies scheduling, delay distributions and prices for arbitrary delay sensitivity curves. The tractability of this approach derives from porting heavy-traffic Brownian results into the economic analysis. The generalized c/.t (Gc^t) scheduling rule that emerges is dynamic so that, in general, service grades need not correspond to a static priority ranking. A benchmarking example investigates the value of differentiated service. Third, the notions of grade and rate incentive compatibility (1C) are introduced to study this system under asymmetric information and are established for GC scheduling when service times are homogeneous and customers atomistic. Grade 1C induces correct grade choice resulting in perfect service discrimination; rate 1C additionally induces centralized-optimal rates. Dynamic GC scheduling exhibits negative feedback that, together with time-dependent pricing, can also yield rate incentive compatibility with heterogeneous service times. Finally, multiplan pricing, which offers all customers a menu with a choice of multiple rate plans, is analyzed.
The Internet is revolutionizing the way companies conduct business. Or is it? We argue that the value of the internet for a firm is strongly dependent on the firm's industry and on the strategy it pursues. A survey of firms with an online presence displays wide disparities in performance. while Dell has succesfully used the internet to boost revenues and earnings, Amazon lost $585 million on revenues of $1.6 billion in 1999. Firms that fully exploit the revenue enhancements and cost reduction opportunities offered by the interent and optimally integrate e-business with existing channels are likely to be the big winners in the internet age.
We value the option of subcontracting to improve financial performance and system coordination by analyzing a competitive stochastic investment game with recourse. The manufacturer and subcontractor decide separately on their capacity investment levels. Then demand uncertainty is resolved and both parties have the option to subcontract when deciding on their production and sales. We analyze and present outsourcing conditions for three contract types: (1) price-only contracts where an ex-ante transfer price is set for each unit supplied by the subcontractor; (2) incomplete contracts, where both parties negotiate over the subcontracting transfer; and (3) state-dependent price-only and incomplete contracts for which we show an equivalence result. While subcontracting with these three contract types can coordinate production decisions in the supply system, only state-dependent contracts can eliminate all decentralization costs and coordinate capacity investment decisions. The minimally sufficient price-only contract that coordinates our supply chain specifies transfer prices for a small number (6 in our model) of contingent scenarios. Our game-theoretic model allows the analysis of the role of transfer prices and of the bargaining power of buyer and supplier. We find that sometimes firms may be better off leaving some contract parameters unspecified ex-ante and agreeing to negotiate ex-post. Also, a price-focused strategy for managing subcontractors can backfire because a lower transfer price may decrease the manufacturer's profit. Finally, as with financial options, the option value of subcontracting increases as markets are more volatile or more negatively correlated.
Consider a firm that markets multiple products, each manufactured using several resources representing various types of capital and labor, and a linear production technology. The firm faces uncertain product demand and has the option to dynamically readjust its resource investment levels, thereby changing the capacities of its linear manufacturing process. The cost to adjust a resource level either up or down is assumed to be linear. The model developed here explicitly incorporates both capacity investment decisions and production decisions, and is general enough to include reversible and irreversible investment. The product demand vectors for successive periods are assumed to be independent and identically distributed. The optimal investment strategy is determined with a multi-dimensional newsvendor model using demand distributions, a technology matrix, prices (product contribution margins), and marginal investment costs. Our analysis highlights an important conceptual distinction between determin- istic and stochastic environments: the optimal investment strategy in our stochastic model typically involves some degree of capacity imbalance which can never be optimal when demand is known.
This article presents a comparative analysis of possible postponement strategies in a two-stage decision model where firms make three decisions: capacity investment, production (inventory) quantity, and price. Typically, investments are made while the demand curve is uncertain. The strategies differ in the timing of the operational decisions relative to the realization of uncertainty. We show how competition, uncertainty, and the timing of operational decisions influence the strategic investment decision of the firm and its value. In contrast to production postponement, price postponement makes the investment and production (inventory) decisions relatively insensitive to uncertainty. This suggests that managers can make optimal capacity decisions by deterministic reasoning if they have some price flexibility. Under price postponement, additional postponement of production has relatively small incremental value. Therefore, it may be worthwhile to consider flexible ex-post pricing before production postponement reengineering. While more postponement increases firm value, it is counterintuitive that this also makes the optimal capacity decision more sensitive to uncertainty. We highlight the different impact of more timely information, which leads to higher investment and inventories, and of reduced demand uncertainty, which decreases investment and inventories. Our analysis suggests appropriateness conditions for simple make-to-stock and make-to-order strategies. We also present technical sufficiency and uniqueness conditions. Under price postponement, these results extend to oligopolistic and perfect competition for which pure equilibria are derived. Interestingly, the relative value of operational postponement techniques seems to increase as the industry becomes more competitive.
This article studies optimal investment in flexible manufacturing capacity as a function of product prices (margins), investment costs and multivariate demand uncertainty. We consider a two-product firm that has the option to invest in product-dedicated resources and/or in a flexible resource that can produce either product, but has to make its investment decision before demands are observed. The flexible resource provides the firm with a hedge against demand uncertainty, but at a higher investment cost than the dedicated resources. Our analysis highlights the important role of price (margin) and cost mix differentials, which, in addition to the correlation between product demands, significantly affect the investment decision and the value of flexibility. Contrary to the intuition also prevalent in the academic literature, we show that it can be advantageous to invest in flexible resources even with erfectly positively correlated product demands.
Brownian networks are a class of linear stochastic control systems that arise as heavy traffic approximations in queueing theory. Such Brownian system models have been used to approximate problems of dynamic routing, dynamic sequencing and dynamic input control for queueing networks. A number of specific examples have been analyzed in recent years, and in each case the Brownian network has been successfully reduced to an "equivalent workload formulation" of lower dimension. In this article we explain that reduction in general terms, using an orthogonal decomposition that distinguishes between reversible and irreversible controls.
We characterize a firm's optimal factor adjustment when any number of factors faced "kinked" linear adjustment costs so that all factor accumulation is costly to reverse. We first consider a general non-stationary case with a concave operating profit function, unrestricted form of uncertainty and a horizon of arbitrary length. We show that the optimal investment strategy follows a control limit policy at each point in time. The state space of the firm's problem is partitioned into various domains, including a continuation region where no adjustment shoudl optimally be made to factor levels. We then consider two specific model classes and exploit their special structure to derive expressions for their continuation regions.
We consider a general single-server multiclass queueing system that incurs a delay cost Csubk/sub(τsubk/sub) for each class k job that resides τsubk/sub units of time in the system. This paper derives a scheduling policy that minimizes the total cumulative delay cost when the system operates during a finite time horizon. Denote the marginal delay cost function and the (possibly nonstationary) average processing time of class k by csubk/sub = C'subk/sub and 1/μsubk/sub, respectively, and let asubk/sub(t) be the "age" or time that the oldest class k job has been waiting at time t. We call the scheduling policy that at time t serves the oldest waiting job of that class k with the highest index μsubk/sub(t)csubk/sub(asubk/sub(t)), the generalized cμ rule. As a dynamic priority rule that depends on very little data, the generalized cμ rule is attractive to implement. We show that, with nondecreasing convex delay costs, the generalized cμ rule is asymptotically optimal if the system operates in heavy traffic and give explicit expressions for the associated performance characteristics: the delay (throughput time) process and the minimum cumulative delay cost. The optimality result is robust in that it holds for a countable number of classes and several homogeneous servers in a nonstationary, deterministic or stochastic environment where arrival and service processes can be general and interdependent.
In this paper we present a new algorithm for enhancing the accuracy of the parameter extraction of straight lines in a two-dimensional image. The algorithm achieves high accuracy in comparatively less computational time than most traditional methods and is invariant under rotation and translation. The Iterative Total Least Squares (ITLS) method starts from an initial estimate of the line parameters. When no a priori information about the image is available this estimate can be assigned randomly. Alternately, a lower accuracy method can be used to generate an initial estimate which will result in faster convergence. Then, a rectangular window is centered using the current line approximation, and a new line estimate is generated by making a total least squares fit through the pixels contained within the window. This is repeated until convergence is reached. Adaptively adjusting the window size yields the 4D ITLS process. In addition, a pairwise accelerated ITLS method has been developed which substantially increases the convergence rate. We conclude with some examples where the ITLS method has been used successfully.
This paper addresses a correlation based nearest neighbor pattern recognition problem where each class is given as a collection of subclass templates. The recognition is performed in two stages. In the first stage the class is determined. Templates for this stage are created using the subclass templates. Assignment into subclasses occurs in the second stage. This two stage approach may be used to accelerate template matching. In particular, the second stage may be omitted when only the class needs to be determined. The authors present a method for optimal aggregation of subclass templates into class templates. For each class, the new template is optimal in that it maximizes the worst case (i.e. minimum) correlation with its subclass templates. An algorithm which solves this maximin optimization problem is presented and its correctness is proved. In addition, test results are provided, indicating that the algorithm's execution time is polynomial in the number of subclass templates. The authors show tight bounds on the maximin correlation. The bounds are functions only of the number of original subclass templates and the minimum element in their correlation matrix. The algorithm is demonstrated on a multifont optical character recognition problem
We study a closed, three-station queueing network with general service time distributions and balanced workloads (that is, each station has the same relative traffic intensity). If the customer population is large, then the queue length process of such a network can be approximated by driftless reflected Brownian motion (RBM) in a simplex. Building on earlier work by Harrison, Landau ands Shepp, we develop explicit formulas for various quantities associated with the stationary distribution of RBM in a general triangle and use them to derive approximate performance measures for the closed queueing network. In particular, we develop approximations for the throughput rate and for moments and tail fractiles of the throughput time distribution. Also, crude bounds on the throughput rate and mean throughput time are proposed. Finally, we present three examples that test the accuracy of both the Brownian approximation and our performance estimates.
Flexibility measures the ability to adapt to change and often has multiple dimensions that impact value jointly yet differently. We assess this joint impact in a theoretical model of a two-product firm that makes capacity, output and pricing decisions at three points in time with an underlying continuous-time information evolution. The firm's ability to adapt is characterized by three types of flexibility. The cost of switching capacity between the two products measures the firm's mix flexibility. The fraction of product costs that are postponed until demand information is updated measures the firm's volume flexibility. Finally, the relative timing of the output decision measures the firm's time flexibility. We show that mix and volume flexibilities are substitutes in creating firm value but both are complementary to time flexibility. Furthermore, the marginal values of mix and time flexibility are decreasing in demand correlation whereas the marginal value of volume flexibility increases in demand correlation. We discuss the implications of these results to the trade-offs faced by managers when deciding how much to invest in different aspects of flexibility. We also relate these results to corporate strategy and show when different types of flexibility can justify a company to pursue market diversification.
Operations Strategy: Practices and Principles provides a unified framework for operations strategy. The book shows how to tailor the operational system to maximize value and competitive advantage. Conceptual thinking and financial optimization yield guidelines for implementation. This dual emphasis on principles and practice is reflected by analytical models that are illustrated with detailed examples and a dozen case studies of real business situations.
This is the second edition of our 1999 text on operations management.
This course counts toward the following majors:Operations.
Operations management is the management of business processes--that is, the management of the recurring activities of a firm. This course aims to familiarize students with the problems and issues confronting operations managers, and to provide the language, concepts, insights and tools to deal with these issues to gain competitive advantage through operations. We examine how different business strategies require different business processes and how different operational capabilities allow and support different strategies to gain competitive advantage. A process view of operations is used to analyze different key operational dimensions such as capacity management, cycle time management, supply chain and logistics management, and quality management. Finally, we connect to recent developments such as lean or world-class manufacturing, just-in-time operations, time-based competition and business re-engineering.
Prerequisite: DECS-433 or DECS-436.
Operations Strategy (OPNS-454-0)
This course counts toward the following majors: Analytical Consulting, Operations.
In this course, students learn how operations strategy can add value by tailoring a set of core principles to a specific business setting. The course provides a framework to formulate an operations strategy and analyze, value, and optimize the key decisions involved in operations strategy. The key evaluation metric is how operations strategy impacts the net present value of the firm. The key decisions studied are choosing competitive operational competencies and benchmarking; capacity expansion, timing, flexibility and location; sourcing and contracting; risk management and operational hedging; revenue management; improvement and learning.
This course builds on the core operations class. Students should also be familiar with the basics of finance, economics and strategy, as the strategic decisions studied in this course require a detailed analysis and understanding of the underlying operations. Thus this course has a greater amount of concreteness and detail than a competitive strategy class, and uses a combination of in-depth case analysis, mini-lectures, presentations and qualitative discussions of other examples. The course is intended for students interested in operations and supply chain management, general management, or management consulting.
Operations Management examines the basic principles of managing the production and distribution of goods and services. The course approaches operations as a managerial integration function and provides frameworks and tools to target and implement improvements in business processes.
PHONE: 847-491-5481
FAX: 847-467-1220
Jacobs Center Room 542