A heuristic algorithm to minimise the total flowtime of jobs in permutation flowshops

A heuristic algorithm with six implementations (HA-I to HA-VI) is presented in this paper, and it is used to solve the permutation flowshop scheduling problem to minimise the total flowtime of jobs. These implementations have been evaluated by using the 90 benchmark flowshop scheduling problem instances, and the solutions yielded are compared with the solutions reported in the literature. The comparison shows that the implementations all together have produced better solutions for 28 problem instances and same solutions for 29 problem instances, out of 90 problem instances considered with respect to the solutions by Iterated Local Search algorithm proposed by Dong et al. (2009). They have also produced better solutions for 50 problem instances and the same solutions for 19 problem instances, out of 90 problem instances considered with respect to the solutions by PSOvns algorithm proposed by Tasgetiren et al. (2007), as reported in Dong et al. (2009).

[1]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

[2]  Dipak Laha,et al.  Improved heuristically guided genetic algorithm for the flow shop scheduling problem , 2007 .

[3]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

[4]  Mariappan Kadarkarainadar Marichelvam,et al.  An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems , 2012, Int. J. Bio Inspired Comput..

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

[6]  Chandrasekharan Rajendran,et al.  A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs , 2005, J. Oper. Res. Soc..

[7]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

[8]  Marco César Goldbarg,et al.  Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime , 2012, Expert Syst. Appl..

[9]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[10]  Jindong Zhang,et al.  The circular discrete particle swarm optimization algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

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

[12]  Lin-Yu Tseng,et al.  A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem , 2010 .

[13]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

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

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

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

[17]  Chandrasekharan Rajendran,et al.  Heuristics for scheduling in a flowshop with setup, processing and removal times separated , 1997 .

[18]  Ming Liang,et al.  Hybrid Simulated Annealing in Flow-shop Scheduling: A Diversification and Intensification Approach , 2009 .

[19]  Scheduling jobs on flowshop environment applying simulated annealing algorithm , 2009 .

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

[21]  P. Aravindan,et al.  Constructive and improvement flow shop scheduling heuristics: An extensive evaluation , 2001 .

[22]  Chandrasekharan Rajendran,et al.  Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs , 1999 .

[23]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[24]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .