benchmarkGeneratorFSP: Create Flow shop Scheduling Problem (FSP) Benchmark

Description Usage Arguments Value See Also Examples

View source: R/permutationBenchmarkFunctions.R

Description

Creates a benchmark function for the Flow shop Scheduling Problem.

Usage

1

Arguments

a

matrix of processing times for each step and each machine

n

number of jobs

m

number of machines

Value

the function of type cost=f(permutation)

See Also

benchmarkGeneratorQAP, benchmarkGeneratorTSP, benchmarkGeneratorWT

Examples

1
2
3
4
5
6
7
8
9
n=10
m=4
#ceate a matrix of processing times
A <- matrix(sample(n*m,replace=TRUE),n,m) 
#create FSP objective function 
fun <- benchmarkGeneratorFSP(A,n,m)
#evaluate
fun(1:n)
fun(n:1)

CEGO documentation built on May 14, 2021, 1:08 a.m.