Geodesic
Optimal job-shop scheduling with two jobs in systems with unrestricted paths
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 5, pp. 659-670 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1993_33_5_a1,
     author = {V. A. Strusevich and N. V. Shakhlevich},
     title = {Optimal job-shop scheduling with two jobs in systems with unrestricted paths},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {659--670},
     year = {1993},
     volume = {33},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_5_a1/}
}
TY  - JOUR
AU  - V. A. Strusevich
AU  - N. V. Shakhlevich
TI  - Optimal job-shop scheduling with two jobs in systems with unrestricted paths
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1993
SP  - 659
EP  - 670
VL  - 33
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_5_a1/
LA  - ru
ID  - ZVMMF_1993_33_5_a1
ER  - 
%0 Journal Article
%A V. A. Strusevich
%A N. V. Shakhlevich
%T Optimal job-shop scheduling with two jobs in systems with unrestricted paths
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1993
%P 659-670
%V 33
%N 5
%U http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_5_a1/
%G ru
%F ZVMMF_1993_33_5_a1
V. A. Strusevich; N. V. Shakhlevich. Optimal job-shop scheduling with two jobs in systems with unrestricted paths. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 5, pp. 659-670. http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_5_a1/

[1] Akers S. B., Friedman J., “A non-numeric approach to production scheduling problems”, Operat. Res., 3 (1955), 429–442 | DOI

[2] Hardgrave W. W., Nemhauser G., “A geometric model and graphical algorithm for a sequencing problem”, Operat. Res., 11 (1963), 889–900 | DOI | Zbl

[3] Szwarc W., “Solution of the Akers-Friedman scheduling problem”, Operat. Res., 8 (1966), 782–788 | DOI

[4] Brucker P., “An efficient algorithm for the job-shop problem with two jobs”, Computing, 40 (1988), 353–359 | DOI | MR | Zbl

[5] Sotskov Yu. N., “Optimalnoe obsluzhivanie dvukh trebovanii pri regulyarnom kriterii”, Avtomatizatsiya protsessov proektirovaniya, ITK AN BSSR, Minsk, 1985, 86–95

[6] Tanaev V. S., Sotskov Yu. N., Strusevich V. A., Teoriya raspisanii. Mnogostadiinye sistemy, Nauka, M., 1989 | MR

[7] Sotskov Yu. N., “Slozhnost zadach v teorii raspisanii s fiksirovannym chislom trebovanii”, Dokl. AN BSSR, 33:6 (1989), 488–491 | MR | Zbl

[8] Gonzalez T., Sahni S., “Open-shop scheduling to minimize finish time”, J. Association Comput. Machinery, 23 (1976), 665–679 | MR | Zbl

[9] Strusevich V. A., “O vozmozhnosti postroeniya optimalnykh po bystrodeistviyu raspisanii dlya mnogostadiinoi sistemy s nefiksirovannymi marshrutami prokhozhdeniya stadii”, Vestsi AN BSSR. Ser. fiz.-matem. navuk, 1986, no. 6, 43–48 | MR | Zbl