Вычисление нижней границы длин расписаний
Zapiski naucnych seminarov Leningradskogo (1983)
- Volume: 124, page 35-40
Access Full Article
top
How to cite
topТушкина, Т.А.. "Вычисление нижней границы длин расписаний." Zapiski naucnych seminarov Leningradskogo 124 (1983): 35-40. <http://eudml.org/doc/188266>.
@article{Тушкина1983,
author = {Тушкина, Т.А.},
journal = {Zapiski naucnych seminarov Leningradskogo},
keywords = {NP-completeness; time scheduling; Sequential relations; oriented graph; lower bounds; total processing time},
language = {rus},
pages = {35-40},
publisher = {Nauka},
title = {Вычисление нижней границы длин расписаний},
url = {http://eudml.org/doc/188266},
volume = {124},
year = {1983},
}
TY - JOUR
AU - Тушкина, Т.А.
TI - Вычисление нижней границы длин расписаний
JO - Zapiski naucnych seminarov Leningradskogo
PY - 1983
PB - Nauka
VL - 124
SP - 35
EP - 40
LA - rus
KW - NP-completeness; time scheduling; Sequential relations; oriented graph; lower bounds; total processing time
UR - http://eudml.org/doc/188266
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.