A Comparison of Production Scheduling Policies on Costs, Service Level, and Schedule Changes (original) (raw)
Related papers
Freezing the master production schedule under single resource constraint and demand uncertainty
International Journal of Production Economics, 2003
This paper investigates the impact of freezing the master production schedule (MPS) in multi-item single-level systems with a single resource constraint under demand uncertainty. It also examines the impact of environmental factors on the selection of MPS freezing parameters. A computer model is built to simulate master production scheduling activities in a multi-item system under a rolling time horizon. The result of the study shows that the parameters for freezing the MPS have a significant impact on total cost, schedule instability and the service level of the system. Furthermore, the selection of freezing parameters is also significantly influenced by some environmental factors such as capacity tightness and cost structure. While some findings concerning the performance of MPS freezing parameters without capacity constraints can be generalised to the case of limited capacity, other conclusions under capacity constraints are different from those without capacity constraints. r 2002 Published by Elsevier Science B.V.
A master production scheduling procedure for stochastic demand and rolling planning horizons
International Journal of Production Economics, 2011
The problem of interest is a one product, uncapacitated master production schedule (MPS) in which decisions are made under rolling planning horizons. Demand is stochastic and time varying, and effectiveness is measured by inventory holding, production setup, and backorder costs. Typically, in both the research literature and the business practice the stochastic nature of the problem is modeled in an ad hoc fashion. The stochastic MPS problem is usually solved by adding safety stock to production quantities obtained from a deterministic lot-sizing algorithm. Here, the stochastic nature of the problem is explicitly considered, as an optimal algorithm for solving the static probabilistic dynamic lot-sizing problem is adapted to rolling planning horizons. The resulting algorithm is found to dominate traditional approaches over a wide variety of experimental factors, reducing total costs by an average of 16% over traditional methods.
Decision Sciences, 1996
This paper describes a simulation experiment to evaluate the relative effectiveness of rescheduling policies in capacity-constrained, just-in-time (JIT) make-to-stock production environments. Three perfonnance measures were analyzed average finished goods inventory, total units of sales lost, and a measure of schedule instability. Among the three loading methods we studied (level loading, front loading, and back loading), none was superior acms all three performance measures. Level loading was the most robust, while back loading had an interaction effect with forecasting model and capacity level. Time fence scenario was found not to be as significant a factor in system performance as reported by previous research. Once an acceptable time fence scenario is selected, attempts to optimize this factor do not appear to offer significant improvement. It was found that higher demand variation, larger forecast errors, and tight capacity lead to the degradation of system performance. Judicious use of slack capacity helps a system to incorporate the periodic schedule changes typical of JIT systems.
A Model for Master Production Scheduling in Uncertain Environments
Decision Sciences, 1992
ABSTRACT In uncertain environments, the master production schedule (MPS) is usually developed using a rolling schedule. When utilizing a rolling schedule, the MPS is replanned periodically and a portion of the MPS is frozen in each planning cycle. The cost performance of a rolling schedule depends on three decisions: the choice of the replanning interval (R), which determines how often the MPS should be replanned; the choice of the frozen interval (F), which determines how many periods the MPS should be frozen in each planning cycle; and the choice of the forecast window (T), which is the time interval over which the MPS is determined using newly updated forecast data.This paper uses an analytical approach to study the master production scheduling process in uncertain environments without capacity constraints, where the MPS is developed using a rolling schedule. It focuses on the choices of F, R, and T for the MPS. A conceptual framework that includes all important MPS time intervals is described. The effects of F, R, and T on system costs, which include the forecast error, MPS change, setup, and inventory holding costs, are also explored. Finally, a mathematical model for the MPS is presented. This model approximates the average system cost as a function of F, R, T, and several environmental factors. It can be used to estimate the associated system costs for any combination of F, R, and T.
A multi-stage stochastic programming approach in master production scheduling
European Journal of Operational Research, 2011
Master Production Schedules (MPS) are widely used in industry, especially within Enterprise Resource Planning (ERP) software. The classical approach for generating MPS assumes infinite capacity, fixed processing times, and a single scenario for demand forecasts. In this paper, we question these assumptions and consider a problem with finite capacity, controllable processing times, and several demand scenarios instead of just one. We use a multi-stage stochastic programming approach in order to come up with the maximum expected profit given the demand scenarios. Controllable processing times enlarge the solution space so that the limited capacity of production resources are utilized more effectively. We propose an effective formulation that enables an extensive computational study. Our computational results clearly indicate that instead of relying on relatively simple heuristic methods, multi-stage stochastic programming can be used effectively to solve MPS problems, and that controllability increases the performance of multi-stage solutions.
Modelling rescheduling activities in a multi–period production-inventory system
International Journal of Production Economics, 2000
Decisions for planning production activities for multi-period production}inventory systems have been studied in a number of papers applying input}output analysis and the Laplace transform. The decisions have concerned activities spread out over time without having the opportunity to adjust future decisions when the external and/or internal circumstances change. In this paper, we extend the analysis to situations when rescheduling is possible. Firstly, di!erent classes of causes justifying rescheduling activities are presented including periodic rescheduling and`net changea. Secondly, in terms of previously developed theory, we model the behaviour of a simple single-level production}inventory system for which its production plan may be modi"ed at one point in the future.
European Journal of Operational Research, 2011
We present a heuristic optimization method for stochastic production-inventory systems that defy analytical modelling and optimization. The proposed heuristic takes advantage of simulation while at the same time minimizes the impact of the dimensionality curse by using regression analysis. The heuristic was developed and tested for an oil and gas company, which decided to adopt the heuristic as the optimization method for a supply-chain design project. To explore the performance of the heuristic in general settings, we conducted a simulation experiment on 900 test problems. We found that the average cost error of using the proposed heuristic was reasonably low for practical applications.
Setting planned orders in master production scheduling under demand uncertainty
International Journal of Production Research, 2011
For single end-product master production scheduling with time-varying demand uncertainty and supply capacity, we study approaches to set replenishment quantities over the planning horizon. We present a stochastic programming model along with a simulation-based optimisation and two traditional approaches for setting order quantities. We compare these approaches to two new methods: gamma approximation and safety stock search. Computational experiments show that the gamma approximation and safety stock search perform well in terms of holding and shortage costs, with expected total cost on average, respectively, within 0.06% and 0.66% of the optimal from the stochastic program. On average, the two traditional approaches incur 12% and 45% higher cost than optimal. We provide managerial insights on the effects of parameters such as demand coefficient of variation (cv), utilisation, and target service level on the optimal total cost, the corresponding fill rate, and the relative performance of the approaches. We find that, for finite-normal demand, on average, the impact of target service level on cost is larger than that of demand cv, whose impact is larger than utilisation, except at high utilisation. We illustrate that, when demand is not normal, the gamma approximation significantly outperforms the existing normal approximation from .