Managing Supply Chain Risk
Managing Supply Chain Risk
Managing Supply Chain Risk
Mark L. Spearman
Factory Physics Inc.
A Risky World
In recent years, companies have begun to realize the severity of the risk facing the entire corporation
by not addressing supply chain risk. Indeed, more than two-thirds of the companies surveyed by
Accenture said they had experienced a supply chain disruption from which they took more than one
week to recover (Manufacturing Business Technology 2006). Furthermore, the study revealed that 73
percent of the executives surveyed had a major disruption in the past five years. Of these, 36
percent took more than one month to recover. Why does it take companies so long to recover?
Why are so many companies susceptible to disruption? Do the new Advanced Planning and
Optimization systems offer any help? I plan to address these and other issues in this article.
There are at least two reasons why modern supply chains are so susceptible to such disruption: (1)
supply chains are not designed with risk in mind and (2) modern planning and scheduling systems
and practices are not robust enough to operate under conditions significantly different from those
for which they are planned.
Last Century Supply Chain Planning
Although MRP, MRP II and even ERP are now so last century, to use my daughters favorite
phrase, it is useful to see what works and what doesnt. The goal of these systems has always been
to reduce inventory, improve customer service, and to reduce cost by increasing the utilization of
expensive equipment and labor. Unfortunately, these systems do not explicitly consider risk and
have ignored key facts regarding the processes they try to control.
The first attempts in this area date back to the 1960s beginning with Material Requirements Planning
(MRP) that provided material plans with no consideration of capacity. This evolved into
Manufacturing Resources Planning (MRP II) which provided some capacity checking modules
around the basic MRP functionality. Interestingly, virtually all ERP systems today (including the
high end offerings of SAP and Oracle) continue to have the same basic MRP calculations as the core
of their production planning offering. Not surprisingly, a recent survey (Burns 2006) showed that
users gave low marks to these high end, typically expensive, ERP/SCM systems for performance in
distribution and manufacturing (averaging 2.5 and 2.6, respectively, out of 4.0). In a survey
performed by Microsoft of mid-sized companies (median revenue of $21 million, average around
$100 million) 27 percent of 229 companies found their ERP/SCM system to be ineffective and 46
percent found it to be only somewhat effective. Only three percent found the system used to be
very effective.
There are two basic problems with these systems: (1) lot sizing is done without consideration of
capacity and (2) planning lead times are assumed to be attributes of the part. The first issue results
in conservative (i.e., large) lot sizes which increase inventory and reduce responsiveness. The second
www.factoryphysics.com Page 2 of 8
issue is similar. Because the planning lead time does not depend on current work in process (WIP)
levels and because being late (resulting in poor customer service) is worse than being early (resulting
in extra inventory), most systems employ pessimistic (i.e., long) lead times. The result, again, is more
inventory and less responsiveness and is especially aggravated when the bill of material is deep.
Efforts to address these problems have gone on for many years. Almost twenty years ago Kanet
(1988) described problems with contemporary planning systems that remain today. Consequently,
most companies do not run their plants using the output of their ERP/SCM systems but, instead,
massage the output using ad hoc spreadsheets.
21
st
Century Supply Chain Planning Problems
Obviously, with this kind of work around there exists an opportunity to sell more sophisticated
software and for some time now there have been numerous offerings. These applications are
typically deterministic simulations of the process that assume the demand, inventory, work in
process, run rates, setup times, etc. are all known and then seek to generate a schedule that is
optimal under some specified criteria. One of the earliest of these that was moderately successful
is the Factory Planner software that has been offered by i2 under various names (e.g., Rhythm)
since 1988. Interestingly, the new offerings by Oracle and SAP appear to be different only in style
and, perhaps, in the level of integration with other data.
Nonetheless, there are at least three problems that prevent the approach of using deterministic
simulation from being effective in managing supply chain risk:
1. The supply chain and plant have inherent randomness that does not allow for the
complete specification of a time for each job with a given labor component at each process center.
Such detailed schedules often quickly become out of date because of the intrinsic variability in the
system. Moreover detailed schedules do not manage risk which involves random events which may
or may not happen. In the past, the disconnect between detailed schedules and the inherent
randomness in all processes has been addressed using ever more detailed models requiring ever
more computer power. This misses the point. Variability and risk are facts of life and are the result
of not only process variation (something that one attempts to control) but also unforeseen events
and variability in demand (things that cannot be controlled). At any rate, the result is the same
regardless of the variability source. Detailed scheduling can only provide a very short term solution
and, in practice, the solution often becomes invalid between the time it is generated and the time
that the schedule is distributed and reviewed as part of production planning meetings.
2. The detailed scheduling system must be re-run often because of the short term nature
of the solution. This becomes cumbersome and time consuming. Moreover, without a method for
determining whether a significant change has occurred, oftentimes the schedule is regenerated in
response to random noise (e.g., a temporary lull in demand) which is then fed back into the system.
Unfortunately, feeding back random noise results in an increase in the variability in the system being
controlled (Sterman 2000). Because of these problems, many companies have turned off their
Advanced Planning and Scheduling systems after spending a great deal of money to install them.
One of our own clients, a biopharmaceutical company, shut down its advanced planning and
optimization module after trying to manage the massive data collection efforts for keeping it fed.
3. It is impossible to find an optimal schedule. The scheduling problems addressed are
mathematically characterized as NP-Hard which means that no algorithm exists that works in
polynomial time to provide an optimal scheduling solution. The practical result is that for realistic
problems faced in modern factories and in the supply chain, there has not been enough time since
the beginning of the universe to find an optimal schedule regardless of the speed of the computer.
Consequently, heuristics must be applied to generate a, hopefully, near optimal schedule. The
effectiveness of these heuristics is typically unknown for a broad range of applications.
The result is that a great deal of computer power is used to create a detailed schedule for a single
instance that will never happen (i.e., the random sample path will never be what is predicted a
priori) and the schedule becomes obsolete as soon as something unanticipated occurs. Effectively,
detailed schedules never reflect current conditions.
The most advanced systems today offer two methods of planning for manufacturing supply chains:
(1) what-if analysis using a deterministic simulation of the supply chain and (2) optimization of
a set of penalties (again, using a deterministic simulation) associated with inventory, on-time
delivery, setups, and wasted capacity.
In addition to the fundamental problems listed above there are two practical problems with this
approach: (1) what-if analysis is tedious and (2) optimizing a penalty function is not intuitive.
The tediousness of what-if analysis comes from all the detail that must be considered. Figure 1
shows the output of a typical APO application. The graph shows the scheduled production on six
machines in one factory along with projected inventory plot of one of the items produced. The
planner can move jobs in the schedule and drill down on other items to view inventory projections.
While this level of integration is impressive, it is not particularly useful especially when there are
hundreds of machines (not to mention labor) to consider along with thousands of individual items,
each with their own demand.
Likewise, the use of penalties to determine an optimal schedule is not intuitive. What should
the penalty be for carrying additional inventory? What is the cost of a late order? What are the
savings generated by reducing the number of setups, particularly if there is no reduction in head
count? What is the cost of having idle machines? Penalties such as these are, at best, an estimate and
the source of endless internal wrangling between production and accounting.
Thus, there is currently a huge gap between what is needed and what is offered. Described below is
the means to combine existing technology with new technology that can address all of these issues
without the tediousness or the complexity of modern APO systems.
Figure 1: Output of APO application showing a production schedule and inventory
www.factoryphysics.com Page 3 of 8
www.factoryphysics.com Page 4 of 8
Factory Physics