A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5650825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem |
scientific article; zbMATH DE number 5650825 |
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
0 references
0.8611936569213867
0 references
0.8460603952407837
0 references
0.8454482555389404
0 references
0.8425969481468201
0 references
