Scheduling to Minimize the Sum of Weighted Total Flow Time and Makespan in a Permutation Flow Shop with Setup Time

The Permutation Flow shop Scheduling Problem is a typical combinational optimization problem and has been proved to be strongly NP-hard. This paper deals with B-GRASP algorithm meta-heuristic in finding the solution and in analyzing the best the optimal schedule, thus minimizing the bi-objectives such as weighted makespan and total flow time. The proposed approach is evaluated using benchmark problems taken from Taillard and compared with simulated annealing algorithm. Computational experiments indicate that the proposed B-GRASP algorithm is a feasible and effective approach for the multiobjective problem.

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

[2]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

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

[4]  Bassem Jarboui,et al.  A combinatorial particle swarm optimisation for solving permutation flowshop problems , 2008, Comput. Ind. Eng..

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

[6]  J. I. Min,et al.  Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date , 2001, Eur. J. Oper. Res..

[7]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[8]  Marcelo Seido Nagano,et al.  A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .

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

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Shih-Wei Lin,et al.  Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm , 2013, Comput. Oper. Res..

[12]  Mehmet Mutlu Yenisey,et al.  A multi-objective ant colony system algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

[13]  Shih-Wei Lin,et al.  Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems , 2007 .

[14]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[15]  Mostafa Zandieh,et al.  A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic , 2009, Expert Syst. Appl..

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

[17]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[18]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[19]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..