Geodesic
Алгоритм с~оценками для пропорционального случая двухпроцессорной задачи теории расписаний типа flow shop c~минимальными задержками
Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 4, pp. 3-15.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2007_14_4_a0,
     author = {A. A. Ageev},
     title = {{\CYRA}{\cyrl}{\cyrg}{\cyro}{\cyrr}{\cyri}{\cyrt}{\cyrm} {\cyrs}~{\cyro}{\cyrc}{\cyre}{\cyrn}{\cyrk}{\cyra}{\cyrm}{\cyri} {\cyrd}{\cyrl}{\cyrya} {\cyrp}{\cyrr}{\cyro}{\cyrp}{\cyro}{\cyrr}{\cyrc}{\cyri}{\cyro}{\cyrn}{\cyra}{\cyrl}{\cyrsftsn}{\cyrn}{\cyro}{\cyrg}{\cyro} {\cyrs}{\cyrl}{\cyru}{\cyrch}{\cyra}{\cyrya} {\cyrd}{\cyrv}{\cyru}{\cyrh}{\cyrp}{\cyrr}{\cyro}{\cyrc}{\cyre}{\cyrs}{\cyrs}{\cyro}{\cyrr}{\cyrn}{\cyro}{\cyrishrt} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyri} {\cyrt}{\cyre}{\cyro}{\cyrr}{\cyri}{\cyri} {\cyrr}{\cyra}{\cyrs}{\cyrp}{\cyri}{\cyrs}{\cyra}{\cyrn}{\cyri}{\cyrishrt} {\cyrt}{\cyri}{\cyrp}{\cyra} flow shop c~{\cyrm}{\cyri}{\cyrn}{\cyri}{\cyrm}{\cyra}{\cyrl}{\cyrsftsn}{\cyrn}{\cyrery}{\cyrm}{\cyri} {\cyrz}{\cyra}{\cyrd}{\cyre}{\cyrr}{\cyrzh}{\cyrk}{\cyra}{\cyrm}{\cyri}},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--15},
     publisher = {mathdoc},
     volume = {14},
     number = {4},
     year = {2007},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2007_14_4_a0/}
}
TY  - JOUR
AU  - A. A. Ageev
TI  - Алгоритм с~оценками для пропорционального случая двухпроцессорной задачи теории расписаний типа flow shop c~минимальными задержками
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2007
SP  - 3
EP  - 15
VL  - 14
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2007_14_4_a0/
LA  - ru
ID  - DA_2007_14_4_a0
ER  - 
%0 Journal Article
%A A. A. Ageev
%T Алгоритм с~оценками для пропорционального случая двухпроцессорной задачи теории расписаний типа flow shop c~минимальными задержками
%J Diskretnyj analiz i issledovanie operacij
%D 2007
%P 3-15
%V 14
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2007_14_4_a0/
%G ru
%F DA_2007_14_4_a0
A. A. Ageev. Алгоритм с~оценками для пропорционального случая двухпроцессорной задачи теории расписаний типа flow shop c~минимальными задержками. Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 4, pp. 3-15. http://geodesic.mathdoc.fr/item/DA_2007_14_4_a0/

[1] Ageev A. A., Baburin A. E., “Approximation algorithms for UET scheduling problems with exact delays”, Oper. Res. Letters, 35:4 (2007), 533–540 | DOI | MR | Zbl

[2] Ageev A. A., Kononov A. V., Approximation and online algorithms, 4th International workshop, WAOA 2006 (Zurich, September 14–15, 2006) Revised papers, Lecture Notes in Comput. Sci., 4368, Springer, Berlin, 2006

[3] Dell'Amico M., “Shop problems with two machines and time lags”, Oper. Research, 44:4 (1996), 777–787 | DOI

[4] Dell'Amico M., Vaessens R. J. M., “Flow and open shop scheduling on two machines with transportation times and machine-independent processing times is NP-hard”, Materiali di discussione 141, Dipartimento di Economia Politica, Università di Modena, 1996

[5] Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., “Optimization and approximation in deterministic sequencing and scheduling: a survey”, Annals of Discrete Mathematics, 5 (1979), 287–326 | DOI | MR | Zbl

[6] Johnson S. M., “Optimal two- and three-stage production schedules with setup times included”, Naval Research Logistics Quarterly, 1 (1954), 61–68 | DOI

[7] Johnson S. M., “Discussion: Sequencing $n$ jobs on two machines with arbitrary time lags”, Management Science, 5 (1958), 299–303 | DOI | MR

[8] Kern W., Nawijn W. M., “Scheduling multi-operation jobs with time lags on a single machine”, Proc. of the 2nd Workshop on Graphs and Combinatorial Optimization, Enschede, 1991

[9] Lenstra J. K., Chastnoe soobschenie, 1991

[10] Mitten L. G., “Sequencing $n$ jobs on two machines with arbitrary time lags”, Management Science, 5 (1958), 293–298 | DOI | MR

[11] Strusevich V. A., “A heuristic for the two-machine open-shop scheduling with transportation times”, Discrete Applied Math., 93:2–3 (1999), 287–304 | DOI | MR | Zbl

[12] Yu W., The two-machine shop problem with delays and the one-machine total tardiness problem, Ph. D. thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 1996 | MR

[13] Yu W., Hoogeveen H., Lenstra J. K., “Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard”, J. Sched., 7:5 (2004), 333–348 | DOI | MR | Zbl