An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (Q1412717): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:48, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. |
scientific article |
Statements
An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (English)
0 references
25 November 2003
0 references
Scheduling
0 references
Branch-and-bound
0 references
Bicriterion
0 references
Deadline
0 references
