Iniciojournal-articleGRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
DaSCI
GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times