A Novel Imperialist Competitive Algorithm to Solve Flexible Flow Shop Scheduling Problem in Order to Minimize Maximum Completion Time

This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NP-hard, metaheuristic algorithms are proper to solve this class of problems. Hence, in this paper, a novel imperialist competitive algorithm (ICA) is proposed to tackle of addressed problem. In order to achieve the reliable results in our proposed algorithm, a comprehensive tuning is performed using Taguchi method. to validate this proposed algorithm, the other popular algorithm namely simulated annealing is developed for this goal. Simulation results indicated that ICA is superior to SA. General Terms Algorithms, Scheduling.

[1]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Mostafa Zandieh,et al.  Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm , 2011 .

[3]  Suna Kondakci Köksalan,et al.  A flexible flowshop problem with total flow time minimization , 2001, Eur. J. Oper. Res..

[4]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[5]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[6]  Chandrasekharan Rajendran,et al.  Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan , 1992 .

[7]  Fariborz Jolai,et al.  A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection , 2009 .

[8]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[9]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[10]  Raid Al-Aomar,et al.  Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs , 2006, Simul. Model. Pract. Theory.

[11]  Mostafa Zandieh,et al.  A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties , 2011, Expert Syst. Appl..

[12]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

[13]  T. R. Bement,et al.  Taguchi techniques for quality engineering , 1995 .

[14]  Yves Pochet,et al.  A branch-and-bound algorithm for the hybrid flowshop , 2000 .

[15]  T. C. Edwin Cheng,et al.  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..

[16]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[17]  Anu Maria,et al.  A Simulated Annealing Approach to Scheduling in A Flow Shop with Multiple Processors , 1998 .

[18]  Mostafa Zandieh,et al.  An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems , 2010 .

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

[20]  L. Su.  A hybrid two-stage flowshop with limited waiting time constraints , 2003 .

[21]  G.-C. Lee,et al.  A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness , 2004 .

[22]  Wing Shing Wong,et al.  The local search approach to flexible flow line scheduling , 1988 .

[23]  A. Allahverdi,et al.  New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness , 2009 .

[24]  Antony Vignier,et al.  A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop , 1996, Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96.

[25]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[26]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[27]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..