New greedy heuristics for the scheduling problem with limited resources
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 1, pp. 12-36
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2005_12_1_a1,
author = {Yu. A. Kochetov and A. A. Stolyar},
title = {New greedy heuristics for the scheduling problem with limited resources},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {12--36},
publisher = {mathdoc},
volume = {12},
number = {1},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2005_12_1_a1/}
}
TY - JOUR AU - Yu. A. Kochetov AU - A. A. Stolyar TI - New greedy heuristics for the scheduling problem with limited resources JO - Diskretnyj analiz i issledovanie operacij PY - 2005 SP - 12 EP - 36 VL - 12 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2005_12_1_a1/ LA - ru ID - DA_2005_12_1_a1 ER -
Yu. A. Kochetov; A. A. Stolyar. New greedy heuristics for the scheduling problem with limited resources. Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 1, pp. 12-36. http://geodesic.mathdoc.fr/item/DA_2005_12_1_a1/