The Scheduling Zoo is 20 years old!
interface :
$\textrm{simple}$
$\textrm{advanced}$
Machine environment $\alpha$
type :
$1$
$P$
$Q$
$R$
$O$
$F$
$J$
number of machines :
Ø
$2$
$3$
$4$
$5$
$\infty$
robot :
Ø
$R1$
server :
Ø
$S1$
Constraints $\beta$
number of jobs :
Ø
$n=2$
$n=3$
$n=k$
$n\geq m-1$
precedence relation :
Ø
$\textrm{prec}$
$\textrm{chains}$
$\textrm{tree}$
$\textrm{intree}$
$\textrm{outtree}$
$\textrm{opposing forest}$
$\textrm{sp-graph}$
$\textrm{bounded height}$
$\textrm{level order}$
$\textrm{interval order}$
$\textrm{quasi-interval order}$
$\textrm{over-interval order}$
$\textrm{Am-order}$
$\textrm{DC-graph}$
$2\textrm{-dim partial order}$
$\textrm{k-dim partial order}$
time lags :
Ø
$l=1$
$l$
$l\leq0$
$l>0$
$l_{ij}$
$l_{ij}\leq0$
$l_{ij}>0$
communication delay :
Ø
$c=1$
$c$
transportation delays :
Ø
$t_{jk}$
$t_{\textrm{jkl}}$
$t_k$
$t_{kl}$
$t_j$
$t_j\in\{T_1,T_2\}$
$t_{\textrm{jkl}}=T$
$t_{jk}=T$
$t_{\textrm{jkl}}=t_{\textrm{jlk}}$
$t_{kl}=t_{lk}$
release time :
Ø
$r_j$
$\textrm{online-r}_j$
preemption :
Ø
$\textrm{pmtn}$
$\textrm{restarts}$
due date :
Ø
$d_j=d$
$d_j\leq r_j+2$
$d_j\leq r_j+3$
$d_j\leq r_j+4$
deadline :
Ø
$\bar d_j=\bar d$
$\bar d_j$
recirculation :
Ø
$\textrm{rcrc}$
no-wait :
Ø
$\textrm{no-wait}$
no-idle :
Ø
$\textrm{no-idle}$
processing times :
Ø
$p_j=1$
$p_j\in\{1,2\}$
$p_j=p$
$p_{ij}=p$
$p_{ij}=1$
$p_{ij}\in\{p_j,\infty\}$
$p_{kj}=p_j$
batching :
Ø
$\textrm{s-batch}$
$\textrm{s-batch}(\infty)$
$\textrm{s-batch}(b)$
$\textrm{p-batch}$
$\textrm{p-batch}(\infty)$
job size :
Ø
$\textrm{size}_j$
$\textrm{size}_j\in\{1,m\}$
machine sets :
Ø
$\textrm{fix}_j$
$M_j$
setup times :
Ø
$s_j=1$
$s_{ij}=1$
$s_j=s$
$s_{ij}=s$
rejection cost :
Ø
$e_j$
$\sum_{j \in \textrm{reject}} e_j \leq B$
Objective function $\gamma$
Objective function :
$C_{\max}$
$C_{\min}$
$\sum C_j$
$\sum w_jC_j$
$F_{\max}$
$\sum F_j$
$\sum w_jF_j$
$\max w_jF_j$
$L_{\max}$
$\sum (1-U_j)$
$\sum w_j(1-U_j)$
$\sum T_j$
$\sum w_jT_j$
Parameterized complexity
maximal processing times :
Ø
$\#p$
$p_{\max}$
number of kinds of machines :
Ø
$\#\textrm{kind}$
treewidth :
Ø
$tw$
pathwidth :
Ø
$pw(I)$
slack :
Ø
$\textrm{slack}_{\max}$
bounded number of machines :
Ø
$m$
different release dates :
Ø
$\#r$
different due dates :
Ø
$\#d$
different weights :
Ø
$\#w$
$w_{\max}$
accepted jobs :
Ø
$\#\textrm{accept}$
maximal rejection cost :
Ø
$\#e$
$e_{\max}$
rank of processing time matrix :
Ø
$\textrm{rank}((p_{ij}))$
notation
|
about