An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960)
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: An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan |
scientific article; zbMATH DE number 5664776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan |
scientific article; zbMATH DE number 5664776 |
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
0 references
0.9042144417762756
0 references
0.8628528118133545
0 references
0.8541610240936279
0 references
0.8534085750579834
0 references
0.8483047485351562
0 references
