A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312)
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: A unified approach for scheduling with convex resource consumption functions using positional penalties |
scientific article; zbMATH DE number 5720320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified approach for scheduling with convex resource consumption functions using positional penalties |
scientific article; zbMATH DE number 5720320 |
Statements
A unified approach for scheduling with convex resource consumption functions using positional penalties (English)
0 references
11 June 2010
0 references
single machine scheduling
0 references
controllable processing times
0 references
resource allocation
0 references
due date assignment
0 references
positional penalties
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8255645632743835
0 references
0.8242067098617554
0 references
0.8174790143966675
0 references
0.8138918280601501
0 references
0.8119104504585266
0 references
