An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710339121855 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048309541 / rank | |||
Normal rank | |||
Revision as of 22:44, 19 March 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
