Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:50, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-machine scheduling with trade-off between number of tardy jobs and resource allocation |
scientific article |
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
