Robust scheduling with budgeted uncertainty (Q2414457): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129436944, #quickstatements; #temporary_batch_1730404669386
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2702954033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust vehicle routing problem with time windows / 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: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization over Integers with Robustness in Cost and Few Constraints / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust approach to the chance-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Event-based MILP models for resource-constrained project scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Single Machine Scheduling with Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust constrained shortest path problems under budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust combinatorial optimization with variable budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust combinatorial optimization with variable cost uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and complexity analysis for robust single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust single machine scheduling problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129436944 / rank
 
Normal rank

Latest revision as of 21:00, 31 October 2024

scientific article
Language Label Description Also known as
English
Robust scheduling with budgeted uncertainty
scientific article

    Statements

    Robust scheduling with budgeted uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2019
    0 references
    approximation algorithms
    0 references
    robust optimization
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references