Advanced search

Authors whose works are in public domain in at least one jurisdiction

List of works by Nicole Megow

1-35 of 35 results

View this query on the Wikidata Query Service
Universal Sequencing on an Unreliable Machine

Optimizing the landside operation of a container terminal

A note on sorting buffers offline

Models and Algorithms for Stochastic Online Scheduling

scholarly article by Nicole Megow et al published August 2006 in Mathematics of Operations Research
Scheduling Real-Time Mixed-Criticality Jobs

article published in 2012
The Power of Migration in Online Machine Minimization

Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

On-line scheduling to minimize average completion time revisited

A Tight 2-Approximation for Preemptive Stochastic Scheduling

Packing a Knapsack of Unknown Capacity

Scheduling maintenance jobs in networks

Universal Sequencing on a Single Machine

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

scholarly article published 2013
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

Dual Techniques for Scheduling on a Machine with Varying Speed

How to whack moles

Clique partitioning with value-monotone submodular cost

scholarly article by José R. Correa & Nicole Megow published February 2015 in Discrete Optimization
Algorithms and complexity for periodic real-time scheduling

Optimal Algorithms and a PTAS for Cost-Aware Scheduling

A New Approach to Online Scheduling

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
On Solution Discovery via Reconfiguration

Scheduling Real-Time Mixed-Criticality Jobs

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

Online graph exploration: New results on old and new algorithms

Dual Techniques for Scheduling on a Machine with Varying Speed

Meeting Deadlines: How Much Speed Suffices?

Scheduling Maintenance Jobs in Networks

Q57399725

Special Issue:APPROX-RANDOM 2015 Guest Editors' Foreword
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks

The Online Target Date Assignment Problem

article by S. Heinz et al published 2006 in Lecture Notes in Computer Science
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty

The Power of Recourse for Online MST and TSP

Decision Support and Optimization in Shutdown and Turnaround Scheduling

Paulina is supported by:

About Paulina

Help