RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 1996 Volume 3, Issue 2, Pages 15–32 (Mi da433)

This article is cited in 19 papers

Combinatorial complexity of scheduling jobs with simple linear growth of processing times

A. V. Kononov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

UDC: 519.8

Received: 12.03.1996



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024