GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times |
scientific article; zbMATH DE number 6149335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times |
scientific article; zbMATH DE number 6149335 |
Statements
GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (English)
0 references
2 April 2013
0 references
non-identical parallel machine scheduling problem with minimising total weighted completion times
0 references
metaheuristics
0 references
GRASP
0 references
path-relinking
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
