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

Diskretn. Anal. Issled. Oper., Ser. 2, 2000 Volume 7, Issue 1, Pages 9–34 (Mi da289)

This article is cited in 16 papers

Polynomial solvability of scheduling problems with storable resources and directive deadlines

E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov

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

UDC: 519.8

Received: 27.05.1999
Revised: 25.05.2000



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024