New Heuristics for No-Wait Flowshops with Performance Measures of Makespan and Mean Completion Time

The m-machine no-wait flowshop scheduling problem is addressed by taking into account two performance measures of makespan and mean completion time. The objective is to minimize makespan such that mean completion time is less than a certain value. A dominance relation is provided for a special case of the problem. Moreover, two new heuristics are proposed in this paper. Computational analysis indicates that one of the proposed heuristics (eSA) reduces the error of the previously best known heuristic for the problem (HH1) by 70% while the computational time of HH1 is 30% more than that of eSA. Furthermore, the computational analysis also indicates that the other proposed heuristic (eHH) reduces the error of HH1 by 80% while both eHH and HH1 have the same computational time. All the results have been statistically verified.

[1]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[2]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[3]  Tariq Aldowaisan,et al.  No-wait flowshops with bicriteria of makespan and total completion time , 2002, J. Oper. Res. Soc..

[4]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[5]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[6]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[7]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[8]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[9]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[10]  Marcelo Seido Nagano,et al.  Evaluating the performance for makespan minimisation in no-wait flowshop sequencing , 2008 .

[11]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..

[12]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[13]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[14]  L. Wang,et al.  A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..

[15]  Xiaoping Li,et al.  Complete local search with limited memory algorithm for no-wait job shops to minimize makespan , 2009, Eur. J. Oper. Res..

[16]  V. Vinod,et al.  Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times , 2009 .

[17]  J. Framiñan,et al.  An efficient heuristic for total flowtime minimisation in no-wait flowshops , 2010 .

[18]  Lin-Yu Tseng,et al.  A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .

[19]  Ali Allahverdi,et al.  Heuristics for no-wait flowshops with makespan subject to mean completion time , 2012, Appl. Math. Comput..