Implement the cyclic flow shop problem with bi-machine nests (CFSAP)

[abeham]

It is a special kind of scheduling problem described by W. Bozejko.

[abeham]

r14757: Added CFSAP with optimal (polynomial) assignment algorithm

[abeham]

r15456: worked on the CFSAP

• Introduced new benchmark instances mentioned in the literature and updated the parser

[abeham]

r15460: worked on the CFSAP

• Added problem definition that defines both sequence and assignment for a single nest
• Added problem definition that would optimizes both sequence and assignment for multiple nests
• Added interface
• Added solving strategy that would use multiple instances of a template algorithm to optimize the worst nest
• Fixed bug in parser regarding setup times

[abeham]

r15472: worked on the CFSAP

• merged HeuristicLab.Problems.Instances from trunk
• updated best known qualities
• reduced memory footprint of run
• added convergence graph result to solving strategy

[abeham]

r15493: Implemeted hard-coded genetic algorithm for faster evaluation

[ddorfmei]

r15533: Improved hard-coded genetic algorithm

• implemented restart strategy
• implemented 1-Opt algorithm
• added parameters to control restart strategy and optimal assignment strategy
• additional results: best solution found after number of generations, jobs/nests (for evaluation only)

[ddorfmei]

r16045: renamed branch