The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times (Q1608433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times |
scientific article; zbMATH DE number 1776631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times |
scientific article; zbMATH DE number 1776631 |
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
0.9113735
0 references
0 references
0.87821525
0 references
0.87789357
0 references
0.87732553
0 references
0.87673616
0 references
0.8757649
0 references
0.8742007
0 references
