Single Machine Scheduling to Minimize Total Late Work (Q4017089)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 89859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single Machine Scheduling to Minimize Total Late Work |
scientific article; zbMATH DE number 89859 |
Statements
Single Machine Scheduling to Minimize Total Late Work (English)
0 references
16 January 1993
0 references
single machine
0 references
due date
0 references
total late work
0 references
pseudopolynomial dynamic programming algorithm
0 references
0.9587101340293884
0 references
0.9010470509529114
0 references
0.8978385329246521
0 references
0.8591537475585938
0 references
0.8582541346549988
0 references
