View source: R/permutationBenchmarkFunctions.R
benchmarkGeneratorWT | R Documentation |
Creates a benchmark function for the single-machine total Weighted Tardiness Problem.
benchmarkGeneratorWT(p, w, d)
p |
processing times |
w |
weights |
d |
due dates |
the function of type cost=f(permutation)
benchmarkGeneratorQAP
, benchmarkGeneratorTSP
, benchmarkGeneratorFSP
n=6
#processing times
p <- sample(100,n,replace=TRUE)
#weights
w <- sample(10,n,replace=TRUE)
#due dates
RDD <- c(0.2, 0.4, 0.6,0.8,1.0)
TF <- c(0.2, 0.4, 0.6,0.8,1.0)
i <- 1
j <- 1
P <- sum(p)
d <- runif(n,min=P*(1-TF[i]-RDD[j]/2),max=P*(1-TF[i]+RDD[j]/2))
#create WT objective function
fun <- benchmarkGeneratorWT(p,w,d)
fun(1:n)
fun(n:1)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.