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