Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994)
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: Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates |
scientific article; zbMATH DE number 6107480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates |
scientific article; zbMATH DE number 6107480 |
Statements
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (English)
0 references
15 November 2012
0 references
scheduling
0 references
single machine
0 references
release dates
0 references
lower bounds
0 references
splitting
0 references
total weighted completion time
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
