The following pages link to Nicole Megow (Q417996):
Displaying 50 items.
- A note on sorting buffers offline (Q417998) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Scheduling maintenance jobs in networks (Q1628599) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Speed-robust scheduling. Sand, bricks, and rocks (Q2061889) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Correction to: approximation and online algorithms (Q2193096) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
- On index policies for stochastic minsum scheduling (Q2294301) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Optimizing the landside operation of a container terminal (Q2480802) (← links)
- How to whack moles (Q2503357) (← links)
- Speed-robust scheduling: sand, bricks, and rocks (Q2689830) (← links)
- Decision support and optimization in shutdown and turnaround scheduling (Q2899113) (← links)
- Universal sequencing on an unreliable machine (Q2910853) (← links)
- Algorithms and complexity for periodic real-time scheduling (Q2933634) (← links)
- Optimal Algorithms and a PTAS for Cost-Aware Scheduling (Q2946391) (← links)
- Packing a Knapsack of Unknown Capacity (Q2965490) (← links)
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (Q2986896) (← links)
- Online Graph Exploration: New Results on Old and New Algorithms (Q3012942) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q3452848) (← links)
- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width (Q3558924) (← links)
- Universal Sequencing on a Single Machine (Q3569821) (← links)
- Scheduling Real-Time Mixed-Criticality Jobs (Q3586075) (← links)
- An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization (Q4561244) (← links)
- An <i>ℴ</i>(log <i>m</i>)-Competitive Algorithm for Online Machine Minimization (Q4575587) (← links)
- (Q4580177) (← links)
- A New Approach to Online Scheduling (Q4962651) (← links)
- Scheduling with explorable uncertainty (Q4993294) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- Scheduling Real-Time Mixed-Criticality Jobs (Q5274656) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q5283242) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q5326607) (← links)
- (Q5351897) (← links)
- Models and Algorithms for Stochastic Online Scheduling (Q5387994) (← links)
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models (Q5391870) (← links)
- (Q5417713) (← links)
- Approximation in Preemptive Stochastic Online Scheduling (Q5449555) (← links)
- Approximation and Online Algorithms (Q5713435) (← links)
- A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio (Q5741717) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- Optimally Handling Commitment Issues in Online Throughput Maximization (Q5874511) (← links)
- The power of recourse for online MST and TSP (Q5890825) (← links)
- The Power of Recourse for Online MST and TSP (Q5891122) (← links)
