Scheduling of a flexible job‐shop using a multi‐objective genetic algorithm

Purpose – The purpose of this paper is to solve a flexible job shop scheduling problem where alternate machines are available to process the same job. The study considers the Flexible Job Shop Problem (FJSP) having n jobs and more than three machines for scheduling.Design/methodology/approach – FJSP for n jobs and more than three machines is non polynomial (NP) hard in nature and hence a multi‐objective genetic algorithm (GA) based approach is presented for solving the scheduling problem. The two objective functions formulated are minimizations of the make‐span time and total machining time. The algorithm uses a unique method of generating initial populations and application of genetic operators.Findings – The application of GA to the multi‐objective scheduling problem has given optimum solutions for allocation of jobs to the machines to achieve nearly equal utilisation of machine resources. Further, the make span as well as total machining time is also minimized.Research limitations/implications – The mo...

[1]  陳春龍,et al.  Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion , 1999 .

[2]  Fayez F. Boctor,et al.  The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops , 2001 .

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Felix T.S. Chan,et al.  Flexible job-shop scheduling problem under resource constraints , 2006 .

[5]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[6]  Seok Jin Lim,et al.  Hybrid approach to production scheduling using genetic algorithm and simulation , 2006 .

[7]  Pei-Chann Chang,et al.  Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry , 2007, Appl. Soft Comput..

[8]  C. Rajendran,et al.  A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case study , 1997 .

[9]  Andrew Y. C. Nee,et al.  Application of genetic algorithm to computer-aided process planning in distributed manufacturing environments , 2005 .

[10]  Daniel A. Finke,et al.  Multiple machine JIT scheduling: a tabu search approach , 2007 .

[11]  Carlos A. Coello Coello,et al.  Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem , 2007 .

[12]  I. Mahdavi,et al.  SOLVING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM BY A GENETIC ALGORITHM , 2008 .

[13]  C. Rajendran,et al.  A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .

[14]  Ling Wang,et al.  Determining optimal combination of genetic operators for flow shop scheduling , 2006 .

[15]  Ling Wang,et al.  An adaptive genetic algorithm with multiple operators for flowshop scheduling , 2006 .

[16]  S. Zolfaghari,et al.  Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach , 1999 .

[17]  Yoonho Seo,et al.  Evolutionary algorithm for advanced process planning and scheduling in a multi-plant , 2005, Comput. Ind. Eng..