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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine scheduling problems under scenario-based uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling around large restrictive common due windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pinpointing the complexity of the interval min-max regret knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the state-of-the-art of common due date assignment and scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under uncertainty: survey and research potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5832743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax scheduling problems with a common due-window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Scheduling with Release Dates and Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted flow time of a set of jobs with interval processing times / rank
 
Normal rank

Revision as of 11:48, 21 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
    robust optimization
    0 references
    uncertainty
    0 references
    scheduling
    0 references
    mixed integer programming
    0 references
    0 references
    0 references
    0 references

    Identifiers