{"id":3406,"date":"2026-02-09T10:13:40","date_gmt":"2026-02-09T10:13:40","guid":{"rendered":"https:\/\/help.aliteo.com\/?p=3406"},"modified":"2026-06-28T13:29:03","modified_gmt":"2026-06-28T13:29:03","slug":"planovanie-riesenia-uloh","status":"publish","type":"post","link":"https:\/\/help.aliteo.com\/sk\/planovanie-riesenia-uloh\/","title":{"rendered":"Pl\u00e1novanie rie\u0161enia \u00faloh"},"content":{"rendered":"<p data-path-to-node=\"14\">T\u00e1to funkcia umo\u017e\u0148uje automatizovan\u00e9 a inteligentn\u00e9 rozvrhnutie odhadovan\u00e9ho \u010dasu \u00falohy do vo\u013en\u00fdch kapac\u00edt vybran\u00fdch rie\u0161ite\u013eov. Dial\u00f3gov\u00e9 okno pre <b data-path-to-node=\"14\" data-index-in-node=\"148\">Pl\u00e1novanie kapacity<\/b> sa zobraz\u00ed po tom, \u010do v zobrazen\u00ed pl\u00e1novania kliknete na ikonu <b data-path-to-node=\"14\" data-index-in-node=\"231\">\u201e+\u201c<\/b> pri konkr\u00e9tnej \u00falohe a zvol\u00edte pou\u017e\u00edvate\u013eov, ktor\u00fdm m\u00e1 by\u0165 pr\u00e1ca pridelen\u00e1.<\/p>\n<h3 data-path-to-node=\"17\"><b data-path-to-node=\"17\" data-index-in-node=\"0\">Princ\u00edp fungovania pre jedn\u00e9ho pou\u017e\u00edvate\u013ea<\/b><\/h3>\n<p data-path-to-node=\"17\">Pri pl\u00e1novan\u00ed \u00falohy pre jedn\u00e9ho \u010dlena t\u00edmu syst\u00e9m postupuje nasledovne:<\/p>\n<ul data-path-to-node=\"18\">\n<li>\n<p data-path-to-node=\"18,0,0\"><b data-path-to-node=\"18,0,0\" data-index-in-node=\"0\">H\u013eadanie slotov<\/b>: Aplik\u00e1cia vyh\u013ead\u00e1va v kalend\u00e1ri pou\u017e\u00edvate\u013ea vo\u013en\u00e9 \u010dasov\u00e9 sloty, ktor\u00e9 zodpovedaj\u00fa nastavenej <b data-path-to-node=\"18,0,0\" data-index-in-node=\"110\">minim\u00e1lnej d\u013a\u017eke s\u00favislej pr\u00e1ce<\/b>.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"18,1,0\"><b data-path-to-node=\"18,1,0\" data-index-in-node=\"0\">Presun v \u010dase<\/b>: Ak pou\u017e\u00edvate\u013e vy\u010derp\u00e1 svoju dostupn\u00fa kapacitu pre dan\u00fd de\u0148, pl\u00e1nova\u010d automaticky pokra\u010duje v h\u013eadan\u00ed vo\u013en\u00e9ho miesta v nasleduj\u00facich pracovn\u00fdch d\u0148och.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"18,2,0\"><b data-path-to-node=\"18,2,0\" data-index-in-node=\"0\">Minim\u00e1lna d\u013a\u017eka<\/b>: \u00daloha sa vlo\u017e\u00ed iba do blokov, ktor\u00e9 s\u00fa rovnako dlh\u00e9 alebo dlh\u0161ie ako zadan\u00fd limit; krat\u0161ie vo\u013en\u00e9 \u00faseky syst\u00e9m pri pl\u00e1novan\u00ed presko\u010d\u00ed.<\/p>\n<\/li>\n<\/ul>\n<h3 data-path-to-node=\"19\"><b data-path-to-node=\"19\" data-index-in-node=\"0\">Pl\u00e1novanie pre viacer\u00fdch pou\u017e\u00edvate\u013eov (striedav\u00e9 pl\u00e1novanie)<\/b><\/h3>\n<p data-path-to-node=\"19\">Ak pre rie\u0161enie \u00falohy vyberiete viac ako jedn\u00e9ho pou\u017e\u00edvate\u013ea, syst\u00e9m vyu\u017e\u00edva strat\u00e9giu striedania po d\u0148och, aby zaistil rovnomern\u00e9 zapojenie v\u0161etk\u00fdch vybran\u00fdch rie\u0161ite\u013eov:<\/p>\n<ul data-path-to-node=\"20\">\n<li>\n<p data-path-to-node=\"20,0,0\"><b data-path-to-node=\"20,0,0\" data-index-in-node=\"0\">Striedanie po d\u0148och<\/b>: Syst\u00e9m najsk\u00f4r h\u013ead\u00e1 vo\u013en\u00fa kapacitu pre prv\u00fd de\u0148 u prv\u00e9ho pou\u017e\u00edvate\u013ea a n\u00e1sledne u druh\u00e9ho pou\u017e\u00edvate\u013ea.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"20,1,0\"><b data-path-to-node=\"20,1,0\" data-index-in-node=\"0\">Iterat\u00edvny postup<\/b>: Tento proces sa opakuje de\u0148 po dni (prv\u00fd rie\u0161ite\u013e, potom druh\u00fd, pr\u00edpadne \u010fal\u0161\u00ed), k\u00fdm nie je napl\u00e1novan\u00fd cel\u00fd odhadovan\u00fd \u010das \u00falohy.<\/p>\n<\/li>\n<\/ul>\n<h3 data-path-to-node=\"21\"><b data-path-to-node=\"21\" data-index-in-node=\"0\">Nastavenie parametrov pl\u00e1novania<\/b><\/h3>\n<p data-path-to-node=\"21\">V dial\u00f3govom okne m\u00f4\u017eete pred samotn\u00fdm potvrden\u00edm definova\u0165:<\/p>\n<ul data-path-to-node=\"22\">\n<li>\n<p data-path-to-node=\"22,0,0\"><b data-path-to-node=\"22,0,0\" data-index-in-node=\"0\">Ko\u013eko \u010dasu zapl\u00e1nova\u0165<\/b>: Celkov\u00fd po\u010det hod\u00edn, ktor\u00e9 maj\u00fa by\u0165 rozdelen\u00e9 medzi rie\u0161ite\u013eov.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"22,1,0\"><b data-path-to-node=\"22,1,0\" data-index-in-node=\"0\">Minim\u00e1lna d\u013a\u017eka s\u00favislej pr\u00e1ce<\/b>: Najkrat\u0161\u00ed pr\u00edpustn\u00fd \u010dasov\u00fd blok, ktor\u00fd m\u00f4\u017ee by\u0165 pou\u017e\u00edvate\u013eovi pridelen\u00fd (napr. 01:00 h).<\/p>\n<\/li>\n<\/ul>\n<h3 data-path-to-node=\"15\"><b data-path-to-node=\"15\" data-index-in-node=\"0\">Logika pl\u00e1novan\u00e9ho \u010dasu<\/b><\/h3>\n<p data-path-to-node=\"15\">Syst\u00e9m pri otv\u00e1ran\u00ed dial\u00f3gu prim\u00e1rne vych\u00e1dza z <b data-path-to-node=\"15\" data-index-in-node=\"72\">\u201ePl\u00e1novan\u00e9ho \u010dasu\u201c<\/b>, ktor\u00fd je uveden\u00fd na pravom okraji pri zozname \u00faloh alebo v \u013eavom paneli v detaile \u00falohy:<\/p>\n<ul data-path-to-node=\"16\">\n<li>\n<p data-path-to-node=\"16,0,0\"><b data-path-to-node=\"16,0,0\" data-index-in-node=\"0\">Automatick\u00fd dopo\u010det<\/b>: Aplik\u00e1cia sa prim\u00e1rne sna\u017e\u00ed zapl\u00e1nova\u0165 v\u0161etok zost\u00e1vaj\u00faci \u010das, ktor\u00fd do celkov\u00e9ho odhadu \u00falohy e\u0161te zost\u00e1va.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"16,1,0\"><b data-path-to-node=\"16,1,0\" data-index-in-node=\"0\">Ru\u010dn\u00e9 zadanie<\/b>: Ak je pl\u00e1novan\u00fd \u010das pri \u00falohe nastaven\u00fd na 0 alebo ak u\u017e bol v\u0161etok \u010dasov\u00fd odhad vy\u010derpan\u00fd (rozpl\u00e1novan\u00fd), syst\u00e9m V\u00e1s vyzve na ru\u010dn\u00e9 zadanie po\u010dtu hod\u00edn, ktor\u00e9 si \u017eel\u00e1te novo rozvrhn\u00fa\u0165.<\/p>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>T\u00e1to funkcia umo\u017e\u0148uje automatizovan\u00e9 a inteligentn\u00e9 rozvrhnutie odhadovan\u00e9ho \u010dasu \u00falohy do vo\u013en\u00fdch kapac\u00edt vybran\u00fdch rie\u0161ite\u013eov. Dial\u00f3gov\u00e9 okno pre Pl\u00e1novanie kapacity sa zobraz\u00ed po tom, \u010do v zobrazen\u00ed pl\u00e1novania kliknete na ikonu \u201e+\u201c pri konkr\u00e9tnej \u00falohe a zvol\u00edte pou\u017e\u00edvate\u013eov, ktor\u00fdm m\u00e1 by\u0165 pr\u00e1ca pridelen\u00e1. Princ\u00edp fungovania pre jedn\u00e9ho pou\u017e\u00edvate\u013ea Pri pl\u00e1novan\u00ed \u00falohy pre jedn\u00e9ho \u010dlena t\u00edmu [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"inline_featured_image":false,"footnotes":""},"categories":[455],"tags":[],"class_list":["post-3406","post","type-post","status-publish","format-standard","hentry","category-planovanie-vseobecne-informacie"],"acf":[],"_links":{"self":[{"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/posts\/3406","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/comments?post=3406"}],"version-history":[{"count":3,"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/posts\/3406\/revisions"}],"predecessor-version":[{"id":4330,"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/posts\/3406\/revisions\/4330"}],"wp:attachment":[{"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/media?parent=3406"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/categories?post=3406"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/help.aliteo.com\/sk\/wp-json\/wp\/v2\/tags?post=3406"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}