A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541)
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: A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates |
scientific article; zbMATH DE number 5318745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates |
scientific article; zbMATH DE number 5318745 |
Statements
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (English)
0 references
1 September 2008
0 references
lower bound
0 references
dominance properties
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9250385761260986
0 references
0.8998916745185852
0 references
0.893652081489563
0 references
0.884779691696167
0 references
