Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210)
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: Approximation algorithms for scheduling a single machine to minimize total late work |
scientific article; zbMATH DE number 77893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for scheduling a single machine to minimize total late work |
scientific article; zbMATH DE number 77893 |
Statements
Approximation algorithms for scheduling a single machine to minimize total late work (English)
0 references
17 December 1992
0 references
approximation algorithms
0 references
worst-case analysis
0 references
single machine
0 references
total late work
0 references
integer processing time
0 references
integer due date
0 references
truncated enumeration
0 references
