The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times (Q1608433): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:57, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times |
scientific article |
Statements
The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times (English)
0 references
6 August 2002
0 references
scheduling
0 references
sequencing
0 references
time-dependence
0 references
computational complexity
0 references
makespan
0 references
single machine
0 references
