| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652773 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
This paper considers the problem of scheduling n independent jobs on m uniform parallel machines, with the aim of minimizing the total weighted completion time. We present two hybrid meta-heuristics to solve this problem. Based on a large set of instances, an experimental study has been carried out to evaluate our methods.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
