Solving a bicriterion scheduling problem (Q1131944)
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: Solving a bicriterion scheduling problem |
scientific article; zbMATH DE number 3652073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a bicriterion scheduling problem |
scientific article; zbMATH DE number 3652073 |
Statements
Solving a bicriterion scheduling problem (English)
0 references
1979
0 references
bicriterion scheduling problem
0 references
single machine
0 references
holding cost
0 references
maximum tardiness
0 references
pseudo-polynomial algorithm
0 references
job sequencing
0 references
computational complexity
0 references
