Reducibility among single machine weighted completion time scheduling problems (Q922287)
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: Reducibility among single machine weighted completion time scheduling problems |
scientific article; zbMATH DE number 4167841
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducibility among single machine weighted completion time scheduling problems |
scientific article; zbMATH DE number 4167841 |
Statements
Reducibility among single machine weighted completion time scheduling problems (English)
0 references
1990
0 references
sum of weighted completion time problems
0 references
release date
0 references
deadline
0 references
continuous machine processing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
