Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092460090 / rank | |||
Normal rank | |||
Revision as of 21:01, 19 March 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
