|
|
APS system application for planning and scheduling
Zápotočný, Václav ; Hromková, Ivana (referee) ; Simeonov, Simeon (advisor)
Master's thesis, made at the Institute of Production Machines, Systems and Robotics, aims, evaluate existing production of slope mowers manufactured by Dvořák – svahové sekačky s.r.o., and then perform data collection for obtaining complete technological processes of production. With the APS (Advanced Planning and Scheduling) system, simulate and design an optimized solution, with a view to significantly reduce the required storage current inventory of manufactured parts for assembly of that slope mower.
|
|
|
Personal Timetabling
Doležal, Lukáš ; Barták, Roman (advisor) ; Duša, Vladimír (referee)
Despite all the advancements in Artificial Intelligence, we still do not have a broadly available application for automated scheduling of personal activities. The main difficulty in creating such an application is satisfying user's diverse expectations about time organization. In this study we focused on creating a tool that can help users with organizing their time. We designed a model for describing personal activities with user preferences. We formulated scheduling of personal activities as an optimization problem for which we designed and implemented a solving algorithm, aiming to schedule activities with precision of seconds. We created a prototype of web-calendar application powered by this model and an algorithm which we designed with the focus on ability to clearly display user's time and easily insert activities for automated scheduling. The web application is backed by RESTful API which enables implementing application on various platforms. Powered by TCPDF (www.tcpdf.org)
|
|
|
Workgroup Planning Application
Nguyen Cong, Thang ; Kopecký, Michal (advisor) ; Žemlička, Michal (referee)
This thesis describes design and implementation of a tool that supports workgroup planning. The system allows its users to manipulate their tasks, as well as supports collaboration of more users. The user interface of the application is based on lightweight web client. The application is modular, so that the enhancing of the application in the future will be as simple as possible.
|
|
|
Airport - Time and resource constrained project sheduling
Vandas, Marek ; Petříčková, Zuzana (advisor) ; Pangrác, Ondřej (referee)
This thesis identifies constraints for safe ground airport operations. These operations consist of runway assignment, taxi operations planning and gate scheduling. The aim of this thesis is to show how this problem can be formulated as constraint satisfaction problem and then solved as a scheduling problem. Based on this model, an application that ilustrates these concepts is designed and implemented. This application enables a visualisation of results. An extendable constraint solver was implemented for the purpose of this application. This solver can be used to solve problems from other domains as well and also enables easy change of search strategy.
|
|
|
Combinatorial algorithms for online problems: Semi-online scheduling on related machines
Ebenlendr, Tomáš ; Sgall, Jiří (advisor) ; Barták, Roman (referee) ; Epstein, Leah (referee) ; Woeginger, Gerhard (referee)
Mgr. Tomáš Ebenlendr Combinatorial algorithms for online problems: Semi-online scheduling on related machines Abstract of doctoral thesis We construct a framework that gives optimal algorithms for a whole class of scheduling problems. This class covers the most studied semi-online variants of preemptive online scheduling on uniformly related machines with the objective to minimize makespan. The algorithms from our framework are deterministic, yet they are optimal even among all randomized algorithms. In addition, they are optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. We provide new lower bound of 2.112 for the original online problem. The (deterministic) upper bound is e ≈ 2.718 as there was known e-competitive randomized algorithm before. Our framework applies to all semi-online variants which are based on some knowledge about the input sequence. I.e., they are restrictions of the set of valid inputs. We use our framework to study restrictions that were studied before, and we derive some new bounds. Namely we study known sum of processing times, known maximal processing time, sorted (decreasing) jobs, tightly grouped processing times, approximately known optimal makespan and few combinations. Based on the analysis...
|
|
|
Schedule analysis
Novák, Ladislav ; Barták, Roman (advisor) ; Duša, Vladimír (referee)
Goal of this work was to engage in formal analysis of schedules, i.e. identifying weak spots and consequently design method to correct those weak points. Moreover this thesis addresses method, how from constructed corrections take appropriate set, called portfolio. Resulting software prototype called an Analyzer is integrated into FlowOpt project, which represents complex solution from modeling workflows, creation of schedules to displaying schedules using Gantt diagrams. Analyzer was developed mainly as a prototype application, which illustrates formal process of analysis. Powered by TCPDF (www.tcpdf.org)
|
|
|
Integrating Planning and Scheduling
Dvořák, Filip
Title: Integrating Planning and Scheduling Author: Mgr. Filip Dvořák Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: prof. RNDr. Roman Barták, Ph.D., KTIML MFF UK Abstract: The main topic of the work is the design and development of a plan- space planning system FAPE that integrates explicit time reasoning, resource reasoning with discrete resources and reservoirs and hierarchical decompositions. FAPE is the first planning system that accepts the language ANML, supporting most of its major features. We investigate different aspects of the integration, also proposing a new problem reformulation technique for the state-variable represen- tation and discovering a transition of performance between sparse and minimal temporal networks. We further extend FAPE with acting capabilities and evalu- ate the runtime properties and benefits of its expressiveness. Finally, we present FAPE as a planning and acting system in real world experiments, where FAPE operates a PR2 robot. Keywords: planning, scheduling, temporal constraints, HTN, robotics
|
|
|
Fixed interval scheduling problems with endogenous uncertainty
Hamerníková, Iva ; Branda, Martin (advisor) ; Lachout, Petr (referee)
This thesis is focused on the fixed interval scheduling (FIS) problems with random delays. Firstly, we introduce the concept of FIS problems and the exogenous and endogenous uncertainty. In the next chapter we will summarize the FIS problems under decision dependent randomness and their relation to the robust coloring. We will extend previous results with proposing a new FIS problem with maintenance. This problem is a specific case of a decision-dependent probabilities as it allows to use a specific type of a job - the maintenance, which positively impacts the probability distributions of job delays. We start with defining a problem, where maintenance must be assigned only before regular jobs and then we propose the general case, when maintenances appears during the whole processing period. We show why this approach leads to an optimal solution and provide a detailed example of a small problem.We also discuss some extensions of our problem. Finally, we conduct a numerical study. We solve the FIS maintenance problem with the Cplex solver for a few different settings of inputs. It seems that the maintenance is useful only for certain settings, such as jobs with high probability of having a delay or the price of outsourcing being much higher than the cost of maintenance. It is also shown that the problem...
|
|
|
Automated Planning and Scheduling in Manufacturing
Bucher, Michal ; Kočí, Radek (referee) ; Hrubý, Martin (advisor)
Thesis deals with a problem of automated planning and scheduling in manufacturing. Problem is formally defined by mathematical model Resource Constrained Project Scheduling Problem. Based on this model scheduling system was developed, which is using the optimizer based on Genetic algoritms. Developed system was then tested in real manufacturing. System can also visualize schedules in form of Gantt chart.
|
|
|
Industry 4.0 planner
Kubásek, Martin ; Chromý, Adam (referee) ; Burian, František (advisor)
This thesis deals with the design of manufacturing planner for Industry 4.0 testbed. Before design the terms Industry 4.0, MES, ERP are explained. Then the problems concerning this testbed are explained and a possible solution is shown. This solution was supplied as part of the assignment. Planner was made around this solution and its structure and algorithms were shown. Planner is written as a C# application, which generates manufacturing plan from MES input data. This input data is downloaded through REST connection, output is saved to a JSON file. Finally, the results of this planner are shown as a report in xlsx table. The planner can successfully generate a manufacturing plan for Industry 4.0 testbed.
|
guest ::
