Resources on Scheduling

The goal of this page is to gather available resources on the web for researchers in scheduling: benchmarks, complexity results, algorithms, ...

This page is under construction and if you know of a usefull resource that could be added, please, send and email.

General results

  • Complexity results for scheduling problems (University of Osnabrück, Germany): a collection of scheduling problems and their associated complexity status.
  • The scheduling zoo (Sorbonne University, France): complexity status of some scheduling problems accessible via their scheduling notation.

    • Benchmarks

    Shop scheduling problems

  • Taillard's instances: for flowshop, jobshop and openshop problems. The associated publication is here.
  • Demirkol, Mehta and Uzsoy's instances: for jobshop problems. The associated publication is here.
  • The JSPLib: for jobshop problems. Associated publications can be directly found on the website.
  • Flexible jobshop: for flexible jobshop problems with work centers. The associated publication is here.

    • Project scheduling problems

  • The PSPLib: for various project scheduling problems. The associated publication is here.
  • RCPSP: for various project scheduling problems with renewable resources and much more. Associated publications can be directly found on the website.
  • RCPSP (ORS project database): for various project scheduling problems. Associated publications can be directly found on the website.

    • Solution algorithms