Reallocation problems in scheduling
From MaRDI portal
Publication:747625
DOI10.1007/s00453-014-9930-4zbMath1322.68029arXiv1305.6555OpenAlexW2038585212MaRDI QIDQ747625
Seth Gilbert, Jeremy T. Fineman, Sándor P. Fekete, Michael A. Bender, Martín Farach-Colton
Publication date: 19 October 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.6555
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
Robust reoptimization of Steiner trees ⋮ Dynamic Windows Scheduling with Reallocation ⋮ Unnamed Item ⋮ A theory and algorithms for combinatorial reoptimization ⋮ Station assignment with reallocation ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ Reallocation problems in scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reoptimizing the 0-1 knapsack problem
- Reallocation problems in scheduling
- Reoptimization of minimum and maximum traveling salesman's tours
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Robust discrete optimization and its applications
- Rescheduling on a single machine with part-type dependent setup times and deadlines
- Average stretch without migration
- A Theory and Algorithms for Combinatorial Reoptimization
- Robust train routing and online re-scheduling
- Minimizing the Flow Time Without Migration
- Online Scheduling with Bounded Migration
- Faster Algorithms for Incremental Topological Ordering
- Online Algorithms to Minimize Resource Reallocations and Network Communication
- Rescheduling for New Orders
- Rescheduling to minimize makespan on a changing number of identical processors
- Reoptimizing the traveling salesman problem
- The Bay Restaurant--A Linear Storage Problem
- Robust Optimization of Large-Scale Systems
- Tight Bounds for Dynamic Storage Allocation
- Load Balancing for Response Time
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
- Space overhead bounds for dynamic memory management with partial compaction
- An Estimate of the Store Size Necessary for Dynamic Storage Allocation
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: Reallocation problems in scheduling
