Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300)
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: Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates |
scientific article; zbMATH DE number 5959818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates |
scientific article; zbMATH DE number 5959818 |
Statements
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (English)
0 references
18 October 2011
0 references
non-availability constraint
0 references
single-machine
0 references
flow-time
0 references
approximation
0 references
0 references
0 references
0 references
0 references
0.8526880145072937
0 references
0.8234449028968811
0 references
0.817719042301178
0 references
0.8150683641433716
0 references
