Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988)
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 resource allocation |
scientific article; zbMATH DE number 1045762
| 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 resource allocation |
scientific article; zbMATH DE number 1045762 |
Statements
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (English)
0 references
7 August 1997
0 references
sequencing
0 references
time-cost trade-offs
0 references
resource allocation
0 references
single-machine scheduling
0 references
NP-hardness
0 references
pseudo-polynomial-time dynamic programming algorithm
0 references
0 references
0 references
0.9376427
0 references
0.9366752
0 references
0.93666303
0 references
0.92899543
0 references
0.92741126
0 references
0.9266622
0 references
0.9250751
0 references
