A New Approach to Online Scheduling

A Tight 2-Approximation for Preemptive Stochastic Scheduling

A note on sorting buffers offline

Algorithms and complexity for periodic real-time scheduling

Clique partitioning with value-monotone submodular cost

scholarly article by José R. Correa & Nicole Megow published February 2015 in Discrete Optimization

Decision Support and Optimization in Shutdown and Turnaround Scheduling

Dual Techniques for Scheduling on a Machine with Varying Speed

Dual Techniques for Scheduling on a Machine with Varying Speed

How to whack moles

Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints

scholarly article published 2013

Meeting Deadlines: How Much Speed Suffices?

Models and Algorithms for Stochastic Online Scheduling

scholarly article by Nicole Megow et al published August 2006 in Mathematics of Operations Research

On Eulerian extensions and their application to no-wait flowshop scheduling

On-line scheduling to minimize average completion time revisited

Online Graph Exploration: New Results on Old and New Algorithms

scholarly article by Nicole Megow et al published 2011 in Lecture Notes in Computer Science

Online graph exploration: New results on old and new algorithms

Optimal Algorithms and a PTAS for Cost-Aware Scheduling

Optimizing the landside operation of a container terminal

Packing a Knapsack of Unknown Capacity

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty

Scheduling Maintenance Jobs in Networks

Scheduling Real-Time Mixed-Criticality Jobs

article published in 2012

Scheduling Real-Time Mixed-Criticality Jobs

Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

Scheduling maintenance jobs in networks

The Online Target Date Assignment Problem

article by S. Heinz et al published 2006 in Lecture Notes in Computer Science

The Power of Migration in Online Machine Minimization

The Power of Recourse for Online MST and TSP

Universal Sequencing on a Single Machine

Universal Sequencing on an Unreliable Machine