A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

In this paper we address the problem of minimizing the weighted sum of makespan and maximum tardiness in an m-machine flow shop environment. This is a NP-hard problem in the strong sense. An attempt has been made to solve this problem using a metaheuristic called Greedy Randomized Adaptive Search Procedure (GRASP). GRASP is a competitive algorithm and is a meta-heuristic for solving combinatorial optimization problems. We have customized the basic concepts of GRASP algorithm to solve a bicriteria flow shop problem and a new algorithm named B-GRASP (Bicriteria GRASP algorithm) is proposed. The new proposed algorithm is evaluated using benchmark problems taken from Taillard and compared with the existing simulated annealing based heuristic developed by Chakravarthy and Rajendran. Computational experiments indicate that the proposed algorithm is much better than the existing one in all cases.

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

[2]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[3]  Venkata Ranga Neppalli,et al.  Minimizing total flow time in a two-machine flowshop problem with minimum makespan , 2001 .

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

[5]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .

[6]  G. Prabhaharan,et al.  Implementation of grasp in flow shop scheduling , 2006 .

[7]  A. Nagar,et al.  Multiple and bicriteria scheduling : A literature survey , 1995 .

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

[9]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[10]  R. L. Daniels,et al.  Multiobjective flow-shop scheduling , 1990 .

[11]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem , 1998, J. Comb. Optim..

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

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

[14]  C. Rajendran,et al.  Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell , 1998 .

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

[16]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

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

[18]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[19]  Ali Allahverdi,et al.  The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime , 2003, Eur. J. Oper. Res..