Teoriya Raspisaniy
| AUTHOR | Gafarov Evgeniy; Lazarev Aleksandr |
| PUBLISHER | LAP Lambert Academic Publishing (11/23/2011) |
| PRODUCT TYPE | Paperback (Paperback) |
Description
Fundamental'nymi zadachami teorii raspisaniy dlya odnogo pribora yavlyayutsya zadachi s kriteriyami minimizatsii summarnogo zapazdyvaniya i zadachi minimizatsii maksimal'nogo vremennogo smeshcheniya. V dannoy knige privoditsya dostatochno polnoe issledovanie NP-trudnoy v obychnom smysle zadachi minimizatsii summarnogo zapazdyvaniya (total tardiness) i ee vzaimosvyaz' s zadachey Razbieniya. Vydelen ryad novykh polinomial'no i psevdo-polinomial'nykh razreshimykh sluchaev dannoy zadachi. Pri issledovanii byli ispol'zovany kak standartnye metody diskretnoy optimizatsii (metod dinamicheskogo programmirovaniya, - graficheskaya modifikatsiya), tak i metody, uchityvayushchie spetsificheskie osobennosti zadachi. Naryadu s tochnymi metodami primenyalis' i priblizhennye metaevristicheskie podkhody (metod "murav'inye kolonii"). S pomoshch'yu graficheskogo podkhoda udalos' pokazat' polinomial'nuyu razreshimost' obratnoy zadachi - maksimizatsii summarnogo zapazdyvaniya.
Show More
Product Format
Product Details
ISBN-13:
9783844357899
ISBN-10:
3844357890
Binding:
Paperback or Softback (Trade Paperback (Us))
Content Language:
Russian
More Product Details
Page Count:
96
Carton Quantity:
82
Product Dimensions:
6.00 x 0.23 x 9.00 inches
Weight:
0.33 pound(s)
Country of Origin:
US
Subject Information
BISAC Categories
Computers | General
Descriptions, Reviews, Etc.
publisher marketing
Fundamental'nymi zadachami teorii raspisaniy dlya odnogo pribora yavlyayutsya zadachi s kriteriyami minimizatsii summarnogo zapazdyvaniya i zadachi minimizatsii maksimal'nogo vremennogo smeshcheniya. V dannoy knige privoditsya dostatochno polnoe issledovanie NP-trudnoy v obychnom smysle zadachi minimizatsii summarnogo zapazdyvaniya (total tardiness) i ee vzaimosvyaz' s zadachey Razbieniya. Vydelen ryad novykh polinomial'no i psevdo-polinomial'nykh razreshimykh sluchaev dannoy zadachi. Pri issledovanii byli ispol'zovany kak standartnye metody diskretnoy optimizatsii (metod dinamicheskogo programmirovaniya, - graficheskaya modifikatsiya), tak i metody, uchityvayushchie spetsificheskie osobennosti zadachi. Naryadu s tochnymi metodami primenyalis' i priblizhennye metaevristicheskie podkhody (metod "murav'inye kolonii"). S pomoshch'yu graficheskogo podkhoda udalos' pokazat' polinomial'nuyu razreshimost' obratnoy zadachi - maksimizatsii summarnogo zapazdyvaniya.
Show More
Your Price
$62.84