Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563)
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: Single-machine scheduling with trade-off between number of tardy jobs and compression cost |
scientific article; zbMATH DE number 5599833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-machine scheduling with trade-off between number of tardy jobs and compression cost |
scientific article; zbMATH DE number 5599833 |
Statements
Single-machine scheduling with trade-off between number of tardy jobs and compression cost (English)
0 references
28 August 2009
0 references
single-machine scheduling problem
0 references
pseudo-polynomial time algorithm
0 references
strongly polynomial time algorithm
0 references
controllable processing times
0 references
0 references
0 references
0 references
0.8640088438987732
0 references
0.8624957203865051
0 references
0.8503305315971375
0 references
0.8412879705429077
0 references
