RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 2,
2005
Volume 12,
Issue 1,
Pages
12–36
(Mi da84)
This article is cited in
4
papers
New greedy heuristics for the scheduling problem with limited resources
Yu. A. Kochetov
,
A. A. Stolyar
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
UDC:
519.85
Received:
15.06.2004
Revised:
25.04.2005
Fulltext:
PDF file (306 kB)
References
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024