Testing the performance of teaching-learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases

Teaching-learning based optimization (TLBO) algorithm has been recently proposed in the literature as a novel population oriented meta-heuristic algorithm. It has been tested on some unconstrained and constrained non-linear programming problems, including some design optimization problems with considerable success. The main purpose of this paper is to analyze the performance of TLBO algorithm on combinatorial optimization problems first time in the literature. We also provided a detailed literature review about TLBO's applications. The performance of the TLBO algorithm is tested on some combinatorial optimization problems, namely flow shop (FSSP) and job shop scheduling problems (JSSP). It is a well-known fact that scheduling problems are amongst the most complicated combinatorial optimization problems. Therefore, performance of TLBO algorithm on these problems can give an idea about its possible performance for solving other combinatorial optimization problems. We also provided a comprehensive comparative study along with statistical analyses in order to present effectiveness of TLBO algorithm on solving scheduling problems. Experimental results show that the TLBO algorithm has a considerable potential when compared to the best-known heuristic algorithms for scheduling problems.

[1]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[2]  Vedat Toğan,et al.  Design of planar steel frames using Teaching–Learning Based Optimization , 2012 .

[3]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[4]  R. Venkata Rao,et al.  Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems , 2011, Comput. Aided Des..

[5]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[6]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[7]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[8]  Chris N. Potts,et al.  Fifty years of scheduling: a survey of milestones , 2009, J. Oper. Res. Soc..

[9]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[10]  Vivek Patel,et al.  An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems , 2012 .

[11]  R. Venkata Rao,et al.  Mechanical Design Optimization Using Advanced Optimization Techniques , 2012 .

[12]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[13]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[14]  Anima Naik,et al.  Improvement of Initial Cluster Center of C-means using Teaching Learning based Optimization☆ , 2012 .

[15]  Gajanan Waghmare,et al.  Comments on "A note on teaching-learning-based optimization algorithm" , 2013, Inf. Sci..

[16]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[17]  Pingzhi Fan,et al.  An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model , 2007, Expert Syst. Appl..

[18]  R. Venkata Rao,et al.  Multi-objective optimization of combined Brayton and inverse Brayton cycles using advanced optimization algorithms , 2012 .

[19]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[20]  Gary G. Yen,et al.  Job shop scheduling optimization through multiple independent particle swarms , 2009, Int. J. Intell. Comput. Cybern..

[21]  Liang Gao,et al.  An efficient memetic algorithm for solving the job shop scheduling problem , 2011, Comput. Ind. Eng..

[22]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[23]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[24]  Liang Gao,et al.  An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers , 2011, Inf. Sci..

[25]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[26]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[27]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[28]  N Hooda,et al.  Flow Shop Scheduling using Simulated Annealing: A Review , 2011 .

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

[30]  Anima Naik,et al.  Data Clustering Based on Teaching-Learning-Based Optimization , 2011, SEMCCO.

[31]  R V Rao,et al.  Parameters optimization of advanced machining processes using TLBO algorithm , 2011 .

[32]  Matej Crepinsek,et al.  A note on teaching-learning-based optimization algorithm , 2012, Inf. Sci..

[33]  Chandramouli Anandaraman.  An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems , 2011 .

[34]  R. Venkata Rao,et al.  THERMODYNAMIC OPTIMIZATION OF PLATE-FIN HEAT EXCHANGER USING TEACHING-LEARNING- BASED OPTIMIZATION (TLBO) ALGORITHM , 2012 .

[35]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[36]  Yuping Wang,et al.  A new hybrid genetic algorithm for job shop scheduling problem , 2012, Comput. Oper. Res..

[37]  Bijaya K. Panigrahi,et al.  Application of Multi-Objective Teaching-Learning-Based Algorithm to an Economic Load Dispatch Problem with Incommensurable Objectives , 2011, SEMCCO.

[38]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[39]  Babak Amiri,et al.  Application of Teaching-Learning-Based Optimization Algorithm on Cluster Analysis , 2012 .

[40]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[41]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[42]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[43]  R. Venkata Rao,et al.  Teaching-Learning-Based Optimization: An optimization method for continuous non-linear large scale problems , 2012, Inf. Sci..

[44]  Yanchun Liang,et al.  Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems , 2008 .

[45]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[46]  Niranjan Nayak,et al.  A Function Based Fuzzy Controller for VSC-HVDC System to Enhance Transient Stability of AC/DC Power System , 2011, SEMCCO.

[47]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[48]  Ji Ma,et al.  ASP: An Adaptive Setup Planning Approach for Dynamic Machine Assignments , 2010, IEEE Transactions on Automation Science and Engineering.

[49]  R. Rao,et al.  Multi-objective optimization of heat exchangers using a modified teaching-learning-based optimization algorithm , 2013 .

[50]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[51]  Adil Baykasoğlu,et al.  A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates , 1998 .

[52]  Anupam Basu,et al.  A Tag Machine Based Performance Evaluation Method for Job-Shop Schedules , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[53]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[54]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[55]  Yanchun Liang,et al.  An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[56]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[57]  César Rego,et al.  A filter-and-fan approach to the job shop scheduling problem , 2009, Eur. J. Oper. Res..

[58]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[59]  R. Venkata Rao,et al.  Parameter optimization of modern machining processes using teaching-learning-based optimization algorithm , 2013, Eng. Appl. Artif. Intell..

[60]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[61]  R. Venkata Rao,et al.  Multi-objective optimization of two stage thermoelectric cooler using a modified teaching-learning-based optimization algorithm , 2013, Eng. Appl. Artif. Intell..

[62]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[63]  Jaideep Motwani,et al.  Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 , 1997 .

[64]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[65]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

[66]  Adil Baykasoğlu,et al.  Linguistic-based meta-heuristic optimization model for flexible job shop scheduling , 2002 .

[67]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[68]  Kun Fan,et al.  Notice of RetractionAn analysis of research in job shop scheduling problem (2000–2009) , 2010, 2010 IEEE International Conference on Advanced Management Science(ICAMS 2010).

[69]  Taher Niknam,et al.  $\theta$-Multiobjective Teaching–Learning-Based Optimization for Dynamic Economic Emission Dispatch , 2012, IEEE Systems Journal.