W. Bożejko Home Page

[ Strona główna ] [ Publications ] [ Benchmarks ] [ Classes / Zajęcia ]

Benchmarks for scheduling problems

• Taillard flowshop F||Cmax for ta001 - ta120 instances Flowshop_C_max.zip

• Taillard flowshop F||Csum for ta001 - ta080 instances Flowshop_C_Sum.zip

• Taillard jobshop J||Cmax for ta01 - ta080 instances bench_js.txt

• Total weighted tardiness problem 1witi.zip

• Total weighted completion time problem (with deadlines) 1wici_di.zip

• Total weighted no-idle earliness/tardiness problem (E/T) data_et.zip,
  reference results of the Parallel Genetic Algorithm for this problem ga_best.zip

• TSP, Traveling Salesman Problem ALL_tsp.tar.gz, TSPLIB FAQ
  (from TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/)

• QAP, Quadratic Assignment Problem, selected, bench.zip
  (from QAPLIB, http://www.opt.math.tu-graz.ac.at/qaplib/)

• Single machine total weighted tardiness problem with sequence-dependent setup times and due dates
  wtsinstances.tar.tar, wtsbenchmarks.pdf