A novel approach for product makespan prediction in production life cycle

A novel self-adaptive immune genetic algorithm (SAIGA)–dynamic back propagation neural network (DBPNN) model was developed to solve the difficulty of making maximum completion time prediction (makespan prediction). By analyzing history data of makespan and its related factors in production life cycle, a prediction model based on back propagation (BP) neural network was established, weight values and threshold values of the BP neural network model were improved dynamically, and the DBPNN model was further optimized via SAIGA, thus obtaining the SAIGA-DBPNN model. The proposed SAIGA-DBPNN model was applied to an aviation enterprise’s makespan prediction. The application case suggested that the novel prediction method can yield accurate results. The usefulness of accurate makespan prediction in production life cycle as a tool for improving production efficiency was highlighted.

[1]  Kuo-Ching Ying,et al.  Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times , 2011, Expert Syst. Appl..

[2]  Purushothaman Damodaran,et al.  A GRASP approach for makespan minimization on parallel batch processing machines , 2011, J. Intell. Manuf..

[3]  Pedro Gómez-Gasquet,et al.  An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan , 2012, Expert Syst. Appl..

[4]  Fardin Ahmadizar,et al.  A new ant colony algorithm for makespan minimization in permutation flow shops , 2012, Comput. Ind. Eng..

[5]  Hexu Sun,et al.  The Design of Manufacturing Execution System Based on RFID , 2008, 2008 Workshop on Power Electronics and Intelligent Transportation System.

[6]  Maurizio Faccio,et al.  Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production , 2012 .

[7]  Thilo Sauter,et al.  Functional Analysis of Manufacturing Execution System Distribution , 2011, IEEE Transactions on Industrial Informatics.

[8]  S. Muthu,et al.  A Heuristic Scheduling Algorithm for Minimizing Makespan and Idle Time in a Nagare Cell , 2012 .

[9]  Wei-Chang Yeh,et al.  Uniform parallel-machine scheduling to minimize makespan with position-based learning curves , 2012, Comput. Ind. Eng..

[10]  Stavros G. Kolliopoulos,et al.  The 2-valued case of makespan minimization with assignment constraints , 2013, Inf. Process. Lett..

[11]  Jean-Paul Bourrières,et al.  Fast assessment of production makespan using aggregate technical data , 2012, Comput. Ind..

[12]  Xingsheng Gu,et al.  A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion , 2012, Comput. Oper. Res..

[13]  Ernesto Martínez,et al.  Agent-based modeling and simulation of an autonomic manufacturing execution system , 2012, Comput. Ind..

[14]  Purushothaman Damodaran,et al.  A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times , 2012, Expert Syst. Appl..

[15]  Young Hoon Lee,et al.  MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server , 2012, Comput. Oper. Res..

[16]  Deming Lei,et al.  Scheduling stochastic job shop subject to random breakdown to minimize makespan , 2011 .

[17]  Xiaoping Li,et al.  An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan , 2012, IEEE Transactions on Automation Science and Engineering.

[18]  Stephan Eberle Adaptive Internet Integration of Field Bus Systems , 2007, IEEE Transactions on Industrial Informatics.

[19]  Shih-Wei Lin,et al.  Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm , 2013 .

[20]  Rolf Blumenthal Manufacturing Execution Systems to optimize the pharmaceutical supply chain , 2004 .

[21]  Rui Xu,et al.  Makespan minimization on single batch-processing machine via ant colony optimization , 2012, Comput. Oper. Res..

[22]  Mostafa Zandieh,et al.  A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem , 2012 .

[23]  Tanka Nath Dhamala,et al.  New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan , 2012, Ann. Oper. Res..

[24]  R. Logendran,et al.  Makespan minimization of a flowshop sequence-dependent group scheduling problem , 2011 .

[25]  Jairo Maya,et al.  Minimizing makespan in a two-machine no-wait flow shop with batch processing machines , 2012 .

[26]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

[27]  Ji-Bo Wang,et al.  Minimizing makespan in three-machine flow shops with deteriorating jobs , 2013, Comput. Oper. Res..

[28]  Iiro Harjunkoski,et al.  Integration of scheduling and control - Theory or practice? , 2009, Comput. Chem. Eng..