Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Adaptability in Multistage Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with forbidden start times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and uncertainty sets for data-driven robust shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hard real-time scheduling for multiprocessor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing with Time Windows: Two Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-multiplicity scheduling on one machine with forbidden start and completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i>-Adaptability in Two-Stage Robust Binary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact lexicographic scheduling and approximate rescheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of machine scheduling: 15 open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time-critical scheduling via resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with forbidden sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Precedence Constrained Scheduling on Identical Machines / rank
 
Normal rank

Latest revision as of 12:36, 27 July 2024

scientific article
Language Label Description Also known as
English
Approximate and robust bounded job start scheduling for Royal Mail delivery offices
scientific article

    Statements

    Approximate and robust bounded job start scheduling for Royal Mail delivery offices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded job start scheduling
    0 references
    approximation algorithms
    0 references
    robust scheduling
    0 references
    mail deliveries
    0 references
    0 references
    0 references
    0 references