The Permutation Flowshop Scheduling Problem (PFSP) and the Linear Ordering Problem (LOP) are two permutation based, combinatorial optimization problems. Both problems have been implemented in HeuristicLab by Florian Holzinger in his master's Thesis (Permutationsbasierte Benchmarkprobleme) and shall now be adapted to the HeuristicLab-coding guidelines, reviewed and finally checked in.
Update: The Problems should be implemented as BasicProblems
Issue migrated from trac ticket # 2864
milestone: HeuristicLab 3.3.17 | component: Problems | priority: low | keywords: PFSP LOP
2017-12-12 09:47:42: @Vanmodeus created the issue