The base instances as regards jobs and machines are based on "instances for unrelated parallel machines problems and makespan criterion" here we only give the best known solutions in an excel file which is available here (Excel 2007 format).

We used these instances in the following paper:

• L. Fanjul-Peyro, R. Ruiz (2011). Scheduling unrelated parallel machines with optional machines and jobs selection. DEIOAC-2011-01

Instances used in the Ph.D. thesis of Alejandro Rodríguez Villalobos, named "Study of the effect of asymmetry in vehicle routing problems", can be downloaded here:

•  
• 
• case TSP (606 MB)
• 450 location files, for different number of nodes on several territories.
• 2250 distance matrix files (orthodromic, real asymmetric and others).
•  
• » explanation of the TSP files format here.
•  
•  

• case CVRP (712 MB)
• 1350 location files, for different number of nodes on several territories and depot locations.
• 2700 distance matrix files (orthodromic and real asymmetric).
• 900 demand and max.capacity files.
•  
• » explanation of the CVRP files format here.
•  

Note: The files were tested 100% ok in their extraction with several software. You can to extract the files with: 7-Zip (Windows), IZArc (Windows), Unarchiver (Mac OS X) or other software compatible with 7z compress format. For more information, please contact.

Related papers and publications.

Rodríguez, Alejandro & Ruiz, Rubén (2010). Estudio de la relación entre la asimetría de las redes de transporte por carretera, el territorio y la localización. En  de  Basurto  Uraga, Pablo  Díaz,  Carrasco, Ernesto  Cilleruelo,  Laburu, Carlos  Ochoa,  de  Arbulo  López, Patxi  Ruiz,  Bilbao, Enara  Zarrabeitia,  Meaza, Izaskun  Alvarez et al (editores), 4th   International   Conference   on   Industrial   Engineering   and   Industrial  Management.  XIV  Congreso  Ingeniería  de  Organización, páginas 1100-1109. Alameda  Urquijo  s/n, 48013  Bilbao   : Departamento  de  Organización  de  Empresas, Universidad  . [Más] [Versión digital]

Katragjini, Kostanca, Ruiz, Rubén & Rodríguez, Alejandro (2010). Using real world distances in logistics management. En de Basurto Uraga, Pablo Díaz, Carrasco, Ernesto Cilleruelo, Laburu, Carlos Ochoa, de Arbulo López, Patxi Ruiz, Bilbao, Enara Zarrabeitia, Meaza, Izaskun Alvarez et al (editores), 4th International Conference on Industrial Engineering and Industrial Management. XIV Congreso Ingeniería de Organización, páginas 1166-1176. Alameda Urquijo s/n, 48013 Bilbao : Departamento de Organización de Empresas, Universidad. [Más] [Versión digital] 

•  
•  Instances for the multi-objective permutation flowshop problem with sequence dependent setups ara available here.
•  
• The results of the "Design-of-Experiment" (DoE) phase can be downloaded here.
•  
• Te results of the experiments for makespan-total flowtime and makespan total weighted tardines are available here.
•  
• Here there is a collection of images representing empirical attainment functions (EAFs) and differential empirical attainment functions (Diff-EAFs) for both (makespan - total flowtime) and (makespan - total weighted tardiness) objective pairs
•  
• Finally here can be found a 47 pages PDF file containing all the tables and figures for the ANOVA as well as Friedman rank-based experiments.  

Large and small instances, both for calibration and for final tests, can be downloaded here.

The instances are used in the Ph.D. thesis of Thijs Urlings, named "Heuristics and metaheuristics for heavily constrained hybrid flowshop problems", that is currently under evaluation.

These instances extend the regular flowshop instances with multiple factories

There is a set of 420 small instances and a set of 720 larger instances. There are also two small sets (small and large) of test instances for calibration. All instances are here (7z compressed file, use 7Zip freeware program to open it). The best known solutions are here.

These instances have been used in this technical report:

The instances are divided into 7 groups of 200 instances each, totaling 1,400 instances.

All instances with the best solutions known are here (large 47Mb file, use 7Zip freeware program to open it). The best known solutions have been obtained with CPLEX 11.1 with 2 hours running time on a Core 2 Duo 2.4 GHz computer.

These problems are hybrid flowshops with identical parallel machines per stage where job stage skipping is allowed. Furthermore, stage and job sequence dependent setup times are present.

You can find all instances here (20,3 Mbyte file, use 7Zip freeware program to open it).

We used these instances in the following paper:

Full set of instances (including test instances) here (7z compressed file, use 7Zip freeware program to open it). The best known solutions are here.

These instances have been used in the following technical report.

Large and small instances here (HUGE 425Mb file!, use 7Zip freeware program to open it). Test instances for calibration experiments are here. The best known solutions so far are here.

We used these instances in the following paper:

• E. Vallada, R. Ruiz (2009). Genetic algorithms for the unrelated parallel machine scheduling problem with sequence dependent setup times. DEIOAC-2009-04

Large and small instances, along with best solutions here (large 78 Mb file!, use 7Zip freeware program to open it).

 We have used these instances in the following paper:

The instances (weighted makespan and maximum lateness, with different weights) can be downloaded here.

We provide also the best solutions for those instances that were actually used in the paper (U[1,00] and m≥3) here.

 We used these instances in the following paper:

These problems contain many constraints.

The complete set of instances is incredibly large. This set contains no less than 9,216 small instances and 3,072 large instances. It was used in the following paper:

• R. Ruiz, F. Sivrikaya Şerifoğlu and T. Urlings, (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research 35, 1151-1175.

 If you want the complete set of instances (about 1.52 Gigabytes!!) open up an FTP account or some shared storage and drop us an email. Alternatively, we can send you a DVD disc if you provide us with a full mailing address.

A subset of these instances (576 small instances and 192 large instances) is here (12,1 Mbyte file, use 7Zip freeware program to open it). A list of best known solution values for the small and the large instancesis available as well.

We used these latter instances in the following papers:

• T. Urlings, R. Ruiz and T. Stützle, (2010), Shifting representation search for hybrid flexible flowline problems, European Journal of Operational Research 207, 1086-1095.
  

• T. Urlings, R. Ruiz and F. Sivrikaya Şerifoğlu, (2010), Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems, International Journal of Metaheuristics 1, 30-54.

You can download the instances here (use 7Zip freeware program to open it).

More or less, these instances are those of Taillard's with the addition of due dates. 

 We have used these instances in the following paper:

You can download the instances here (28.5 Mb file!, use 7Zip freeware program to open it).

Basically, we use extended the instances described above for the flowshop with setup times with due dates, so there are also 4 groups of instances with 120 problems each (480 total). 

 We have used these instances in the following paper:

We used these instances in the following papers:

The best known solutions (maximum lateness criterion) can be obtained from this small excel file.

We used these instances in the following paper:

There is a set of 3,000 small instances available here.

The set of 2,400 large instances can be downloaded from here (19.5 Mbyte file). 

The best known solutions (total completion time criterion) for the 5,400 instances can be obtained from this small excel file.

 We used these instances in the following paper:

The sets of instances, along with the best known solutions are available here (22 Mb file!, use 7Zip freeware program to open it)

There are two sets of instances, with 3,600 instances each (7,200 total).  

 We used these instances in the following paper: 

You can download the instances here (28.6 Mb file!, use 7Zip freeware program to open it).

Basically, we use the well known code of Taillard to "extend" Taillard's intances with setup times. 

There are four sets of instances with 120 instances each (480 instances in total):

 SET 1 (SDST10): Setup times are uniformly distributed between 1 and 9 (10% of the processing times)

 SET 2 (SDST50): Setup times are uniformly distributed between 1 and 49 (50% of the processing times)

 SET 3 (SDST100): Setup times are uniformly distributed between 1 and 99 (100% of the processing times)

 SET 4 (SDST125): Setup times are uniformly distributed between 1 and 124 (125% of the processing times)

The best known solutions for the instances are here (small .xls file)

 We have used these instances in the following papers: