Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance

The present work deals with the development of particle swarm optimization algorithm to solve the multi-objective flowshop scheduling problem. In this paper, minimization of makespan, total flowtime and completion time variance are considered simultaneously. Performance of the proposed methodology has been tested by solving benchmark scheduling problems available in the literature. The proposed methodology is guided to search a set of non-dominated solutions close to the Pareto front. The search capability of the proposed PSO algorithm is enhanced using a local search mechanism. This work is a preliminary step in our research to identify the reference or Pareto solution sets for the benchmark FSPs proposed in the literature, when (Cmax), (tft) and (ctv) are to be simultaneously optimized.

[1]  Ali Allahverdi,et al.  The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime , 2003, Eur. J. Oper. Res..

[2]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[3]  C. Rajendran,et al.  A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .

[4]  Wieslaw Kubiak,et al.  Completion time variance minimization on a single machine is difficult , 1993, Oper. Res. Lett..

[5]  R. K. Suresh,et al.  Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan , 2005, ICNC.

[6]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[7]  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..

[8]  Appa Iyer Sivakumar,et al.  Hierarchical minimization of completion time variance and makespan in jobshops , 2006, Comput. Oper. Res..

[9]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

[10]  Chandrasekharan Rajendran,et al.  Two ant-colony algorithms for minimizing total flowtime in permutation flowshops , 2005, Comput. Ind. Eng..

[11]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

[12]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[13]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[14]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[15]  R. Suresh,et al.  Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

[16]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[17]  Marcelo Seido Nagano,et al.  Evaluating the performance of tabu search procedures for flow shop sequencing , 1998, J. Oper. Res. Soc..

[18]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[19]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[20]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

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

[22]  T. C. Wong,et al.  A genetic algorithm-based approach to machine assignment problem , 2005 .

[23]  C. Rajendran,et al.  An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .

[24]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[25]  Chandrasekharan Rajendran,et al.  Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .

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