A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria

In this paper, we tackle the problem of total flowtime and makespan minimisation in a permutation flowshop. For this, we introduce a multi-criteria iterated greedy search algorithm. This algorithm iterates over a multicriteria constructive heuristic approach to yield a set of Pareto-efficient solutions (a posteriori approach). The proposed algorithm is compared against the best-so-far heuristic for the problem under consideration. The comparison shows the proposal to be very efficient for a wide number of multicriteria performance measures. Aside, an extensive computational experience is carried out in order to analyse the different parameters of the algorithm. The analysis shows the algorithm to be robust for most of the considered performance measures.

[1]  Jacques Teghem,et al.  Efficiency of interactive multi-objective simulated annealing through a case study , 1998, J. Oper. Res. Soc..

[2]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[3]  C. Hwang,et al.  Fuzzy Multiple Objective Decision Making: Methods And Applications , 1996 .

[4]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[5]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[6]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

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

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

[9]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[10]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

[11]  Tapan P. Bagchi,et al.  Multiobjective Scheduling by Genetic Algorithms , 1999 .

[12]  Vinícius Amaral Armentano,et al.  An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem , 2004, J. Heuristics.

[13]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[14]  Sunderesh S. Heragu,et al.  A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem , 1995 .

[15]  J E C Arroyo,et al.  A partial enumeration heuristic for multi-objective flowshop scheduling problems , 2004, J. Oper. Res. Soc..

[16]  Chandrasekharan Rajendran,et al.  Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .

[17]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

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

[19]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[20]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[21]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[22]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..