Operation allocation in automated manufacturing system using GA-based approach with multifidelity models

The scheduling problem in manufacturing is considered as among the toughest to solve. The basic drawback of many proposed methods has been the huge amount of computation time for simulation. This paper proposes a framework to solve the operation allocation problem in automated manufacturing systems using the concept of multifidelity. The concept of multifidelity has been proposed by several researchers in order to reduce the computation time for simulation. In this paper, a GA-based heuristic procedure will be developed along with the multifidelity approach to solve a typical manufacturing scheduling problem. Four different fidelity models have been defined on which experimentation is carried out. The proposed method has been tested on a sample dataset and the results have been analysed to choose the fidelity model which best describes the scenario.

[1]  Pei-Chann Chang,et al.  A Rescheduling Procedure for Manufacturing Systems Under Random Disruptions , 1992 .

[2]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[3]  Mary Jo Maffei,et al.  Dealing with the Uncertainties of Manufacturing: Flexibility, Buffers and Integration , 1993 .

[4]  Yeong-Dae Kim,et al.  Simulation-based real-time scheduling in a flexible manufacturing system , 1993 .

[5]  Shimon Y. Nof,et al.  Scheduling/rescheduling in the manufacturing operating system environment† , 1985 .

[6]  Suresh P. Sethi,et al.  Flexibility in manufacturing: A survey , 1990 .

[7]  A. G. Lockett,et al.  Job shop scheduling heuristics and frequency of scheduling , 1982 .

[8]  Reha Uzsoy,et al.  Analysis of periodic and event-driven rescheduling policies in dynamic shops , 1992 .

[9]  Pierre Borne,et al.  Evolution programs for job-shop scheduling , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[10]  T. Yamada,et al.  Job shop scheduling , 1997 .

[11]  Joël Favrel,et al.  Taking into account the rescheduling problem during the scheduling phase , 1993 .

[12]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[13]  Manish Bachlaus,et al.  An integrated tool planning and production planning problem for flexible manufacturing systems using genetic algorithm , 2007, Int. J. Intell. Syst. Technol. Appl..

[14]  J. Venkateswaran,et al.  Impact of modelling approximations in supply chain analysis – an experimental study , 2004 .

[15]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[16]  J.Fredrik Persson.  The impact of different levels of detail in manufacturing systems simulation models , 2002 .

[17]  Hyunbo Cho,et al.  Determination of efficient simulation model fidelity for flexible manufacturing systems , 2005, Int. J. Comput. Integr. Manuf..

[18]  James E. Rumbaugh,et al.  Object-Oriented Modelling and Design , 1991 .

[19]  Alexander W. Booth.  Object-Oriented Modeling for Flexible Manufacturing Systems , 2001 .

[20]  Saif Benjaafar,et al.  Modelling, measurement and evaluation of sequencing flexibility in manufacturing systems , 1996 .

[21]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[22]  Jeffrey S. Smith,et al.  Job shop scheduling considering material handling , 1999 .

[23]  M. Widmer,et al.  Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach , 1991 .