An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (Q1412717)
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: An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. |
scientific article; zbMATH DE number 2009204
| 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; zbMATH DE number 2009204 |
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
0 references
