This directory contains the following files with results of a tabu search algorithm for the flow-shop problem with intermediate buffers:

The used test sets are benchmark instances for the flow-shop problem proposed by Taillard [1993], where four different types of buffer configurations were added:

Test Instances:

  • taillard_b0.tgz: Taillard instances (ta001-ta080) with buffer size b_i=0
  • taillard_b1.tgz: Taillard instances (ta001-ta080) with buffer size b_i=1
  • taillard_b2.tgz: Taillard instances (ta001-ta080) with buffer size b_i=2
  • taillard_bn.tgz: Taillard instances (ta001-ta080) with buffer size b_i=n

  • taillard.c: C-Program to generate all test instances
  • taillard2.txt: Lower and upper bounds for the taillard benchmark instances

    Results of the tabu search algorithm published in Brucker, Heitmann, Hurink [2002]:

  • start.dat: Start values for the makespan of the tabu search procedure for the taillard instances with different buffer capacities
  • best.dat: Best makespans found by the tabu search procedure over all test runs for a given buffer capacity

  • Re1It5.dat: CPU-times and best makespans found by the tabu search (500 iterations, 1 restart)
  • Re3It5.dat: CPU-times and best makespans found by the tabu search (500 iterations, 3 restarts)
  • Re5It5.dat: CPU-times and best makespans found by the tabu search (500 iterations, 5 restarts)
  • Re1It10.dat: CPU-times and best makespans found by the tabu search (1000 iterations, 1 restart)
  • Re3It10.dat: CPU-times and best makespans found by the tabu search (1000 iterations, 3 restarts)
  • Re5It10.dat: CPU-times and best makespans found by the tabu search (1000 iterations, 5 restarts)
  • Re1It30.dat: CPU-times and best makespans found by the tabu search (3000 iterations, 1 restart)
  • Re3It30.dat: CPU-times and best makespans found by the tabu search (3000 iterations, 3 restarts)
  • Re1It100.dat: CPU-times and best makespans found by the tabu search (10000 iterations, 1 restart)

    Literature:

     Brucker, Heitmann, Hurink [2003]:
    Flow-Shop Problems with Intermediate Buffers,
    OR Spectrum 25, 549 - 574 (2003); DOI: 10.1007/s00291-003-0133-7.

    Taillard [1993]:
    Benchmarks for basic scheduling problems,
    European Journal of Operational Research 64, 278-285.