The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times (Q1608433): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0898-1221(98)00099-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012916760 / rank | |||
Normal rank | |||
Latest revision as of 10:15, 30 July 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
