Various strategies of Two-Phase Local Search applied to the Permutation
Flowshop Problem with Makespan and Weighted Tardiness objectives.
A data frame with 1511 observations of 4 variables:
algorithm
TPLS search strategy
Makespan
first objective values.
WeightedTardiness
second objective values.
set
indices of corresponding conditional Pareto fronts.
Source
DubLopStu2011amaimoocore
Examples
data(tpls50x20_1_MWT)
str(tpls50x20_1_MWT)
#> 'data.frame': 1511 obs. of 4 variables:
#> $ algorithm : chr "1to2" "1to2" "1to2" "1to2" ...
#> $ Makespan : num 4280 4238 4137 4024 4014 ...
#> $ WeightedTardiness: num 10231 10999 11737 14871 17825 ...
#> $ set : num 1 1 1 1 1 1 1 1 1 1 ...