Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127889529, #quickstatements; #temporary_batch_1722280142910
 
Property / Wikidata QID
 
Property / Wikidata QID: Q127889529 / rank
 
Normal rank

Latest revision as of 21:17, 29 July 2024

scientific article
Language Label Description Also known as
English
Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
scientific article

    Statements

    Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (English)
    0 references
    0 references
    0 references
    20 January 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    robust optimization
    0 references
    uncertainty
    0 references
    scheduling
    0 references
    mixed integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references