Online minimization of the maximum starting time: migration helps (Q6174813): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Robust online algorithms for certain dynamic packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Covering with Limited Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic bin packing revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity theorems in integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust APTAS for the classical bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Approximation Schemes for Cube Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms for preemptive scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms for total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Starting time minimization for the maximum job variant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for the min-max starting time problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the maximum starting time on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully-Dynamic Bin Packing with Little Repacking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Exploitation for Online Machine Covering with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust AFPTAS for Online Bin Packing with Polynomial Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on an open-end bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Single Machine Scheduling to Minimize the Maximum Starting Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / 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: Parameterized on-line open-end bin packing / rank
 
Normal rank

Latest revision as of 15:28, 2 August 2024

scientific article; zbMATH DE number 7729243
Language Label Description Also known as
English
Online minimization of the maximum starting time: migration helps
scientific article; zbMATH DE number 7729243

    Statements

    Online minimization of the maximum starting time: migration helps (English)
    0 references
    0 references
    0 references
    17 August 2023
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    migration factor
    0 references

    Identifiers