An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:29, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan |
scientific article |
Statements
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (English)
0 references
29 January 2010
0 references
machine scheduling
0 references
start time-dependent processing times
0 references
makespan
0 references
approximation algorithms
0 references
