Name
problem — creation of object problem.
Synopsis
PROB = PROBLEM(NOTATION)
PROB = PROBLEM(SPECIALPROBLEM)
Description
The function creates object (PROB) describing a scheduling problem. The input parameter - NOTATION is composed of three fields alpha|betha|gamma.
alpha - describes the processor enviroment, alpha = alpha1 and alpha2
alpha1 characterizes the type of processor used:
- nothing
single procesor
- P
identical procesors
- Q
uniform procesors
- R
unrelated procesors
- O
dedicated procesors: open shop system
- F
dedicated procesors: flow shop system
- J
dedicated procesors: job shop system
alpha2 denotes the number of processors in the problem
betha - describes task and resource characteristic:
- pmtn
preemptions are allowed
- prec
precedence constrains
- rj
ready times differ per task
- ~dj
deadlines
- in-tree
In-tree precedence constrains
- pj=x
processing time equal x (x must be non-negative number)
gamma - denotes optimality criterion Cmax, sumCj, sumwCj, Lmax, sumDj, sumUj
Special scheduling problems (not covered by the notation) can be described by a string SPECIALPROBLEM. Permitted strings are: 'SPNTL' and 'CSCH';