Research Article  Open Access
A Novel Output Prediction Method in Production Management Based on Parameter Evaluation Using DHNN
Abstract
Output prediction is one of the difficult issues in production management. To overcome this difficulty, a dynamicimproved multiple linear regression model based on parameter evaluation using discrete Hopfield neural networks (DHNN) is presented. First, a traditional multiple linear regression model is established; this model takes the factors in production lifecycle (not only one phase of the production) into account, such as manufacturing resources, manufacturing process, and product rejection rate, so it makes the output prediction be more accurate. Then a staticimproved model is built using the backstepping method. Finally, we obtain the dynamicimproved model based on parameter evaluation using DHNN. These three models are applied to an aviation manufacturing enterprise based on the actual data, and the results of the output prediction show that the models have practical value.
1. Introduction
Production management is the general term for the management of the production system. Production management mainly contains two aspects, the job of production planning and production control [1]. The job of production planning contains production planning design, technical preparation planning, and production scheduling. The job of production control contains production progress control, production inventory control, production quality control, and production cost control. Figure 1 gives the function structure of production management.
Output prediction is one of the key technologies in production planning and production control. If the output prediction is inaccurate, the difficulty of production planning design, the production cost control, and inventory control will appear. And then the production efficiency will become low and the waste of human and material resources will become high.
Many contributions to production management and output prediction have been made in the last two decades from various perspectives. Those studies can be classified into three groups: ERP (enterprise resources planning), MES (manufacturing execution system), and output prediction. Hung et al. [2] provided a broader, richer model of knowledge transfer networks to promote insight into successful ERP implementation. In practice, the key to effective knowledge transfer is the establishment of a positive knowledge transfer climate. To achieve a successful ERR implementation, practitioners should focus on developing a positive relationship with ERR implementation partners. The purpose of this paper was to examine the impact of the knowledge transfer climate and relationship bonding. Ho and Ireland [3] examined the effect of forecasting errors in the context of an ERPcontrolled manufacturing system. Then considered a mitigating remedy, the use of a lotsizing rule, to cope with the consequences of forecasting inaccuracy without resorting to costly inventoryoriented buffers. An ERPcontrolled manufacturing system was simulated to see how these lotsizing rules mitigate the forecast errors and subsequently generate acceptable system performance. Koh et al. [4] proposed a knowledge management approach to tackle uncertainty in ERPcontrolled manufacturing environment. The development of a knowledgebased ERP planning model and a knowledgebased ERPcontrolled manufacturing simulation model within which knowledge of tackling underlying causes of uncertainty can be stored for future reference is discussed. A combination of explicit and tacit knowledge was created and applied to update the planned parameters and to decide for the appropriate buffering or dampening techniques to tackle the underlying causes of uncertainty. Matsveichuk et al. [5] addressed the issue of how to best execute the schedule in a twophase scheduling decision framework by considering a twomachine flowshop scheduling problem in which each uncertain processing time of a job on a machine may take any value between a lower and upper bound. The scheduling objective was to minimize the makespan. The approach of this paper enabled a scheduler to best execute a schedule and may end up with executing the schedule optimally in many instances according to our extensive computational experiments. The algorithm for testing the set of sufficient conditions of schedule domination is not only theoretically appealing but also empirically fast. They also addressed the flowshop minimumlength scheduling problem with jobs processed on two machines. The authors investigated properties of this partial job order and showed how to construct this order in polynomial time. The approach based on a set of dominant schedules allowed the authors to find special cases of the problem when it was possible to find an optimal schedule in spite of the uncertainty of the numerical data [6]. Matsveichuk et al. [7] addressed the flowshop minimumlength scheduling problem with jobs processed on two machines where processing times are uncertain. The authors obtained necessary and sufficient conditions for the case when it is possible to fix the order of two jobs in a minimal set of dominant schedules. The necessary and sufficient conditions were proven for the case when one schedule dominates all the others. They characterized also the case where there does not exist nontrivial schedule domination. Zhong et al. [8] presented an RFIDenabled realtime manufacturing execution system (RTMES). RFID devices were deployed systematically on the shop floor to track and trace manufacturing objects and collect realtime production data. The efficiency and effectiveness of the proposed RTMES were evaluated with reallife industrial data for shopfloor production management in terms of workers, machines, and materials. Huin et al. [9] presented the various strategic and operational requirements of regional MSMES and proposed a knowledgebased resources planning model. This improved AI model made use of the large amount of accumulated knowledge typically found in the MSMES, especially those in the electronics and precision engineering sectors. Amirteimoori and Kordrostami [10] introduced a data envelopment analysis approach to making future production plans in a centralized decisionmaking environment when demand changes can be forecasted in the next production season. The approach proposed took the size of operational units into account so that the planned production for each unit becomes proportionate to the ability of the units, and a DEAbased production planning approach was developed to determine the most favorable production plans. Golany [11] presented an interactive linear programming procedure to set up goals for desired outputs. Their procedure is based on the empirical production functions generated by DEA and then adjusted by new information provided by the decision maker in each iteration. Du et al. [12] proposed two planning ideas. One is optimizing the average or overall production performance of the entire organization, measured by the CCR (Cooper and Rhodes) efficiency of the average input and output levels of all units. The other is simultaneously maximizing total outputs produced and minimizing total inputs consumed by all units. Korhonen and Syrjänen [13] developed an interactive approach based on DEA and multipleobjective linear programming technique to a resourceallocation problem that typically appears in a centralized decisionmaking environment. By simultaneously maximizing the total amount of output variables produced by each individual unit, an efficient resourceallocation solution as well as all the out put amounts can be obtained. Kim et al. [14] presented a new integrated model for production planning and scheduling for multiitem and multilevel production. Then he in addition presented a mathematical formulation, proposed a heuristic solution procedure, and demonstrated the performance of the model by comparing the experimental results with those of a traditional approach and optimal solution. Lasserre [15] and DauzèrePéres and Lasserre [16] addressed the integrated lotsizing and scheduling problem and proposed a twolevel, iterative procedure to compute the best possible schedule in a jobshop environment. Anwar and Nagi [17] proposed a twophase heuristic for a general job shop that produces complex assemblies. In the first phase, the proposed heuristic schedules operate by exploiting the critical path to minimize the makespan on a lotforlot basis. In the second phase, the heuristic iterative groups order to determine lot sizes that further reduce the makespan, setup, and holding cost. Xiong and Nyberg [18] discussed production plan and scheduling system of refinery CIMS, where production procedure process, basic production characters, refinery production and administration, and its activity types are introduced; then a refinery integrated production plan and schedule system is put forward. Zhang and Yan [19] addressed an integrated jobshop production planning and scheduling problem with setup time and batches. An improved hybrid genetic algorithm (HGA) is given in order to simultaneously optimize the production plan and the schedule. At last a comparison is made between the hybrid algorithm and a hierarchical production planning and scheduling method. Fandel and StammenHegene [20] developed a model for multiproduct and multilevel production; they could solve only smallsized problems with a small number of products and macroperiods because of their model’s complexity. Chazal et al. [21] studied the production planning and inventory management problem based on the assumption that the firm under consideration performs in continuous time on a finite period in order to dynamically maximize its instantaneous profit. Pochet and Wolsey [22] operated the linear programmingbased production planning tools typically at a higher, aggregate production level. In order to address production planning problems at a deeper detail, integer and, often, binary variables need to be introduced into the mathematical model and this led to more complex models such as the ones described. Damodaran and VélezGallego [23] presented a simulated annealing algorithm to minimize the makespan on a group of identical batch processing machines arranged in parallel, the case where each job had an arbitrary processing time, nonidentical size, and nonzero ready time which was considered.
Although great progress has been made in the studies on production management, most of the studies focused on shop scheduling problems, so little research developed output prediction approaches. These approaches also have limitations due to their range of data extraction as these approaches obtained parameter only at a certain phase but not in the lifecycle of production. Furthermore, little research used dynamicimproved multiple linear regression model to predict the output.
In order to overcome these shortcomings above, this paper focused on a dynamicimproved multiple linear regression model based on DHNN to predict the output. The parameters of this mathematical model will contain the factors in production management lifecycle. So the output prediction will be more accurate and reasonable.
The rest of this paper is organized as follows. The following section discusses the DHNN evaluation method. Section 3 explains the mathematical models to predict output. Section 4 constructs three practical mathematical models, and Section 5 evaluates the models and analyzes the error to test the hypotheses in an aviation manufacturing enterprise. Finally, Section 6 presents conclusions.
2. DHNN Evaluation Method
DHNN is a onelayer neural network, and its input variables and output variables are Boolean type. Figure 2 illustrates the structure of DHNN. The input of the network is , and the output is . The relationship of the input and output is as follows [24]:
In (1), is a symmetric step function, and its output is or . is the connection weight matrix of network and represents the connection weight of the neurons from to .
DHNN is mainly used to associative memory and the output can be obtained through feedback evolution of the network when the input is . is a stable memory from the evolution of .
The process of DHNN evaluation can be divided into memory process and association process. In order to realize the DHNN evaluation, we can use the steps as follows.
Step 1. Based on the samples which required memory, calculate the weight by (2) as follows: where and is the initial input of the network.
Step 2. Let the test sample be the initial value of the network output, and let be an arbitrary input vector; then
Step 3. Calculate the following iterative formula:
Step 4. Repeat iterations, until each unit becomes unchanged Thus, will be back to a memory sample.
The allocation of evaluation weight can be obtained through the method of neuron reasonable grouping; neurons in one group have the same evaluation, and, if the evaluation has a large weight, the number of neurons in this group will be large; then the impact of evaluation result for the network will be big.
Let the number of evaluation be , the weight of these evaluation , and ; then and . Let the group of be and the number of neuron as follows:
In (6), is a rounding function and the sum of must be 100. Hence, the effect of weight will be included into the evaluation result. The sum of neurons in each level is as follows:
The memory capacity of DHNN is (0.13~0.15) . If the sample of memory mode is smaller than 13, the DHNN designed by the method above will be reasonable.
3. Mathematical Models for Production Prediction
To predict the output of the production plan accurately is the precondition of production management. We can use a variety of mathematical models to predict the output, such as traditional multiple linear regression model, static improved multiple linear regression model, and dynamic improved multiple linear regression model.
The traditional multiple regression model which includes sets of observation values can be given as follows: Written in matrix form, where
is the regression coefficient. We can use the least squares method to estimate the value. The formula can be given as follows: where , and .
We can obtain two kinds of improved multiple linear regression model, the staticimproved model and the dynamicimproved one.
In order to get the staticimproved model, first, we should get the OLSE (ordinary least square estimation). is the estimate value of , and its squared deviations is as follows: We should get the minimum of 1 squared deviation as follows: should satisfy the following equation group: If exists, then the OLSE is
So we can get 4 parameters which can reflect the effect of the regression. These 4 parameters are , , , , and . The formulas can be given as follows: where , .
can be used to test the significance of the regression coefficients. We use the backstepping method of to remove the low significance variables, because if, is small, the effect to from is not obvious. All the variables will be tested by in proper order until the variables left can meet the requirements of the significant level . And then the staticimproved multiple linear regression model is obtained.
On the other hand, in order to obtain the dynamicimproved model, the low weight independent variables can be removed by the weight analysis method based on DHNN evaluation, and then the dynamicimproved multiple linear regression model will be established.
4. Application and Analysis of the Mathematical Models
The impact factors of output prediction include several aspects, for example, production conditions, labor input, and some factors in production process. In production conditions aspect, sum of equipment is an important parameter; in labor input aspect, labor hours are an important parameter. The factors in production process also play an important role, for example, rejection rate. So the 7 parameters are total number of equipment , number of running equipment , number of added equipment , labor hours last season , rejection rate , average number of processes , and output last season .
4.1. Traditional Model
We obtain the 7 parameters of an aviation manufacturing enterprise from 1996 to 2012 as shown in Table 1.

The top 11 lines of data (1996–2007) in Table 1 are used to determine the parameters of the model. The remaining 5 lines of data (2008–2012) are used to verify the accuracy and practicality of the mathematical models.
We establish the traditional multiple linear regression equation as follows: By applying the proposed equation (20), average regression coefficients can be calculated using the top 11 lines of data in Table 1. Then we obtain the rolling approach model (Model ) based on the data in 1997–2007, 1998–2008, 1999–2009, 2000–2010, and 2001–2011 as follows:
4.2. StaticImproved Model
We can obtain the staticimproved model by significance test of the regression coefficients. The measurement of parameters selection is ; if , the parameter will be removed. Table 2 gives the process of the selection. For example, in the first round, the value 0.0995 is calculated by (19), and the significant weight ; then by (17), we can obtain , so number of added equipment is removed. After 4 rounds of selection, the removed parameters are number of added equipment, rejection rate, and average number of parts processes.

So we can determine the important factors affecting output prediction in this aeronautical enterprise as follows:(i)total number of equipment;(ii)number of running equipment;(iii)labor hours last season;(iv)output last season.
The staticimproved multiple linear regression model (Model ) which is obtained by backstepping method can be expressed as
4.3. DynamicImproved Model
We can obtain the dynamicimproved model by the method of DHNN evaluation. In the DHNN evaluation we use total number of equipment , number of running equipment , number of added equipment , labor hours last season , rejection rate , average number of processes , and output last season as the evaluation parameters. Table 3 illustrates the relative importance ratio of these parameters.

We can get the judgment matrix based on the data in Table 3: The weight of every evaluation parameter can be calculated by the feature vector of , as shown in Table 4.

It can be found in Table 4 that , , and are the three lowest weight parameters, so they should be removed. Then we will obtain the dynamicimproved model based on the data in 1997–2007, 1998–2008, 1999–2009, 2000–2010, and 2001–2011 as follows. Equation (24) is also called Model :
Now, the traditional model (Model ), the staticimproved model (Model ), and the dynamicimproved model (Model ) have been obtained. Then our task is to determine which one is the best model.
5. Evaluation of The Models and Error Analysis
First, the DHNN evaluation method is adopted to estimate these three models. About 800 neurons are needed in the process of the estimation. 1 is lowest score, and 8 is the highest score. Table 5 shows these three models’ scores of every estimation parameter; the scores are derived from the application evaluation of the models by the experts.

The neural network should be trained; then it will have 8 memory modes, and these are the 8 levels of the evaluation result. When the output of the network is stable, the status of the neurons in every level is shown in Table 6. After the training, we will obtain the evaluation result of these three models as given in Table 7.


The dynamicimproved model (Model ) has the highest level as shown in Table 7. So the output prediction which is gained from Model should be the best.
Second, the Akaike information criterion (AIC) is adopted to measure which model is the best one. In the general case, the AIC is as follows: where is the number of parameters in the model and is the maximized value of the likelihood function for the estimated model.
Let be one value on the sample . Then the probability is as follows: If exists, then where is the maximized value of the likelihood function.
We apply (25), (26), and (27) to calculate the AIC value of every model as shown in Table 8.

From Table 8, we can find that Model has the minimum AIC value. So Model (the dynamicimproved model) is the best one. This result is the same with the DHNN evaluation method.
To validate the analysis results of DHNN and AIC evaluation, we use these three models separately to gain the output prediction. The comparison of output predictions of these three models and actual output is illustrated in Table 9. We use mean absolute percentage error (MAPE) as follows to measure the errors of the models: where is the actual value, is the prediction value, and is the number of error.

The line chart of the comparison is also given in Figure 3.
Figure 4 shows the error comparison of Model , Model , and Model from 2008 to 2012. Figure 4 shows the MAPE of every model in these five years.
It can be found in Table 8, Figures 3, 4, and 5 that if we use Model A to predict the output from 2008 to 2012, the maximum error is −6.67% in 2011, the minimum error is 1.68% in 2009, and the MAPE is 3.48%.
If we use Model to predict the output, the maximum error is −4.67% in 2011, the minimum error is 0.84% in 2009, and the MAPE is 2.74%. So Model is better than Model A.
Finally, if we use the dynamicimproved model (Model ) to calculate the output, the maximum error is −4.00%, the minimum error is 0.84%, and the MAPE is 1.71%. So, among these three models, Model is the best one. This comparison result is the same with the DHNN evaluation and AIC value on the three models. Therefore, Model which is obtained by DHNN evaluation and AIC value has the practical value in output prediction.
6. Conclusions
The output prediction is an essential part of manufacturing production management system. In this paper, a dynamicimproved multiple linear regression model based on parameter evaluation using DHNN was presented. Then based on the production data of an aviation enterprise from 1996 to 2012, the traditional model, staticimproved model, and dynamicimproved model based on DHNN evaluation and AIC value were established. The results of output prediction from 2008 to 2012 were obtained using these three models; compared with the actual output, we got the discrepancies of the models, and the model based on DHNN evaluation and AIC value had the minimum discrepancy. So, the model based on DHNN evaluation and AIC value has a good practical value in output prediction of production management.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This work was supported by the Fundamental Research Funds for the Central Universities under Grant no. K5051204001 and Shaanxi Provincial Scientific and Technological Research Projects under Grant no. DF0102130401. The authors would like to appreciate the editor, associate editor, and the reviewers for their valuable comments and suggestions.
References
 H. T. Wagner, S. C. Morton, A. R. J. Dainty, and N. D. Burns, “Path dependent constraints on innovation programmes in production and operations management,” International Journal of Production Research, vol. 49, no. 11, pp. 3069–3085, 2011. View at: Publisher Site  Google Scholar
 W.H. Hung, C.F. Ho, J.J. Jou, and K.H. Kung, “Relationship bonding for a better knowledge transfer climate: an ERP implementation research,” Decision Support Systems, vol. 52, no. 2, pp. 406–414, 2012. View at: Publisher Site  Google Scholar
 C. J. Ho and T. C. Ireland, “Mitigating forecast errors by lotsizing rules in ERPcontrolled manufacturing systems,” International Journal of Production Research, vol. 50, no. 11, pp. 3080–3094, 2012. View at: Publisher Site  Google Scholar
 S. C. L. Koh, A. Gunasekaran, and S. M. Saad, “Tackling uncertainty in ERPcontrolled manufacturing environment: a knowledge management approach,” International Journal of Advanced Manufacturing Technology, vol. 31, no. 78, pp. 833–840, 2007. View at: Publisher Site  Google Scholar
 N. M. Matsveichuk, Yu. N. Sotskov, N. G. Egorova, and T.C. Lai, “Schedule execution for twomachine flowshop with interval processing times,” Mathematical and Computer Modelling, vol. 49, no. 56, pp. 991–1011, 2009. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 C. T. Ng, N. M. Matsveichuk, Y. N. Sotskov, and T. C. E. Cheng, “Twomachine flowshop minimumlength scheduling with interval processing times,” AsiaPacific Journal of Operational Research, vol. 26, no. 6, pp. 715–734, 2009. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 N. M. Matsveichuk, Y. N. Sotskov, and F. Werner, “The dominance digraph as a solution to the twomachine flowshop problem with interval processing times,” Optimization, vol. 60, no. 12, pp. 1493–1517, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 R. Y. Zhong, Q. Y. Dai, T. Qu, G. J. Hu, and G. Q. Huang, “RFIDenabled realtime manufacturing execution system for masscustomization production,” Robotics and ComputerIntegrated Manufacturing, vol. 29, no. 2, pp. 283–292, 2013. View at: Publisher Site  Google Scholar
 S. F. Huin, L. H. S. Luong, and K. Abhary, “Knowledgebased tool for planning of enterprise resources in ASEAN SMEs,” Robotics and ComputerIntegrated Manufacturing, vol. 19, no. 5, pp. 409–414, 2003. View at: Publisher Site  Google Scholar
 A. Amirteimoori and S. Kordrostami, “Production planning: a DEAbased approach,” International Journal of Advanced Manufacturing Technology, vol. 56, no. 1–4, pp. 369–376, 2011. View at: Publisher Site  Google Scholar
 B. Golany, “An interactive MOLP procedure for the extension of DEA to effectiveness analysis,” Journal of the Operational Research Society, vol. 39, no. 8, pp. 725–734, 1988. View at: Google Scholar  Zentralblatt MATH
 J. Du, L. Liang, Y. Chen, and G.B. Bi, “DEAbased production planning,” Omega, vol. 38, no. 12, pp. 105–112, 2010. View at: Publisher Site  Google Scholar
 P. Korhonen and M. Syrjänen, “Resource allocation based on efficiency analysis,” Management Science, vol. 50, no. 8, pp. 1134–1144, 2004. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 H. Kim, H.I. Jeong, and J. Park, “Integrated model for production planning and scheduling in a supply chain using benchmarked genetic algorithm,” International Journal of Advanced Manufacturing Technology, vol. 39, no. 1112, pp. 1207–1226, 2008. View at: Publisher Site  Google Scholar
 J. B. Lasserre, “An integrated model for jobshop planning and scheduling,” Management Science, vol. 38, no. 8, pp. 1201–1211, 1992. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. DauzèrePéres and J.B. Lasserre, “Integration of lotsizing and scheduling decisions in a jobshop,” European Journal of Operational Research, vol. 75, no. 2, pp. 413–426, 1994. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 M. F. Anwar and R. Nagi, “Integrated lotsizing and scheduling for justintime production of complex assemblies with finite setups,” International Journal of Production Research, vol. 35, no. 5, pp. 1447–1470, 1997. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 G. Xiong and T. R. Nyberg, “Push/pull production plan and schedule used in modern refinery CIMS,” Robotics and ComputerIntegrated Manufacturing, vol. 16, no. 6, pp. 397–410, 2000. View at: Publisher Site  Google Scholar
 X.D. Zhang and H.S. Yan, “Integrated optimization of production planning and scheduling for a kind of jobshop,” International Journal of Advanced Manufacturing Technology, vol. 26, no. 78, pp. 876–886, 2005. View at: Publisher Site  Google Scholar
 G. Fandel and C. StammenHegene, “Simultaneous lot sizing and scheduling for multiproduct multilevel production,” International Journal of Production Economics, vol. 104, no. 2, pp. 308–316, 2006. View at: Publisher Site  Google Scholar
 M. Chazal, E. Jouini, and R. Tahraoui, “Production planning and inventories optimization: a backward approach in the convex storage cost case,” Journal of Mathematical Economics, vol. 44, no. 910, pp. 997–1023, 2008. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 Y. Pochet and L. A. Wolsey, Production Planning by Mixed Integer Programming, Springer Series in Operations Research and Financial Engineering, Springer, New York, NY, USA, 2006. View at: MathSciNet
 P. Damodaran and M. C. VélezGallego, “A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times,” Expert Systems with Applications, vol. 39, no. 1, pp. 1451–1458, 2012. View at: Publisher Site  Google Scholar
 E. Kaslik and S. Balint, “Complex and chaotic dynamics in a discretetimedelayed Hopfield neural network with ring architecture,” Neural Networks, vol. 22, no. 10, pp. 1411–1418, 2009. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Jiantao Chang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.