Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241)

From MaRDI portal
Revision as of 11:09, 7 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59399011, #quickstatements; #temporary_batch_1728295585747)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
scientific article

    Statements

    Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (English)
    0 references
    0 references
    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

    Identifiers