. . "This paper refers to an analysis of assumptions, where it is necessary to compute automated daily production schedules for optimal flow of production processes of piece and low series character. A production plan suitable using workplace capacities is designed for a low number of workplaces and a low number of production tasks. The input for scheduling is derived in a reverse way from this plan and a research is made if it is possible to find an algorithm which can produce an appropriate high-quality or a better schedule. Interchangeable workplaces, deterministic and random schedules are considered."@en . "P\u0159\u00EDsp\u011Bvek se t\u00FDk\u00E1 anal\u00FDzy p\u0159edpoklad\u016F, za kter\u00FDch je nezbytn\u00E9 pro optim\u00E1ln\u00ED zaji\u0161t\u011Bn\u00ED v\u00FDrobn\u00EDch proces\u016F ve stroj\u00EDrensk\u00E9 v\u00FDrob\u011B kusov\u00E9ho a maloseriv\u00E9ho charakteru zpracov\u00E1vat automatizovan\u00E9 denn\u00ED pl\u00E1ny v\u00FDroby. Pro mal\u00FD po\u010Det pracovi\u0161\u0165 a mal\u00FD po\u010Det v\u00FDrobn\u00EDch \u00FAkol\u016F je navr\u017Een pl\u00E1n v\u00FDroby vhodn\u011B vyu\u017E\u00EDvaj\u00EDc\u00ED kapacity pracovi\u0161\u0165. Z tohoto pl\u00E1nu je zp\u011Btn\u011B odvozeno zad\u00E1n\u00ED pro rozvrhov\u00E1n\u00ED a prov\u00E1d\u00ED se zkoum\u00E1n\u00ED, zda lze nal\u00E9zt algoritmus, kter\u00FD dop\u0159edn\u011B vytvo\u0159\u00ED stejn\u011B kvalitn\u00ED nebo kvalitn\u011Bj\u0161\u00ED rozvrh. Jsou uva\u017Eov\u00E1na z\u00E1m\u011Bnn\u00E1 pracovi\u0161t\u011B, deterministick\u00E9 i n\u00E1hodn\u00E9 rozvrhy."@cs . "P\u0159\u00EDsp\u011Bvek se t\u00FDk\u00E1 anal\u00FDzy p\u0159edpoklad\u016F, za kter\u00FDch je nezbytn\u00E9 pro optim\u00E1ln\u00ED zaji\u0161t\u011Bn\u00ED v\u00FDrobn\u00EDch proces\u016F ve stroj\u00EDrensk\u00E9 v\u00FDrob\u011B kusov\u00E9ho a maloseriv\u00E9ho charakteru zpracov\u00E1vat automatizovan\u00E9 denn\u00ED pl\u00E1ny v\u00FDroby. Pro mal\u00FD po\u010Det pracovi\u0161\u0165 a mal\u00FD po\u010Det v\u00FDrobn\u00EDch \u00FAkol\u016F je navr\u017Een pl\u00E1n v\u00FDroby vhodn\u011B vyu\u017E\u00EDvaj\u00EDc\u00ED kapacity pracovi\u0161\u0165. Z tohoto pl\u00E1nu je zp\u011Btn\u011B odvozeno zad\u00E1n\u00ED pro rozvrhov\u00E1n\u00ED a prov\u00E1d\u00ED se zkoum\u00E1n\u00ED, zda lze nal\u00E9zt algoritmus, kter\u00FD dop\u0159edn\u011B vytvo\u0159\u00ED stejn\u011B kvalitn\u00ED nebo kvalitn\u011Bj\u0161\u00ED rozvrh. Jsou uva\u017Eov\u00E1na z\u00E1m\u011Bnn\u00E1 pracovi\u0161t\u011B, deterministick\u00E9 i n\u00E1hodn\u00E9 rozvrhy." . . . "[237E38585529]" . "Optimization of daily production schedule"@en . . "Optimization of daily production schedule"@en . . "Optimalizace denn\u00EDho rozvrhu v\u00FDroby"@cs . "Shop-floor schedule; schedule optimization; deterministic and random schedules; piece and low series engineering production."@en . "S" . "RIV/49777513:23210/09:00502243!RIV10-MSM-23210___" . "Kope\u010Dek, Pavel" . . "23210" . . . . "Optimalizace denn\u00EDho rozvrhu v\u00FDroby"@cs . "Optimalizace denn\u00EDho rozvrhu v\u00FDroby" . . "1"^^ . . . "Optimalizace denn\u00EDho rozvrhu v\u00FDroby" . "1"^^ . "RIV/49777513:23210/09:00502243" . . . "331902" .