A hybrid artificial neural network: computer simulation approach for scheduling a flow shop with multiple processors

Depending on the characteristics of the manufacturing system and production objectives, dispatching rules have different efficiencies. In this regard, a multiattribute combinatorial dispatching (MACD) decision problem for scheduling a flow shop with multiple processors environment is presented in this paper. We propose a hybrid artificial neural network (ANN) simulation approach as a valid and superior alternative for solving the MACD decision problem. ANNs are one of the commonly used meta-heuristics and are a proven tool for solving complex optimisation problems. The hybrid approach is capable of modelling a non-linear and stochastic problem. Feed forward, multilayered neural network meta-models were trained through the back propagation learning algorithm to provide a complex MACD problem. The solution quality is illustrated by a case study from a multilayer ceramic capacitor manufacturing plant. The manufacturing lead times produced by the hybrid ANN simulation model turned out to be as valid and superior to the conventional simulation model.

[1]  John L. Hunsucker,et al.  An evaluation of sequencing heuristics in flow shops with multiple processors , 1996 .

[2]  Ali Azadeh,et al.  Optimization of a Heavy Continuous Rolling Mill System Via Simulation , 2006 .

[3]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

[4]  Chandrasekharan Rajendran,et al.  A comparative analysis of two different approaches to scheduling in flexible flow shops , 2000 .

[5]  Taho Yang,et al.  Simulation metamodel development using uniform design and neural networks for automated material handling systems in semiconductor wafer fabrication , 2007, Simul. Model. Pract. Theory.

[6]  H. Pierreval Training A Neural Network By Simulation For Dispatching Problems , 1992, Proceedings of the Third International Conference on Computer Integrated Manufacturing,.

[7]  Yeong-Dae Kim,et al.  Due-date based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility , 1998 .

[8]  Ming Liang,et al.  Hybrid Simulated Annealing in Flow-shop Scheduling: A Diversification and Intensification Approach , 2009 .

[9]  Antonio Rizzi,et al.  A fuzzy logic based methodology to rank shop floor dispatching rules , 2002 .

[10]  Daniel J. Fonseca,et al.  Simulation metamodeling through artificial neural networks , 2003 .

[11]  H. Sarper,et al.  Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop , 1996 .

[12]  John L. Hunsucker,et al.  A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage , 2004, Eur. J. Oper. Res..

[13]  Abdelhakim Artiba,et al.  Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints , 2004, Comput. Ind. Eng..

[14]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[15]  Kurt Hornik,et al.  Multilayer feedforward networks are universal approximators , 1989, Neural Networks.

[16]  Taho Yang,et al.  Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors , 2008, Math. Comput. Simul..

[17]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[18]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[19]  Nikolay Tchernev,et al.  Generic simulation model for hybrid flow-shop , 1999 .

[20]  Taho Yang,et al.  A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem , 2007, Eur. J. Oper. Res..

[21]  Jay Liebowitz,et al.  Design and development of expert systems and neural networks , 1993 .

[22]  Samir Barman Simple priority rule combinations: An approach to improve both flow time and tardiness , 1997 .

[23]  A. Alan B. Pritsker,et al.  Simulation with Visual SLAM and AweSim , 1997 .

[24]  Dag Fritzson,et al.  General meta-model based co-simulations applied to mechanical systems , 2009, Simul. Model. Pract. Theory.

[25]  Robert T. Barrett,et al.  A SLAM II simulation study of a simplified flow shop , 1986, Simul..

[26]  Jeffrey S. Smith,et al.  Simulation system for real-time planning, scheduling, and control , 1996, Winter Simulation Conference.

[27]  V.J. Rayward-Smith,et al.  Analysis of heuristics for the UET two-machine flow shop problem with time delays , 2008, Comput. Oper. Res..

[28]  Christopher W. Zobel,et al.  Neural network-based simulation metamodels for predicting probability distributions , 2008, Comput. Ind. Eng..

[29]  Ali Azadeh,et al.  Design of practical optimum JIT systems by integration of computer simulation and analysis of variance , 2005, Comput. Ind. Eng..

[30]  Ken-ichi Funahashi,et al.  On the approximate realization of continuous mappings by neural networks , 1989, Neural Networks.

[31]  T. C. Edwin Cheng,et al.  The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times , 2007 .

[32]  Yih-Long Chang,et al.  Ranking Dispatching Rules by Data Envelopment Analysis in a Job Shop Environment , 1996 .

[33]  N. R. Srinivasa Raghavan,et al.  Scheduling parallel batch processors with incompatible job families to minimise weighted completion time , 2009 .

[34]  Larry J. Shuman,et al.  Computing confidence intervals for stochastic simulation using neural network metamodels , 1999 .

[35]  C.S.P. Rao,et al.  A heuristic for priority-based scheduling in a turbine manufacturing job-shop , 2008 .

[36]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[37]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[38]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .