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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-019-03263-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2944472270 / rank
 
Normal rank

Revision as of 00:40, 20 March 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