SOLVING JOB SHOP SCHEDULING PROBLEMS WITH CONSULTANT GUIDED SEARCH METAHEURISTICS

Nature Inspired Computing (NIC) is the research area that aims to get ideas by observing how nature behaves in various situations to solve problems. NIC when compared to the traditional computing systems, respond slowly but produces good results. NatureInspired algorithms is a class of algorithms that mimic the problem solving behavior from nature. In this paper Job Shop Scheduling Problem (JSSP) is solved by using the Consultant Guided Search algorithm (CGS) a Nature-Inspired metaheuristic algorithm. JSSP instances from OR library are selected and solved by implementing CGS algorithm. It was observed that CGS algorithm has obtained best-so-far solutions for almost all the instances taken for study.

[1]  B. Achiriloaie,et al.  VI REFERENCES , 1961 .

[2]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[3]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[4]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[5]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[6]  Lewis Ntaimo,et al.  The Million-Variable “March” for Stochastic Combinatorial Optimization , 2005, J. Glob. Optim..

[7]  Sanja Petrovic,et al.  Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation , 2006, ANTS Workshop.

[8]  Adam Baharum,et al.  A JOB-SHOP SCHEDULING PROBLEM ( JSSP ) USING GENETIC ALGORITHM ( GA ) , 2006 .

[9]  Jun Zhang,et al.  Implementation of an Ant Colony Optimization technique for job shop scheduling problem , 2006 .

[10]  Parviz Fattahi,et al.  An algorithm for multi-objective job shop scheduling problem , 2006 .

[11]  Li-Pei Wong,et al.  Bee Colony Optimization algorithm with Big Valley landscape exploitation for Job Shop Scheduling problems , 2008, 2008 Winter Simulation Conference.

[12]  Philip N. Klein,et al.  Approximation algorithms for NP-hard optimization problems , 2010 .

[13]  Serban Iordache,et al.  Consultant-guided search: a new metaheuristic for combinatorial optimization problems , 2010, GECCO '10.

[14]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[15]  Serban Iordache,et al.  Consultant-guided search combined with local search for the traveling salesman problem , 2010, GECCO '10.

[16]  Christian Blum,et al.  A Brief Survey on Hybrid Metaheuristics , 2010 .

[17]  Qinghai Bai,et al.  Analysis of Particle Swarm Optimization Algorithm , 2010, Comput. Inf. Sci..

[18]  Apinanthana Udomsakdigool,et al.  Ant colony algorithm for multi-criteria job shop scheduling to minimize makespan, mean flow time and mean tardiness , 2011 .

[19]  Petrica C. Pop,et al.  A hybrid heuristic approach for solving the generalized traveling salesman problem , 2011, GECCO '11.

[20]  Seema Rani,et al.  Optimization of TSP Using Genetic Algorithm , 2014 .