Application of Firefly Algorithm and Its Parameter Setting for Job Shop Scheduling

Abstract Job shop scheduling problem (JSSP) is one of the most famous scheduling problems, most of which are categorised into Non-deterministic Polynomial (NP) hard problem. The objectives of this paper are to i) present the application of a recent developed metaheuristic called Firefly Algorithm (FA) for solving JSSP; ii) investigate the parameter setting of the proposed algorithm; and iii) compare the FA performance using various parameter settings. The computational experiment was designed and conducted using five benchmarking JSSP datasets from a classical OR-Library. The analysis of the experimental results on the FA performance comparison between with and without using optimised parameter settings was carried out. The FA with appropriate parameters setting that got from the experiment analysis produced the best-so-far schedule better than the FA without adopting parameter settings. Keywords : Scheduling, Job shop, Metaheuristics, Firefly Algorithm, Experimental design, Parameter setting (Selected from 1st Symposium on Hands-on Research and Development, Chiang Mai)

[1]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[2]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[3]  John W. Fowler,et al.  A combined dispatching criteria approach to scheduling semiconductor manufacturing systems , 2001 .

[4]  Shengxiang Yang,et al.  A new adaptive neural network and heuristics hybrid approach for job-shop scheduling , 2001, Comput. Oper. Res..

[5]  P. Pongcharoena,et al.  Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products , 2002 .

[6]  Peter B. Luh,et al.  An alternative framework to Lagrangian relaxation approach for job shop scheduling , 2003, Eur. J. Oper. Res..

[7]  S. E. Kilic,et al.  Job shop scheduling using fuzzy logic , 2004 .

[8]  Pupong Pongcharoen,et al.  The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure , 2004, Eur. J. Oper. Res..

[9]  Appa Iyer Sivakumar,et al.  Job shop scheduling techniques in semiconductor manufacturing , 2006 .

[10]  Morikazu Nakamura,et al.  Evolutionary Computing of Petri Net Structure for Cyclic Job Shop Scheduling , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Sam Kwong,et al.  An Evolutionary Approach for Solving the Multi-Objective Job-Shop Scheduling Problem , 2007, Evolutionary Scheduling.

[12]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

[13]  Liang Gao,et al.  A Survey and Future Trend of Study on Multi-Objective Scheduling , 2008, 2008 Fourth International Conference on Natural Computation.

[14]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[15]  Philippe Baptiste,et al.  Lagrangian bounds for just-in-time job-shop scheduling , 2008, Comput. Oper. Res..

[16]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[17]  Heinz Gröflin,et al.  A new neighborhood and tabu search for the Blocking Job Shop , 2009, Discret. Appl. Math..

[18]  Slawomir Zak,et al.  Firefly Algorithm for Continuous Constrained Optimization Tasks , 2009, ICCCI.

[19]  Shi-Jinn Horng,et al.  An efficient job-shop scheduling algorithm based on particle swarm optimization , 2010, Expert Syst. Appl..

[20]  Ming-Huwi Horng,et al.  The Codebook Design of Image Vector Quantization Based on the Firefly Algorithm , 2010, ICCCI.

[21]  Kamran Zamanifar,et al.  An agent-based parallel approach for the job shop scheduling problem with genetic algorithms , 2010, Math. Comput. Model..

[22]  Graham Kendall,et al.  An improved constraint satisfaction adaptive neural network for job-shop scheduling , 2010, J. Sched..

[23]  Pierre Lopez,et al.  Generalized disjunctive constraint propagation for solving the job shop problem with time lags , 2011, Eng. Appl. Artif. Intell..

[24]  Theofanis Apostolopoulos,et al.  Application of the Firefly Algorithm for Solving the Economic Emissions Load Dispatch Problem , 2011 .

[25]  Rui Zhang,et al.  A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective , 2011, Comput. Oper. Res..

[26]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .