Varied Metaheuristics for Uniform Parallel Machine to Minimize Total Weighted Completion Time

In this paper, we consider the problem of scheduling n independent jobs on m uniform parallel machines such that total weighted completion time is minimized. We present two meta-heuristics and two hybrid meta-heuristics to solve this problem. Based on a set of instances, a comparative study has been realized in order to evaluate these approaches.

[1]  Mostafa Zandieh,et al.  Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm , 2009, Expert Syst. Appl..

[2]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[3]  Meral Azizoglu,et al.  On the minimization of total weighted flow time with identical and uniform parallel machines , 1999, Eur. J. Oper. Res..

[4]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index , 1998, Comput. Chem..

[5]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[6]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[7]  L. Kronsjö,et al.  Advances in parallel algorithms , 1992 .

[8]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[9]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[10]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[11]  Alain Hertz,et al.  A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..

[12]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures , 2000, Discret. Math..

[13]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[14]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[15]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[16]  Ivan Dimov,et al.  Advances in Parallel Algorithms , 1994 .

[17]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[18]  Shanlin Yang,et al.  Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms ☆ , 2009 .