A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:05, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem |
scientific article |
Statements
A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (English)
0 references
21 December 2009
0 references
scheduling
0 references
single machine
0 references
deteriorating jobs
0 references
total completion time
0 references
FPTAS
0 references
