Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:15, 1 February 2024
scientific article
| 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 |
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
