Reallocation problems in scheduling (Q747625): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of minimum and maximum traveling salesman's tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Flow Time Without Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic storage allocation with limited compaction - complexity and some practical implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average stretch without migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reallocation problems in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space overhead bounds for dynamic memory management with partial compaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust train routing and online re-scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Algorithms to Minimize Resource Reallocations and Network Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Incremental Topological Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling for New Orders / 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: Q2921699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / 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: An Estimate of the Store Size Necessary for Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory and Algorithms for Combinatorial Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling to minimize makespan on a changing number of identical processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling on a single machine with part-type dependent setup times and deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load Balancing for Response Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bay Restaurant--A Linear Storage Problem / rank
 
Normal rank

Revision as of 21:46, 10 July 2024

scientific article
Language Label Description Also known as
English
Reallocation problems in scheduling
scientific article

    Statements

    Reallocation problems in scheduling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2015
    0 references
    scheduling
    0 references
    online problems
    0 references
    reallocation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers