Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5701332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms |
scientific article; zbMATH DE number 5701332 |
Statements
Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (English)
0 references
24 April 2010
0 references
parallel-machine scheduling
0 references
total weighted completion time
0 references
model
0 references
relaxation
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9383158683776855
0 references
0.8422257304191589
0 references
0.8419391512870789
0 references
0.8382349014282227
0 references
