Title of article
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
Author/Authors
Zaidi، نويسنده , , Makram and Jarboui، نويسنده , , Bassem and Kacem، نويسنده , , Imed and Loukil، نويسنده , , Taicir، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
543
To page
550
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.
Keywords
Scheduling , Total weighted completion time , parallel-machine
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455457
Link To Document