A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795)
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 5324086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion |
scientific article; zbMATH DE number 5324086 |
Statements
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (English)
0 references
10 September 2008
0 references
scheduling
0 references
interval data
0 references
minmax regret
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0.8565819263458252
0 references
0.8527942299842834
0 references
0.8437238931655884
0 references
0.8347009420394897
0 references
