Fast heuristics for minimizing the makespan in non-permutation flow shops

This repository contains detailed results and code for the paper Fast heuristics for minimizing the makespan in non-permutation flow shops.

Detailed results

1. Best known values used in relative deviations.
2. Performance of variants of the constructive BR heuristic in Table 6.
3. Performance of constructive heuristics on the instances of Taillard in Table 7.
4. Performance of constructive heuristics on all instances in Table 8: VRF-small, VRF-large.
5. Performance of permutation IG heuristics on the instances of Taillard in Table 9.
6. Performance of the non-permutation IG heuristics on the instances of Taillard in Table 10.
7. Comparison of state-of-the-art methods for the permutation and non-permutation FSSP on the instances of Taillard in Table 12: contained in data files of items 5 and 6.
8. Comparison of state-of-the-art methods for the permutation and non-permutation FSSP on all instances in Table 13: additionally to above tables for the non-permutation flow shop VRF-small, VRF-large, and for the non-permutation flow shop VRF-small, VRF-large.
9. Number of iterations in Table 14: see time and number of iterations in the above data files.

Code

The code is contained in the single file pnpFSSP.cpp. To compile use

g++ -O2 --static --fast-math -std=c++17 -DNDEBUG pnpFSSP.cpp -o pnpFSSP

How to cite

@Article{Benavides.Ritt/2018,
  author = 	 {Alexander Benavides and Marcus Ritt},
  title = 	 {Fast heuristics for minimizing the makespan in non-permutation flow shops},
  journal =	 "Comp. Oper. Res.",
  year = 	 {2018},
  volume =	 {100},
  pages =	 {230--243},
  month =	 dec,
  doi = 	 {10.1016/j.cor.2018.07.017}
}