Name
coffmangraham — is scheduling algorithm (Coffman and Graham) for P2|prec,pj=1|Cmax problem
Synopsis
TS = COFFMANGRAHAM(T, prob)
TS = COFFMANGRAHAM(T, prob, verbose)
TS = COFFMANGRAHAM(T, prob, options)
Description
The function finds schedule of the scheduling problem 'P2|prec,pj=1|Cmax'. Meaning of the input and output parameters is summarized below:
- T
set of tasks, taskset object with precedence constrains
- prob
problem P2|prec,pj=1|Cmax
- verbose
level of verbosity 0 - no information (default); 1 - display scheduling information
- options
global scheduling toolbox variables (SCHOPTIONSSET)