RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper.,
1996
Volume 3,
Issue 1,
Pages
80–90
(Mi da430)
On the complexity of some generalizations of Johnson's two-machine problem
A. G. Shchukin
a
,
N. I. Glebov
b
a
Novosibirsk State University
b
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
UDC:
519.854
Received:
05.12.1995
Fulltext:
PDF file (928 kB)
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025