A novel search algorithm based on waterweeds reproduction principle for job shop scheduling problem

Along with the mushroom development of new information technology, scheduling plays an increasing important role in manufacturing systems. A new search algorithm which imitates reproduction principle of waterweeds in searching for water sources is proposed for solving the job shop scheduling problems (JSSPs). Inspired by the swarm intelligence in waterweeds’ collaborative behavior and inheriting their strong survivability, the new waterweeds (WW) algorithm with few user-defined parameters and simple structure shows remarkable performance in solving continuous unconstrained optimization problems, which is proved by two experiments against five well-known benchmark functions. Furthermore, according to special needs of JSSPs solving, a series of modifications are introduced into original WW algorithm and the computational experiments on a set of problem instances indicate that the new discrete WW algorithm has competitive effectiveness and efficiency in comparison with other classical JSSPs solving methods in the literature. Successful application of WW algorithm in solving JSSPs illustrates its bright prospect in manufacturing field and other related optimization areas.

[1]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[2]  Fei Tao,et al.  Resource Service Composition and Its Optimal-Selection Based on Particle Swarm Optimization in Manufacturing Grid System , 2008, IEEE Transactions on Industrial Informatics.

[3]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[4]  Fei Tao,et al.  BGM-BLA: A New Algorithm for Dynamic Migration of Virtual Machines in Cloud Computing , 2016, IEEE Transactions on Services Computing.

[5]  Carlos A. Coello Coello,et al.  Use of an Artificial Immune System for Job Shop Scheduling , 2003, ICARIS.

[6]  Wang Chun-feng,et al.  A Global Optimization Bionics Algorithm for Solving Integer Programming - Plant Growth Simulation Algorithm , 2005 .

[7]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[8]  Fernando Buarque de Lima Neto,et al.  A novel search algorithm based on fish school behavior , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[9]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[10]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[11]  Fei Tao,et al.  Cloud manufacturing: a computing and service-oriented manufacturing model , 2011 .

[12]  Debasish Ghose,et al.  Glowworm swarm based optimization algorithm for multimodal functions with collective robotics applications , 2006, Multiagent Grid Syst..

[13]  Harold H. Greenberg,et al.  A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..

[14]  Mostafa Zandieh,et al.  Scheduling open shops with parallel machines to minimize total completion time , 2011, J. Comput. Appl. Math..

[15]  Fei Tao,et al.  Big Data in product lifecycle management , 2015, The International Journal of Advanced Manufacturing Technology.

[16]  Emanuel Falkenauer,et al.  A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[17]  Jens Clausen,et al.  Parallel branch-and-bound methods for thejob-shop scheduling problem , 1998, Ann. Oper. Res..

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

[19]  Weijun Xia,et al.  A hybrid particle swarm optimization approach for the job-shop scheduling problem , 2006 .

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

[21]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

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

[23]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[24]  Gary B. Fogel,et al.  Noisy optimization problems - a particular challenge for differential evolution? , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[25]  Fei Tao,et al.  A new approach for data processing in supply chain network based on FPGA , 2015, The International Journal of Advanced Manufacturing Technology.

[26]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[27]  Cheng Wu,et al.  A hybrid artificial bee colony algorithm for the job shop scheduling problem , 2013 .

[28]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[29]  Fernando Buarque de Lima Neto,et al.  Fish School Search , 2021, Nature-Inspired Algorithms for Optimisation.

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

[31]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

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

[33]  Fei Tao,et al.  IoT-Based Intelligent Perception and Access of Manufacturing Resource Toward Cloud Manufacturing , 2014, IEEE Transactions on Industrial Informatics.

[34]  Jun-qing Li,et al.  A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem , 2013 .

[35]  Rong-Hwa Huang,et al.  Multi-objective job-shop scheduling with lot-splitting production , 2010 .

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

[37]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[38]  Sanja Petrovic,et al.  A Fuzzy Genetic Algorithm for Real-World Job Shop Scheduling , 2005, IEA/AIE.

[39]  Yongkui Liu,et al.  Manufacturing Service Management in Cloud Manufacturing: Overview and Future Research Directions , 2015 .

[40]  Xin-She Yang,et al.  Flower Pollination Algorithm for Global Optimization , 2012, UCNC.

[41]  Yoke San Wong,et al.  Job Shop Scheduling with Dynamic Fuzzy Selection of Dispatching Rules , 2000 .

[42]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[43]  Ying Feng,et al.  CLPS-GA: A case library and Pareto solution-based hybrid genetic algorithm for energy-aware cloud service scheduling , 2014, Appl. Soft Comput..

[44]  Fei Tao,et al.  FC-PACO-RM: A Parallel Method for Service Composition Optimal-Selection in Cloud Manufacturing System , 2013, IEEE Transactions on Industrial Informatics.

[45]  Andrew Y. C. Nee,et al.  A quantum multi-agent evolutionary algorithm for selection of partners in a virtual enterprise , 2010 .

[46]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[47]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[48]  Feng Qian,et al.  A Hybrid Algorithm Based on Particle Swarm Optimization and Simulated Annealing for Job Shop Scheduling , 2007, Third International Conference on Natural Computation (ICNC 2007).

[49]  Li Lin,et al.  Effective job shop scheduling through active chain manipulation , 1995, Comput. Oper. Res..

[50]  David B. Shmoys,et al.  A time-oriented approach to computing optimal schedules for the job-shop scheduling problem , 1996 .

[51]  G. Vilcot,et al.  A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem , 2011 .

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

[53]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[54]  Mostafa Zandieh,et al.  An artificial immune algorithm for the flexible job-shop scheduling problem , 2010, Future Gener. Comput. Syst..

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

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

[57]  P. Aravindan,et al.  A Tabu Search Algorithm for Job Shop Scheduling , 2000 .

[58]  Fei Tao,et al.  Correlation-aware resource service composition and optimal-selection in manufacturing grid , 2010, Eur. J. Oper. Res..

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

[60]  Philippe Lacomme,et al.  Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles , 2013 .

[61]  Fei Tao,et al.  CCIoT-CMfg: Cloud Computing and Internet of Things-Based Cloud Manufacturing Service System , 2014, IEEE Transactions on Industrial Informatics.

[62]  Qining Wang,et al.  Concept, Principle and Application of Dynamic Configuration for Intelligent Algorithms , 2014, IEEE Systems Journal.

[63]  Seyda Topaloglu,et al.  A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization , 2009 .

[64]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[65]  Andrew Y. C. Nee,et al.  Advanced manufacturing systems: socialization characteristics and trends , 2015, Journal of Intelligent Manufacturing.

[66]  P. D. D. Dominic,et al.  Efficient dispatching rules for dynamic job shop scheduling , 2003 .

[67]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[68]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[69]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

[70]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[71]  N. Jawahar,et al.  A genetic algorithm for scheduling flexible manufacturing systems , 1998 .