Hybrid 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. 

3 Figures and Tables


  • Presentations referencing similar topics