All Stories

  1. On index policies for stochastic minsum scheduling

    Article • Operations Research Letters, May 2019, Elsevier

    Professor Nicole Megow

  2. A General Framework for Handling Commitment in Online Throughput Maximization

    Article • January 2019, Springer Science + Business Media

    Professor Nicole Megow

  3. Scheduling maintenance jobs in networks

    Article • Theoretical Computer Science, February 2018, Elsevier

    Professor Nicole Megow

  4. Dual Techniques for Scheduling on a Machine with Varying Speed

    Article • SIAM Journal on Discrete Mathematics, January 2018, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

  5. An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization

    Article • SIAM Journal on Computing, January 2018, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

  6. Packing a Knapsack of Unknown Capacity

    Article • SIAM Journal on Discrete Mathematics, January 2017, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

  7. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty

    Article • SIAM Journal on Computing, January 2017, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

  8. Scheduling Maintenance Jobs in Networks

    Article • January 2017, Springer Science + Business Media

    Professor Nicole Megow

  9. A New Approach to Online Scheduling

    Article • ACM Transactions on Algorithms, December 2016, ACM (Association for Computing Machinery)

    Professor Nicole Megow

  10. Article • Theory of Computing, January 2016, Theory of Computing Exchange

    Professor Nicole Megow

  11. The Power of Migration in Online Machine Minimization

    Article • January 2016, ACM (Association for Computing Machinery)

    Professor Nicole Megow

  12. An ℴ (log m )-Competitive Algorithm for Online Machine Minimization

    Article • December 2015, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

  13. Clique partitioning with value-monotone submodular cost

    Article • Discrete Optimization, February 2015, Elsevier

    Professor Nicole Megow

  14. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty

    Article • January 2015, Springer Science + Business Media

    Professor Nicole Megow

  15. Universal Sequencing on an Unreliable Machine

    Article • January 2015, Springer Science + Business Media

    Professor Nicole Megow

  16. Optimal Algorithms and a PTAS for Cost-Aware Scheduling

    Article • January 2015, Springer Science + Business Media

    Professor Nicole Megow

  17. Robustness and Approximation for Universal Sequencing

    Article • January 2015, Springer Science + Business Media

    Professor Nicole Megow

  18. A Tight 2-Approximation for Preemptive Stochastic Scheduling

    Article • Mathematics of Operations Research, November 2014, INFORMS

    Professor Nicole Megow

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

    Article • December 2013, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Nicole Megow

  20. A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio

    Article • January 2013, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

  21. Dual Techniques for Scheduling on a Machine with Varying Speed

    Article • January 2013, Springer Science + Business Media

    Professor Nicole Megow

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

    Article • January 2013, ACM (Association for Computing Machinery)

    Professor Nicole Megow

  23. Keller oder Dach zuerst?

    Article • December 2012, Springer Science + Business Media

    Professor Nicole Megow

  24. Online graph exploration: New results on old and new algorithms

    Article • Theoretical Computer Science, December 2012, Elsevier

    Professor Nicole Megow

  25. Algorithms and complexity for periodic real-time scheduling

    Article • ACM Transactions on Algorithms, December 2012, ACM (Association for Computing Machinery)

    Professor Nicole Megow

  26. Scheduling Real-Time Mixed-Criticality Jobs

    Article • IEEE Transactions on Computers, August 2012, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Nicole Megow

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

    Article • Journal of Combinatorial Optimization, May 2012, Springer Science + Business Media

    Professor Nicole Megow

  28. A note on sorting buffers offline

    Article • Theoretical Computer Science, March 2012, Elsevier

    Professor Nicole Megow

  29. The Power of Recourse for Online MST and TSP

    Article • January 2012, Springer Science + Business Media

    Professor Nicole Megow

  30. Universal Sequencing on an Unreliable Machine

    Article • SIAM Journal on Computing, January 2012, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

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

    Article • Journal of Scheduling, July 2011, Springer Science + Business Media

    Professor Nicole Megow

  32. Decision Support and Optimization in Shutdown and Turnaround Scheduling

    Article • INFORMS Journal on Computing, May 2011, INFORMS

    Professor Nicole Megow

  33. Meeting Deadlines: How Much Speed Suffices?

    Article • January 2011, Springer Science + Business Media

    Professor Nicole Megow

  34. Online Graph Exploration: New Results on Old and New Algorithms

    Article • January 2011, Springer Science + Business Media

    Professor Nicole Megow

  35. Algorithms and Complexity for Periodic Real-Time Scheduling

    Article • January 2010, Society for Industrial & Applied Mathematics (SIAM)

    Professor Nicole Megow

  36. Scheduling Real-Time Mixed-Criticality Jobs

    Article • January 2010, Springer Science + Business Media

    Professor Nicole Megow

  37. Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

    Article • January 2010, Springer Science + Business Media

    Professor Nicole Megow

  38. Universal Sequencing on a Single Machine

    Article • January 2010, Springer Science + Business Media

    Professor Nicole Megow

  39. Keller oder Dach zuerst?

    Article • January 2010, Springer Science + Business Media

    Professor Nicole Megow

  40. Optimizing the landside operation of a container terminal

    Article • OR Spectrum, August 2007, Springer Science + Business Media

    Professor Nicole Megow

  41. How to whack moles

    Article • Theoretical Computer Science, September 2006, Elsevier

    Professor Nicole Megow

  42. Models and Algorithms for Stochastic Online Scheduling

    Article • Mathematics of Operations Research, August 2006, INFORMS

    Professor Nicole Megow

  43. Approximation in Preemptive Stochastic Online Scheduling

    Article • January 2006, Springer Science + Business Media

    Professor Nicole Megow

  44. The Online Target Date Assignment Problem

    Article • January 2006, Springer Science + Business Media

    Professor Nicole Megow

  45. Stochastic Online Scheduling on Parallel Machines

    Article • January 2005, Springer Science + Business Media

    Professor Nicole Megow

  46. On-line scheduling to minimize average completion time revisited

    Article • Operations Research Letters, September 2004, Elsevier

    Professor Nicole Megow

  47. How to Whack Moles

    Article • January 2004, Springer Science + Business Media

    Professor Nicole Megow

  48. Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms

    Article • January 2004, Springer Science + Business Media

    Professor Nicole Megow

  49. Scheduling to Minimize Average Completion Time Revisited: Deterministic On-line Algorithms

    Article • SSRN Electronic Journal, January 2003, Elsevier

    Professor Nicole Megow

  50. Coping with Incomplete Information in Scheduling — Stochastic and Online Models

    Article • Springer Science + Business Media

    Professor Nicole Megow