An improved lower bound for a bi-criteria scheduling problem (Q924887)
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 lower bound for a bi-criteria scheduling problem |
scientific article; zbMATH DE number 5280656
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved lower bound for a bi-criteria scheduling problem |
scientific article; zbMATH DE number 5280656 |
Statements
An improved lower bound for a bi-criteria scheduling problem (English)
0 references
29 May 2008
0 references
scheduling
0 references
completion time
0 references
weighted completion time
0 references
lower bound
0 references
