Intelligent water drops algorithm on parallel machines scheduling

Maximum completion time so called makespan as well as earliness and tardiness penalties are simultaneously minimized on parallel machines in this paper. An intelligent water drops (IWD) algorithm as a new swarm-based nature inspired optimization one is presented and applied to solve this problem. Experimental results show the superiority of the employed IWD method.

[1]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[2]  Hamed Shah-Hosseini,et al.  The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm , 2009, Int. J. Bio Inspired Comput..

[3]  Jose A. Ventura,et al.  Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints , 2003, Comput. Oper. Res..

[4]  Sergey Polyakovskiy,et al.  A multi-agent system for the weighted earliness tardiness parallel machine problem , 2014, Comput. Oper. Res..

[5]  Jiang Wu,et al.  Novel intelligent water drops optimization approach to single UCAV smooth trajectory planning , 2009 .

[6]  Ertan Güner,et al.  Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration , 2009, Comput. Oper. Res..

[7]  Frank Werner,et al.  Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties , 2001 .

[8]  H. Shah-Hosseini.  An approach to continuous optimization by the Intelligent Water Drops algorithm , 2012 .

[9]  John W. Fowler,et al.  Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems , 2011, Comput. Oper. Res..

[10]  Mostafa Zandieh,et al.  Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times , 2014, Comput. Oper. Res..

[11]  Soh-Khim Ong,et al.  An improved intelligent water drops algorithm for solving multi-objective job shop scheduling , 2013, Eng. Appl. Artif. Intell..

[12]  Hamed Shah-Hosseini,et al.  Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem , 2008, Int. J. Intell. Comput. Cybern..

[13]  Ghaith Rabadi,et al.  Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times , 2006, J. Intell. Manuf..

[14]  Andrew Y. C. Nee,et al.  An improved Intelligent Water Drops algorithm for achieving optimal job-shop scheduling solutions , 2012 .

[15]  Hamed Shah-Hosseini,et al.  Problem solving by intelligent water drops , 2007, 2007 IEEE Congress on Evolutionary Computation.

[16]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[17]  Guoqing Wang,et al.  Parallel machine earliness and tardiness scheduling with proportional weights , 2003, Comput. Oper. Res..

[18]  Rubén Ruiz,et al.  A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times , 2011, Eur. J. Oper. Res..

[19]  Xiujuan Lei,et al.  Air robot path planning based on Intelligent Water Drops optimization , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[20]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .