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

From MaRDI portal
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