GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:55, 1 February 2024
scientific article
| 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 |
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
