748
правок
Изменения
Новая страница: «== 1 Общая теория == # Классификация задач # Методы решения задач теории расписаний # [[П...»
== 1 Общая теория ==
# [[Классификация задач]]
# [[Методы решения задач теории расписаний]]
# [[Правило Лаулера]]
== 2 Задачи с одним станком ==
# [[1sumu|<tex>1 \mid \mid \sum U_{i}</tex>]]
# [[1sumwu|<tex> 1 \mid\mid \sum w_i U_i </tex>]]
# [[1sumwT|<tex> 1 \mid\mid \sum w_i T_i </tex>]]
# [[1p1sumu|<tex>1 \mid p_{i} = 1 \mid \sum U_{i}</tex>]]
# [[1ridipi1|<tex>1 \mid r_{i}, d_{i}, p_{i} = 1 \mid -</tex>]]
# [[1pi1sumwu|<tex>1 \mid p_{i} = 1 \mid \sum w_{i}U_{i}</tex>]]
# [[1ripi1sumwc|<tex>1 \mid r_{i}, p_i=1\mid \sum w_{i}C_{i}</tex>]]
# [[1ripi1sumf|<tex>1 \mid r_i, p_i = 1 \mid \sum f_i</tex>]]
# [[1ripipsumwu|<tex> 1 \mid r_i,p_i=p \mid \sum w_i U_i</tex>]]
# [[1ripippmtnsumwu| <tex> 1 \mid r_i,p_i=p, pmtn \mid \sum w_i U_i</tex>]]
# [[1ripmtnsumwu|<tex>1 \mid r_i, pmtn \mid \sum w_{i}U_{i}</tex>]]
# [[1outtreesumwc | <tex>1 \mid outtree \mid \sum w_i C_i</tex>]]
# [[1precpmtnrifmax|<tex>1 \mid prec, pmtn, r_i \mid f_{\max}</tex>]]
# [[1precripi1Lmax|<tex>1 \mid prec; r_i; p_i = 1 \mid L_{max}</tex>]]
== 3 Специальные случаи задач для двух станков ==
# [[P2precpi1Lmax|<tex>P2 \mid prec, p_i = 1 \mid L_{\max}</tex>]]
# [[R2Cmax|<tex>R2 \mid \mid C_{max}</tex>]]
# [[F2Cmax|<tex>F2 \mid \mid C_{max}</tex>]]
# [[O2Cmax|<tex>O2 \mid \mid C_{max}</tex>]]
# [[J2ni2Cmax|<tex>J2 \mid n_{i} \leqslant 2 \mid C_{max}</tex>]]
# [[J2pij1Lmax| <tex>J2\mid p_{ij} = 1\mid L_{max}</tex>]]
== 4 Задачи для произвольного числа станков ==
# [[Flow shop]]
# [[Fpij1sumwu|<tex>F \mid p_{ij} = 1 \mid \sum w_i U_i</tex>]]
# [[PSumCi|<tex>P \mid \mid \sum C_{i}</tex>]]
# [[Pintreepi1Lmax|<tex>P \mid intree, p_{i} = 1 \mid L_{max}</tex>]]
# [[PpmtnriLmax|<tex>P \mid pmtn, r_i \mid L_{max}</tex>]]
# [[Ppi1sumwu|<tex>P \mid p_i=1 \mid \sum w_i U_i</tex>]]
# [[Ppi1riintegerLmax|<tex>P \mid p_i=1; r_i - integer \mid L_{max}</tex>]]
# [[RSumCi|<tex>R \mid \mid \sum C_i</tex>]]
# [[RpmtnCmax|<tex>R \mid pmtn \mid C_{max}</tex>]]
# [[QpmtnCmax|<tex>Q \mid pmtn \mid C_{max}</tex>]]
# [[QpmtnSumCi|<tex> Q \mid pmtn \mid \sum C_i </tex>]]
# [[QpmtnriLmax|<tex>Q \mid pmtn, r_{i} \mid L_{max}</tex>]]
# [[QSumCi|<tex>Q\mid\mid\sum{C_i}</tex>]]
# [[Opi1sumu|<tex>O \mid p_{ij} = 1 \mid \sum U_i</tex>]]
# [[Opij1di|<tex>O \mid p_{ij} = 1, d_i \mid - </tex>]]
# [[Opij1sumwu|<tex> O \mid p_{i,j} = 1 \mid \sum w_{i} U_{i} </tex>]]
# [[Opij1SumTi|<tex> O \mid p_{i,j} = 1 \mid \sum T_{i} </tex>]]
# [[Opij1Cmax|<tex> O \mid p_{ij} = 1 \mid C_{max} </tex>]]
# [[Opij1Sumwc|<tex> O \mid p_{ij} = 1 \mid \sum w_i C_i </tex>]]
# [[Классификация задач]]
# [[Методы решения задач теории расписаний]]
# [[Правило Лаулера]]
== 2 Задачи с одним станком ==
# [[1sumu|<tex>1 \mid \mid \sum U_{i}</tex>]]
# [[1sumwu|<tex> 1 \mid\mid \sum w_i U_i </tex>]]
# [[1sumwT|<tex> 1 \mid\mid \sum w_i T_i </tex>]]
# [[1p1sumu|<tex>1 \mid p_{i} = 1 \mid \sum U_{i}</tex>]]
# [[1ridipi1|<tex>1 \mid r_{i}, d_{i}, p_{i} = 1 \mid -</tex>]]
# [[1pi1sumwu|<tex>1 \mid p_{i} = 1 \mid \sum w_{i}U_{i}</tex>]]
# [[1ripi1sumwc|<tex>1 \mid r_{i}, p_i=1\mid \sum w_{i}C_{i}</tex>]]
# [[1ripi1sumf|<tex>1 \mid r_i, p_i = 1 \mid \sum f_i</tex>]]
# [[1ripipsumwu|<tex> 1 \mid r_i,p_i=p \mid \sum w_i U_i</tex>]]
# [[1ripippmtnsumwu| <tex> 1 \mid r_i,p_i=p, pmtn \mid \sum w_i U_i</tex>]]
# [[1ripmtnsumwu|<tex>1 \mid r_i, pmtn \mid \sum w_{i}U_{i}</tex>]]
# [[1outtreesumwc | <tex>1 \mid outtree \mid \sum w_i C_i</tex>]]
# [[1precpmtnrifmax|<tex>1 \mid prec, pmtn, r_i \mid f_{\max}</tex>]]
# [[1precripi1Lmax|<tex>1 \mid prec; r_i; p_i = 1 \mid L_{max}</tex>]]
== 3 Специальные случаи задач для двух станков ==
# [[P2precpi1Lmax|<tex>P2 \mid prec, p_i = 1 \mid L_{\max}</tex>]]
# [[R2Cmax|<tex>R2 \mid \mid C_{max}</tex>]]
# [[F2Cmax|<tex>F2 \mid \mid C_{max}</tex>]]
# [[O2Cmax|<tex>O2 \mid \mid C_{max}</tex>]]
# [[J2ni2Cmax|<tex>J2 \mid n_{i} \leqslant 2 \mid C_{max}</tex>]]
# [[J2pij1Lmax| <tex>J2\mid p_{ij} = 1\mid L_{max}</tex>]]
== 4 Задачи для произвольного числа станков ==
# [[Flow shop]]
# [[Fpij1sumwu|<tex>F \mid p_{ij} = 1 \mid \sum w_i U_i</tex>]]
# [[PSumCi|<tex>P \mid \mid \sum C_{i}</tex>]]
# [[Pintreepi1Lmax|<tex>P \mid intree, p_{i} = 1 \mid L_{max}</tex>]]
# [[PpmtnriLmax|<tex>P \mid pmtn, r_i \mid L_{max}</tex>]]
# [[Ppi1sumwu|<tex>P \mid p_i=1 \mid \sum w_i U_i</tex>]]
# [[Ppi1riintegerLmax|<tex>P \mid p_i=1; r_i - integer \mid L_{max}</tex>]]
# [[RSumCi|<tex>R \mid \mid \sum C_i</tex>]]
# [[RpmtnCmax|<tex>R \mid pmtn \mid C_{max}</tex>]]
# [[QpmtnCmax|<tex>Q \mid pmtn \mid C_{max}</tex>]]
# [[QpmtnSumCi|<tex> Q \mid pmtn \mid \sum C_i </tex>]]
# [[QpmtnriLmax|<tex>Q \mid pmtn, r_{i} \mid L_{max}</tex>]]
# [[QSumCi|<tex>Q\mid\mid\sum{C_i}</tex>]]
# [[Opi1sumu|<tex>O \mid p_{ij} = 1 \mid \sum U_i</tex>]]
# [[Opij1di|<tex>O \mid p_{ij} = 1, d_i \mid - </tex>]]
# [[Opij1sumwu|<tex> O \mid p_{i,j} = 1 \mid \sum w_{i} U_{i} </tex>]]
# [[Opij1SumTi|<tex> O \mid p_{i,j} = 1 \mid \sum T_{i} </tex>]]
# [[Opij1Cmax|<tex> O \mid p_{ij} = 1 \mid C_{max} </tex>]]
# [[Opij1Sumwc|<tex> O \mid p_{ij} = 1 \mid \sum w_i C_i </tex>]]
