Discrete particle swarm optimisation algorithms for minimising the completion-time variance of jobs in flowshops

In this paper, the problem of scheduling in the permutation flowshop scheduling problem is considered with the objective of minimising the completion-time variance of jobs (CTV). Two particle swarm optimisation algorithms (PSOAs) are proposed and analysed. The first PSOA is inspired from the solution construction procedures that are used in ant colony optimisation algorithms. The second algorithm is a newly developed one. The proposed algorithms are applied to a set of benchmark flowshop scheduling problems, and performances of the algorithms are evaluated by comparing the obtained results with the results published in the literature. The performance analysis demonstrates the effectiveness of the proposed algorithms in solving the permutation flowshop sequencing problem with the CTV objective.

[1]  G. Srinivasan,et al.  A branch and bound algorithm to minimize completion time variance on a single processor , 2003, Comput. Oper. Res..

[2]  N. R. Srinivasa Raghavan,et al.  Scheduling parallel batch processors with incompatible job families to minimise weighted completion time , 2009 .

[3]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

[4]  Yih-Long Chang,et al.  Minimizing Mean Squared Deviation of Completion Times About a Common Due Date , 1987 .

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

[6]  Yash P. Gupta,et al.  Minimizing flow time variance in a single machine system using genetic algorithms , 1993 .

[7]  Xueping Li,et al.  Restricted job completion time variance minimisation on identical parallel machines , 2009 .

[8]  V. Rajendra Prasad,et al.  Bounds for the position of the smallest job in completion time variance minimization , 1999, Eur. J. Oper. Res..

[9]  Umar Al-Turki,et al.  Tabu search for a class of single-machine scheduling problems , 2001, Comput. Oper. Res..

[10]  M. Raghavachari,et al.  Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Prabuddha De,et al.  On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

[13]  Madabhushi Raghavachari,et al.  A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..

[14]  Yang Sun,et al.  Minimizing Class-based Completion Time Variance on a Single Machine , 2007 .

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

[16]  Wieslaw Kubiak,et al.  Proof of a conjecture of Schrage about the completion time variance problem , 1991, Oper. Res. Lett..

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

[18]  L. Schrage.  Minimizing the Time-in-System Variance for a Finite Jobset , 1975 .

[19]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

[20]  V. Rajendra Prasad,et al.  Pseudopolynomial algorithms for CTV minimization in single machine scheduling , 1997, Comput. Oper. Res..

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

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

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

[24]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

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

[26]  Samuel Eilon,et al.  Minimising Waiting Time Variance in the Single Machine Problem , 1977 .