Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241)
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: Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion |
scientific article; zbMATH DE number 6389183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion |
scientific article; zbMATH DE number 6389183 |
Statements
Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (English)
0 references
22 January 2015
0 references
task scheduling
0 references
interval uncertainty
0 references
minmax regret
0 references
approximation algorithms
0 references
scatter search
0 references
0 references
0 references
0 references
0 references
0.8778179287910461
0 references
0.8565819263458252
0 references
0.8563589453697205
0 references
0.8476189374923706
0 references
0.8356783390045166
0 references
