| Zadacha Kalendarnogo Planirovaniya Proektov S Ogranichennymi Resursami Contributor(s): Shcherbinina Tat'yana (Author) |
|
 |
ISBN: 3843304483 ISBN-13: 9783843304481 Publisher: LAP Lambert Academic Publishing OUR PRICE: $50.27 Product Type: Paperback Language: Russian Published: December 2010 |
| Additional Information |
| BISAC Categories: - Mathematics |
| Physical Information: 0.22" H x 6" W x 9" (0.32 lbs) 92 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Zadachi kalendarnogo planirovaniya proektov voznikayut v razlichnykh sferakh deyatel'nosti, v tom chisle pri proektirovanii novykh izdeliy i zapuske ikh v proizvodstvo, planirovanii grafikov vypuska i dostavki produktsii i t.d. Raznoobrazie prilozheniy delaet eto napravlenie ves'ma aktual'nym v oblasti matematicheskikh modeley i metodov optimizatsii. Pod proektom budem ponimat' mnozhestvo vzaimosvyazannykh rabot, vypolnenie kotorykh napravleno na dostizhenie opredelennoy tseli. Vzaimosvyaz' mezhdu rabotami zadaetsya tekhnologiey vypolneniya proekta. Kazhdaya rabota kharakterizuetsya dlitel'nost'yu i nekotorymi resursnymi trebovaniyami. Neobkhodimo, s uchetom ogranicheniy na resursy, opredelit' sroki vypolneniya rabot proekta, pri kotorykh znachenie tselevoy funktsii optimal'no. V dannoy rabote issledovana slozhnost' zadach so skladiruemymi resursami i kriteriyami srednevzveshennogo vremeni zaversheniya rabot i chistoy privedennoy pribyli. Razrabotany psevdopolinomial'nye algoritmy resheniya rassmatrivaemykh zadach. Postroeny vpolne polinomial'nye approksimatsionnye skhemy dlya zadach kalendarnogo planirovaniya s vozobnovimymi resursami i kriteriyami minimizatsii obshchego vremeni zaversheniya vsekh rabot i srednego vremeni zaversheniya rabot. |