1 / 4

Session B Wrap-up Summary and Commentary

Session B Wrap-up Summary and Commentary. Roman Barták Charles University (Czech Republic) roman.bartak@mff.cuni.cz http://ktiml.mff.cuni.cz/~bartak. Summary. Three papers proposing benchmark areas Reactive scheduling Over-subscribed scheduling Real-life scheduling

lydia-gallagher
Download Presentation

Session B Wrap-up Summary and Commentary

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Session B Wrap-upSummary and Commentary Roman Barták Charles University (Czech Republic) roman.bartak@mff.cuni.czhttp://ktiml.mff.cuni.cz/~bartak

  2. Summary • Three papers proposing benchmark areas • Reactive scheduling • Over-subscribed scheduling • Real-life scheduling • Wrap-up paper on benchmarks • Two papers describing experience with other competitions • International Timetabling Competition • International Planning Competition SSC 2007, Roman Barták

  3. Other competitions • We should learn from others. • We are completely different. • Why should one run a (scheduling) competition? • compare the systems or algorithms? • bridging the gap between theory and practice? • advance the research? • drive the research? • promote the research? • just to play? • … SSC 2007, Roman Barták

  4. Benchmarks • real-life motivated vs. academic problems • going beyond classical scheduling • dynamic aspects • over-subscribed • different objectives (robustness,…) • common representation • language for covering „all“ scheduling problems • generating problem instances vs. real-life data • parameters to vary problem hardness or to vary problem type • evaluation criteria • is runtime so bad? • conclusions from the competition • any winner? SSC 2007, Roman Barták

More Related