Engineering
Vol.06 No.12(2014), Article ID:51362,15 pages
10.4236/eng.2014.612075
Optimal Aggregate Production Plans via a Constrained LQG Model
Oscar S. Silva Filho
Center for Information Technology Renato Archer—CTI, Campinas, Brazil
Email: oscar.salviano@cti.gov.br
Copyright © 2014 by author and Scientific Research Publishing Inc.
This work is licensed under the Creative Commons Attribution International License (CC BY).
http://creativecommons.org/licenses/by/4.0/



Received 27 August 2014; revised 25 September 2014; accepted 14 October 2014
ABSTRACT
In this paper, a single product, multi-period, aggregate production planning problem is formulated as a linear-quadratic Gaussian (LQG) optimal control model with chance constraints on state and control variables. Such formulation is based on a classical production planning model developed in 1960 by Holt, Modigliani, Muth and Simon, and known, since then, as the HMMS model [1] . The proposed LQG model extends the HMMS model, taking into account both chance-constraints on the decision variables and data generating process, based on ARMA model, to represent the fluctuation of demand. Using the certainty-equivalence principle, the constrained LQG model can be transformed into an equivalent, but deterministic model, which is called here as Mean Value Problem (MVP). This problem preserves the main properties of the original model such as convexity and some statistical moments. Besides, it is easier to be implemented and solved numerically than its stochastic version. In addition, two very simple suboptimal procedures from stochastic control theory are briefly discussed. Finally, an illustrative example is introduced to show how the extended HMMS model can be used to develop plans and to generate production scenarios.
Keywords:
Production Planning, Operations Management, Stochastic Models, Optimization, Forecasting

1. Introduction
A production planning process requires a set of decisions used to match company’s industrial resources to the customer demand fluctuation. Among the first decisions to be made there is the development of aggregate production plan. The main objective of this plan is to determine aggregate levels of production, inventory and workforce in order to meet the expected demand for products within a planning horizon that usually ranges from six months to one year. Once the plan is generated, constraints are imposed on the detailed production scheduling process allowing specify the proper amount of material resources needed to produce each product. Therefore, someone may say that the development of an efficient production plan is the first step to reducing costs with material resources of a company.
Due to uncertainties of the production environment, the aggregate plan must be constantly updated in order to provide efficient production targets for the short term planning process, see, e.g., [2] - [5] . As a consequence, no-sequential (i.e., static) stochastic optimization models are inappropriate to represent this kind of environment. The main reason is that these models do not take into account any new information available over the time-pe- riods about the current state of the production system [6] . Thus, sequential constrained stochastic optimization models, based on the theory of stochastic dynamic programming and optimal control theory, are the most-ap- propriate options for modeling this type of problem, see [2] and [7] - [10] .
The objective of this paper is to develop a production plan from a well-structured sequential stochastic production planning model with chance-constraints on the decision variables. In this way, the classical aggregate production planning model developed by Holt, Modigliani, Muth and Simon—HMMS model, see [11] —is used as a pattern of reference. The HMMS model yields magnitude of production-rate, workforce level and net inventory per period that are optimal in that they are provided by minimizing the overall expected quadratic cost of running a production system. The idea is to propose an extension of the HMMS model to allow randomness in products’ demand and chance-constraints on decision variables. The sequential stochastic model follows the two steps: first step considers an equivalent state-space time-discrete LQG model with constraints on decision variables to represent the classical HMMS model. Additionally, the data generating process for demand forecasting are incorporated into the model. Such a process is based on state-space Auto-Regressive Moving-Average (ARMA) model; see [12] . In the second step, a method, based on both mathematical programming and stochastic control theory, is applied to model in order to provide a sequential optimal production plan.
Due to particular features of the constrained LQG model—such as dimensionality, constraints on decision variables, and the stochastic nature of the system—this model is very difficult to be solved in an optimal closed- loop solution. This drawback means that classical optimal techniques of the stochastic mathematical programming can not be applied directly to the problem [13] . Thus, in order to reduce the complexity of the stochastic problem and, as well as, to make it computationally easier to solve, suboptimal approaches provided from stochastic control theory should be considered for practical applications, see, e.g., [9] [13] - [15] . Note that the linear-Gaussian nature of the system and the quadratic criterion are also particular features of the model that allow the application of the certainty-equivalence principle [16] . From this principle, the stochastic model can be converted into a deterministic equivalent model. In such an equivalent model, all stochastic variables are set equal to their expected values (i.e., their first statistic moments). This model is usually known as Mean Value Model. The main advantage of this model is that, besides being easier to be solved, some mathematical and statistical properties of the original model are preserved, see [14] .
The paper is organized as follows: Section 2 introduces an aggregate production planning problem based on the HMMS. The cost components of the original HMMS model are appropriately arranged to guarantee the consistency with the state-space pattern of the LQG model. Additionally, an input-output ARMA model, which is used as data generation process of demand, is transformed into a state-space format and attached to the LQG formulation. As a result, an extended state-space stochastic optimization model with constraints on decision variables is formulated. In Section 3, an equivalent deterministic optimization model is developed from the application of the certainty-equivalence principle. Two very simple sub-optimal approaches are used to solve the model. At last, Section 4 introduces an illustrative example to demonstrate the applicability of the model.
2. The HMMS Model in the State-Space Format
In this section, the aggregate production planning problem, described by the classical HMMS model, is placed into space-state format in order to represent an equivalent LQG model with constraints on the decisions variables.
2.1. Basic Notation
1) Aggregate variables:
•
denotes the demand for a family of products (i.e. the level of aggregate sales during period
). It is assumed to be a stationary random variable, being approximated by a normal distribution function with mean
and finite variance
. The assumption of normality is based on the Law of Large Number [17] . Such a law can be interpreted here as follows: the sum of different patterns of probability distribution functions, which are related to different products of the same family, can be approximated by a normal distribution to represent this family. It is worth realizing that the probability distribution function of the demand usually depends on the type of the production process. For instance, considering a make-to-stock production process, where the evolution of demand is usually stationary over the periods, a normal distribution function, with mean and variance given, is statistically a good alternative to model the fluctuation of demand; see [18] for more details.
•
denotes the amount of net inventory level at the beginning of period
. This variable takes values from a dynamic balance system that depends linearly on the demand fluctuation. Based on the property of a normal stochastic process which says that the resulting linear transformation of a sequence of normal random variables is also a normal random variable (see [17] ) is possible to consider that the inventory variable follows a normal process with mean
and variance
.
•
denotes the rate of aggregate production capacity during the period
, being a decision variable to the problem. Note that if, for instance, the inventory balance system is running under a closed-loop control scheme, then the production rate depends on the net inventory level for each period
, and, as a consequence, this rate must also be understood as being a random variable. Furthermore, if this dependence is linear, then the probability distribution function of the production variable will be similar and proportional to the distribution function of the inventory variable; see this feature of the stochastic process in [7] .
•
denotes the amount of the regular workforce used in the period
. This variable is assumed here independent of endogenous and exogenous factors that influence the environment of the company. Indeed, there is a set point level for regular workforce denoted here as
. Thus, any excess in the levels of fluctuation of demand, involving an increase in the production rate
, will be dealt with a policy of the use of temporary labor or overtime. This variable is assumed to be essentially deterministic.
•
denotes workforce changes between the subsequent periods


2) Cost’s components
The total cost function of the HMMS model, denoted here as
•



•




•




•



Note that the manager must provide the constants
Based on the above notation, the classical HMMS model can be formulated mathematically as follows:

Note that the inventory balance equation given in the problem (1) is a stochastic process. Thus, the inventory variable is a random variable and, as a consequence, the model (1) represents a stochastic optimization problem. Therandomness explains the use of the mathematical expectation operator




2.2. The Constrained HMMS Model
As can be noted from problem (1), the classical formulation of HMMS model does not explicitly take into account constraints on the decision variables; see also [1] . Indeed, any significant change in the levels of the decision variables will be penalized directly in the criterion
In this section, the HMMS model is modified in order to consider constraints on the inventory, production and workforce variables explicitly in the formulation. It is a consensus that the use of physical constraints explicitly in the model makes it more realistic for practical applications; see e.g. [16] and [19] . Based on this, the original formulation of problem (1) will be reformulated to include constraints on decision variables. Thus, assuming that it is possible to set lower and upper bounds for each decision variable of the model, and also to include a workforce balance constraint, the reformulated model is described as follows: finding a non-negative optimal
policy, which includes both production rates



where






The optimal production policy

variable










It is interesting to observe that the randomness of the inventory and production variables makes them probabilistic variables, and so to ensure that their physical boundaries are no violated, they must be taken as chance- constraints. Then, probabilistic indexes of inventory and production constraints, which are given respectively by










2.3. The Constrained HMMS Model in State-Space Format
The constrained HMMS model (2) is placed into an equivalent state-space linear-quadratic Gaussian model. For such, the variables of the HMMS model are considered as state and control variables, that is,




The time-discrete stochastic state-space system that represents the linear balance of inventory and workforce is given by:

where the first and the second row of (3) describe the inventory and workforce linear balance equations, respectively. Note that




the distribution function of the random variable



The dimension of the state-space system (3) will be augmented by the introduction of a model that represents the fluctuation of demand
Once a model has been identified, it is placed into space-state format and coupled to the system (3). The transformation process is carried out as follows: Firstly, the demand variable










where





After some algebraic handling, the model (4) is converted into an equivalent state-space format that is given by:

where



where
It is worth adding that to convert the input-output model (4) in the state-space model (5), the reliability condition should be guaranteed, i.e.


Finally, handling Equations (3), (4), and (5), it is possible to obtain a general state-space system similar to (1) that represents the production process as whole, that is:

where






It is assumed that the inventory




where







The original cost components of the HMMS model, given by the criterion










where
•
•
•
•
Note that the coefficients


with


At last, with the objective of finding production and workforce optimal sequence plan, described by

The problem (9) is an extended version of the HMMS model, and it also belongs to the class of the linear, quadratic Gaussian model with constraints on state and control variables, see [13] and [16] . The main advantage is that it can be employed to model and optimize a wide variety of management problems in a unified format, see for instance [7] [9] [15] [19] [22] and [23] . The next section discusses the solution of the problem (9) by mean of two suboptimal approaches of the control theory, which are of simple implementation.
3. The Mean Value Problem
Certain characteristics, such as the stochastic nature, constraints on decision variables and high dimensionality, make impossible to provide a true optimal solution (i.e. a close-loop solution) for the problem (9). The classical approach known as stochastic dynamic programming cannot be applied because the curse of dimensionality [13] , which means that this approach requires an enormous computational effort to solve large-scale problems. Because of these difficulties, suboptimal approaches become interesting alternatives, particularly in reason of the smallest computational effort that such techniques usually offer for practical applications; see [13] [14] and [15] .
There is a wide variety of suboptimal approaches to deal with stochastic problems as described by problem (9). Many of them depend on the certainty-equivalence principle. Such principle establishes that all random variables of a stochastic problem can be replaced by their respective first statistical moments; see [14] . Base on this principle, the problem (9) can be transformed in an equivalent deterministic problem, denoted here as Mean Value Problem (MVP). This transformation process is facilitated by some features of the original problem, i.e.: 1) the linearity of the system (6); 2) the normal stochastic nature of the inventory balance equation, given in (3); and 3) the convexity of the functional criterion (8) that is explained by the quadratic nature of the cost of HMMS model, given in (1). As will be seen bellow, these features allow the immediate use of the certainty-equivalence principle.
3.1. The Transformation Process
Having been assumed previously that the demand

teristic means that the probability distribution function of inventory, given by
from (6) by mean of the determination of its respective mean and variance equations; see [20] . These two statistical moments allow transforming the stochastic problem (9) into a Mean Value Problem (MVP).
The first step for converting the stochastic problem (9) to an equivalent MVP is to determine the mean and variance of the state variables of the system (6). However, it is important to bear in mind that the inventory
variable







Note that the other state variables (i.e.,

Since the control variable







Based on these statistics, the criterion (8) and the linear system (6) can be promptly converted to a deterministic equivalent pattern [20] . Another important transformation is to convert the probabilistic constraints (7.a) and (7.b) in equivalent deterministic inequalities. Thus, from (7.a) follows that:

and,

where


Proceeding in a similar way, follows that the probabilistic constraint (7.b) becomes:

where


ity distribution function of the production variable, which depends on the production capacity reliability level, i.e., the probabilistic index
At last, it is important to observe that the state variables related to the ARMA model (i.e,
are totally unconstrained. This feature means that such variables can evolve freely along the planning horizon without any control.
After all these transformations, the Mean Value Problem can be formulated as follows:

It is worth mentioning that the problem (14) allows not only to provide an optimal aggregate production plan, but also to help the manager to get important insights about the use of the aggregate resources. Indeed, from varying some parameters of the problem (14), it is possible to analyse different scenarios related to an inventory-production process. For example, comparing optimal inventory, production and workforce trajectories, developed from different scenarios analysis, the manager can realise how the future will be like in terms of the reorder cycle for a given product. The prior knowledge of all possible reorder points allows that some actions can be in advance taken to replenish the inventory levels, and, thus, to prevent against the possibility of stock out. These actions can be understood as an attempt to meet future demand for aggregate products, and also to prevent against unexpected events, such as, for instance, delays and machines breakdowns.
3.2. Two Simple Suboptimal Approaches
Two simple suboptimal approaches, known in the literature as Open-loop No-updating and Open-Loop Updating [13] , can be combined with quadratic programming algorithms for solving (14), and so generating a sequential optimal plan. These approaches are briefly described below.
• The Open-Loop No-updating (OLN) approach applied to (14) provides an optimal production policy




• The Open-Loop Updating (OLU) approach is very similar to the OLN, except that optimal policies are always recomputed as soon as new information about the state of the system becomes available [15] . In fact, for each new period





Both OLN and OLU approaches can be used to develop production scenarios. These scenarios are useful for managers getting insights on the use of the resources of the company. Also note that such scenarios are generated from the variation of some particular parameters of the problem (14), see Section 2.2, for more details.
In the next section, the OLU approach is used to generate a suboptimal production plan to the problem (14). The reasons for the choice of the OLU approach are the easiness of the computational implementation, and the possibility of updating information on the state of the system, during the optimization process. Therefore, the OLU approach can provide a production plan that is more accurate than those that no updating any information about the state of the system.
4. An Example
In this example is considered a company that manufactures different types of products. These kind of products are made-to-stock, having their demand independent and stationary. Production oriented to stock means that each product can have an individualized annual plan. Based on this, the company’s manager intends to develop an optimal aggregate production plan for each one product, through the use of the OLU approach in the solution of the problem (15). For what follows, it is considered the case of only one of these products.
4.1. Problem’s Data
Table 1 summarizes some of the data associated with the parameters and variables of the problem.
Additional information: 1) the standard deviation of the demand is given by






Table 1. Main data.
4.2. The Mean Value Problem
Based on the Mean Value Problem (14), the production-planning problem for this example is formulated bellow:

Considering results given at Section 2.3.4; all components and parameters of the problem (15) can be calculated using the data provided previously.
4.3. Solving the Problem (15)
Now, the objective is to find a solution to the problem (15). As discussed in Section 3.2, there are many suboptimal approaches available in the literature. In this paper, the OLU approach is used to solve the problem under study. Besides the computational simplicity, another advantage of this approach is that it allows to incorporate new measures on the inventory and workforce levels over the planning horizon. This last feature is usually known as a rolling horizon scheme, see [13] and [19] , and it is used to update the optimal solution (i.e. the production plan), during the optimization process. Figure 1 illustrates how the OLU approach works to solve the problem (15). Note that for each new period






The Figures 2-5 illustrate respectively the optimal trajectories of the inventory, production, workforce and labor-change variables, which are obtained as a result of the use of the OLU approach in the problem (15). Note that they represent the annual production plan, which is desired by the company’s manager. Note also that these optimal trajectories exhibit a particular scenario of the production process, which can be useful for management decision-making.
With respect to trajectories exhibited above, some comments are:
• The trajectory of inventory levels decreased continuously throughout the periods of time, see Figure 2. Note that this characteristic occurs in reason of the use of available information on the production system, during the optimization process. It means that OLU approach allows that the optimization process can be updating with respect to the states of the system, see Figure 1. Note that if for each period




Figure 1. Block diagram of the OLU approach.
Figure 2. Inventory levels (Ik) with a = 0.95.
Figure 3. Production rate


out, see [20] . As a result, it will always be possible to satisfy customers with deliveries on time and still prevent against unexpected events such as broken machines and delays of raw material.
• As illustrated in Figure 3, the optimal production trajectory (solid line) remains relatively stable over the periods, with production levels close to the maximum capacity (i.e.,
Figure 4. Workforce levels (Wk) versus regular workforce (RWF).
Figure 5. Workforce changes
• As a consequence, of the stable behaviour of the production policy, the workforce policy also remains stable for most periods of the planning horizon (see Figure 4). In fact, note that the workforce level fluctuates slightly around the regular workforce level (i.e.


The results illustrated by Figures 2-5 show one of the possible production scenarios that can be adopted as a target for the short-term planning of the company. It is important to emphasize that the choice of a production scenario that is unique for strategic purposes of the company is not a trivial task. In fact, the main difficulty is related to the need of satisfying tradeoffs such as, for instance: how to minimize inventory levels and, simultaneously, maximize production rates, without introducing temporary workforce or overtime. Another difficulty is due to the lower and upper bounds of inventory and production variables. These constraints reduce the space of feasible solutions to the problem (15) and, consequently, the number of possible scenarios for analysis.
4.4. Scenarios Analysis
In this section is analyzed the influence of the probabilistic index






In short, using



Figure 6 and Figure 7 shows the inventory and production trajectories for both










Finally, it is interesting to mention that the development of production scenarios, based on safety stock levels to satisfy customer demand, has strong interest for those companies that operate in markets of commodities, i.e., companies whose products are made to stocks.
Figure 6. Inventory levels, from OLU solution with a = 50% (dashed line) and 95% (solid line).
Figure 7. Production rates, from OLU solution with a = 50% (dashed line) and 95% (solid line).
5. Conclusion
This paper introduced a sequential stochastic linear, quadratic production planning problem with constraints on decision variables. Such a problem can be used by users interested in developing aggregate production plan for a single family of products. The problem was formulated in a state-space format, taking into account the original structure of the classical HMMS model and an input/output ARMA model that simulates the fluctuations of demand. In the reason of difficulties to obtain an exact optimal solution (i.e. closed-loop solution), suboptimal approaches were pointed out as alternative strategies. It was also emphasized that many suboptimal plans are a direct consequence of the application of the certainty-equivalence principle. From this principle, the original stochastic problem was transformed into an equivalent deterministic problem, denoted here as the Mean Value Problem (MVP). From optimal control theory, two very simple sequential procedures, known by acronyms OLN and OLU, were discussed as a way to solve MVP and so to provide a sequential production plan (i.e. an updating plan). From an illustrative example, the OLU approach was applied to MVP. As a result, a feasible production plan that takes into account information about the production system was provided. At last, it was shown that it is possible to develop production planning scenarios, only by varying some appropriated parameters of MVP. These scenarios help managers to define the best plan to be used as a production target in the hierarchy of decision-making.
Acknowledgements
This work has been supported by Brazilian National Council for Research and Development (CNPq), under grants Nos. 310606/2010-1 and 310343/2013-5.
References
- Holt, C.C., Modigliani, F., Muth, J.F. and Simon, H.A. (1960) Planning Production, Inventory and Work Force. Prentice-Hall, Upper Saddle River.
- Yildirim, I., Tan, B. and Karaesmen, F. (2005) A Multiperiod Stochastic Production Planning and Sourcing Problem with Service Level Constraints. OR Spectrum, 27, 471-489. http://dx.doi.org/10.1007/s00291-005-0203-0
- Hackman, S., Riano, G., Serfozo, R., Huing, S., Lendermann, P. and Chan, L.P. (2002) A Stochastic Production Planning Model. Technical Report, The Logistic Institute, Georgia Tech and National University of Singapore, Singapore.
- Silva Filho, O.S. (2012) Optimal Production Plan for a Stochastic System with Remanufacturing of Defective and Used Products. In: Mejía, G. and Velasco, N., Eds., Production Systems and Supply Chain Management in Emerging Countries: Best Practices, Springer, Vol. 1, 167-182. http://dx.doi.org/10.1007/978-3-642-26004-9_9
- Higgins, P., Le Roy, P. and Tierney, L. (1996) Manufacturing Planning and Control: Beyond MRP II. Chapman & Hall, London.
- Sahinidis, N.V. (2004) Optimization under Uncertainty: State-of-the-Art and Opportunities. Computer and Chemical Engineering, 28, 971-983. http://dx.doi.org/10.1016/j.compchemeng.2003.09.017
- Mula, J., Poler, R., Garcia-Sabater, J.P. and Lario, F.C. (2006) Models for Production Planning under Uncertainty: A Review. International Journal of Production Economics, 103, 271-285. http://dx.doi.org/10.1016/j.ijpe.2005.09.001
- Cheng, L., Subrahmanian, E., and Westerberg, A.W. (2004) A Comparison of Optimal Control and Stochastic Programming from a Formulation and Computational Perspective. Computers and Chemical Engineering, 29, 149-164. http://dx.doi.org/10.1016/j.compchemeng.2004.07.030
- Silva Filho, O.S. and Cezarino, W. (2004) An Optimal Production Policy Applied to a Flow-shop Manufacturing System. Brazilian Journal of Operations and Production Management, 1, 73-92.
- Silva Filho, O.S. (2012) An Open-Loop Approach for a Stochastic Production Planning Problem with Remanufacturing Process. In: Andrade Cetto, J., Ferrier, J.-L., Pereira, J.M.C.D. and Filipe, J., Eds., Informatics in Control, Automation and Robotics, Springer, 174, 211-225. http://dx.doi.org/10.1007/978-3-642-31353-0_15
- Singhal, J. and Singhal, K. (2007) Holt, Modigliani, Muth, and Simon’s Work and Its Role in the Renaissance and Evolution of Operations Management. Journal of Operations Management, 25, 300-309. http://dx.doi.org/10.1016/j.jom.2006.06.003
- Box, G.E.P., Jenkins, G.M. and Reinsel, G.C. (2008) Time Series Analysis: Forecasting and Control. 4th Edition, Wiley, Hoboken. http://dx.doi.org/10.1002/9781118619193
- Bertesekas, D.P. (2007) Dynamic Programming and Stochastic Control. Volume 1. Athena Scientific, Belmont, USA.
- Lassere, J.B., Bes, C. and Roubelat, F. (1985) The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution. Operations Research, 3, 684-689. http://dx.doi.org/10.1287/opre.33.3.684
- Pekelman, D. and Rausser, G.C. (1978) Adaptive Control: Survey of Methods and Applications. In: Applied Optimal Control, TIMS Studies in the Management Science, Vol. 9, North-Holland, 89-120.
- Bryson, A.E. and Ho, Y. (1975) Applied Optimal Control: Optimization, Estimation and Control. Hemisphere Publishing Corporation, Washington DC.
- Papoulis, A. and Pillai, S.U. (2002) Probability, Random Variables, and Stochastic Process. 4th Edition, McGraw-Hill.
- Graves, S.C. (1999) A Single-Item Inventory Model for a Nonstationary Demand Process. Manufacturing & Service Operations Management, 1, 50-61. http://dx.doi.org/10.1287/msom.1.1.50
- Kleindorfer, P.R. (1978) Stochastic Control Models in Management Science: Theory and Computation. Applied Optimal Studies in the Management Science, North-Holland, 9, 69-88.
- Silva Fo, O.S. and Ventura, S.D. (1999) Optimal Feedback Control Scheme Helping Managers to Adjust Industrial Resources of the Firm. Control Engineering Practice, 7, 555-563. http://dx.doi.org/10.1016/S0967-0661(98)00195-6
- Isermann, R. (1981) Digital Control System. Springer-Verlag, Heidelberg.
- Shen, R.F.C. (1994) Aggregate Production Planning by Stochastic Control. European Journal of Operational Research, North-Holland, 73, 346-359. http://dx.doi.org/10.1016/0377-2217(94)90270-4
- Gershwin, S., Hildebrant, R., Suri, R. and Mitter, S.K. (1986) A Control Perspective on Recent Trends in Manufacturing Systems. IEEE Control Systems Magazine, 6, 3-15. http://dx.doi.org/10.1109/MCS.1986.1105071

















