Neste trabalho abordamos o problema de programação de tarefas em um ambiente flow shop permutacional com mais de duas máquinas. Restringimos o estudo para o caso em que todas as tarefas têm uma data de entrega comum e restritiva, e onde o objetivo é minimizar a soma total dos adiantamentos e atrasos das tarefas em relação a tal data de entrega. É assumido também um ambiente estático e determinístico. Havendo soluções com o mesmo custo, preferimos aquelas que envolvem menos tempo de espera no buffer entre cada máquina. Devido à dificuldade de resolver o problema, mesmo para instâncias pequenas (o problema pertence à classe NP-difícil), apresentamos uma abordagem heurística para lidar com ele, a qual está baseada em busca local e faz uso de um algoritmo linear para atribuir datas de conclusão às tarefas na última máquina. Este algoritmo baseia-se em algumas propriedades analíticas inerentes às soluções ótimas. Além disso, foi desenvolvida uma formulação matemática do problema em programação linear inteira mista (PLIM) que vai permitir validar a eficácia da abordagem. Examinamos também o desempenho das heurísticas com testes padrões (benchmarks) e comparamos nossos resultados com outros obtidos na literatura. / In this work we approach the permutational flow shop scheduling problem with more than two machines. We restrict the study to the case where all the jobs have a common and restrictive due date, and where the objective is to minimize the total sum of the earliness and tardiness of jobs relative to the due date. A static and deterministic environment is also assumed. If there are solutions with the same cost, we prefer those that involve less buffer time between each machine. Due to the difficulty of solving the problem, even for small instances (the problem belongs to the NP-hard class), we present a heuristic approach to dealing with it, which is based on local search and makes use of a linear algorithm to assign conclusion times to the jobs on the last machine. This algorithm is based on some analytical properties inherent to optimal solutions. In addition, a mathematical formulation of the problem in mixed integer linear programming (MILP) was developed that will validate the effectiveness of the approach. We also examined the performance of our heuristics with benchmarks and compared our results with those obtained in the literature.

Submitted by Irene Nascimento (irene.kessia@ufpe.br) on 2016-06-22T16:10:58Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertacao_SinndyDayanaRicoLugo_2016.pdf: 3067162 bytes, checksum: bf4e6bc8fdefc54a21c8315582de00a1 (MD5) / Made available in DSpace on 2016-06-22T16:10:58Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertacao_SinndyDayanaRicoLugo_2016.pdf: 3067162 bytes, checksum: bf4e6bc8fdefc54a21c8315582de00a1 (MD5) Previous issue date: 2016-02-01 / CNPQ / A determinação dos requerimentos de materiais nas Pequenas e Médias Empresas (PMEs) cujo ambiente de produção é do tipo Job Shop, tem sido categorizado na literatura como um problema devido ao complexo processo de tomada de decisões subjacente, gerado pela grande quantidade de variáveis no sistema de fabricação, aos níveis de apropriação de tecnologias da informação e às características dos modelos e das ferramentas que atualmente encontram-se disponíveis. Dentro deste contexto, uma solução fundamentada em um modelo de decisão multicritério foi proposta, incluindo a execução do processo de elicitação das preferências do decisor, e suportada na geração de um Sistema de Apoio à Decisão (SAD) de ambiente Web. Ao longo deste trabalho é apresentada a caracterização das etapas de construção do modelo, os pontos relevantes para a escolha do Modelo Aditivo como base, as melhorias feitas ao processo de elicitação, e o detalhamento da interação do software desenvolvido com o processo decisório de determinação de requerimentos de matérias primas. Apresenta-se também a aplicação do modelo em algumas empresas do tipo PME, realizando uma análise comparativa entre os resultados esperados e os obtidos com o uso da ferramenta SAD e recolhendo todos os comentários dos decisores, com a finalidade de caracterizar, em um ambiente de fábrica real, os prós, contras e possíveis melhorias do modelo proposto. Todas as aplicações foram realizadas em duas fases: na primeira o decisor usou o SAD de forma isolada, sem o acompanhamento da analista com o intuito de obter uma visão totalmente externa; e na segunda o decisor usou o software com o acompanhamento direto da analista tendo como objetivo a interatividade e a troca de conhecimentos. A execução da primeira fase proporcionou informação relevante de como os decisores se sentem em relação às perguntas da elicitação de preferências, à linguagem usada, aos gráficos e às demais características desenvolvidas no aplicativo, concluindo que não contar com um analista obriga ao decisor a pensar cuidadosamente nas suas respostas e a ler detalhadamente as instruções. A segunda fase permitiu aos decisores maior compreensão do processo de elicitação e principalmente, em relação ao uso do SAD na etapa da analise de sensibilidade. Adicionalmente, apresenta-se a proposta de um segundo modelo baseado em outras teorias de decisão multicritério, Teoria de Utilidade Multiatributo (MAUT por sua sigla em inglês) e Utilidade Rank Dependente (RDU por sua sigla em inglês), com a diferença de que a ferramenta SAD foi testada com dados reais de única empresa. Assim, os resultados da aplicação deste modelo mostram diferenças substanciais entre utilizar o método clássico da Utilidade Esperada (EU em inglês) e usar a RDU; enquanto que diferenças menores, mas também relevantes, foram encontradas entre elicitar a função peso da probabilidade e usar os valores dos parâmetros sugeridos comumente na literatura com base em estudos comportamentais / Determining the requirements of materials in Small and Medium Enterprises (SMEs), whose production environment is Job Shop type, has been categorized in the literature as a problem caused by the complex underlying decision-making process, generated by the large number of variables in the manufacturing system, the appropriation levels of information technology and the characteristics of the models and tools that currently are available. Within this framework, a solution based on a multi-criteria decision model was proposed, including the execution of the elicitation process of decision maker's preferences, and supported in the generation of a decision support system (DSS) Web based. Throughout this document presents the characterization of model building steps, relevant points for choosing the Additive Model as a base, improvements made to the elicitation process and details of interaction within the software developed and the decision-making process of raw material requirements determination. It presents also the application of the model in some companies of type SME, performing a comparative analysis between expected results and those obtained using the SAD tool and compiling all the comments of decision-makers, in order to characterize, in environment real factory, the pros, cons and possible improvements of the proposed model. All applications were done in two phases: first the decision maker used the SAD in isolation, without the accompaniment of the analyst in order to get a fully external view; and in the second the decision maker used the software with analyst's direct monitoring aiming to the interaction and exchange of knowledge. The implementation of the first phase provided relevant information about how the decision-makers feel in relation to the preferences elicitation questions, to the language used, to the graphics and to other features developed in the application, concluding that if there is not an analyst, the decision maker has to think carefully in their responses and thoroughly reads the instructions. The second phase offered to decision-makers greater understanding of the elicitation process and especially regarding the use of the SAD in the sensitivity analysis step. In addition, a second model based on other theories of multi-criteria decision (Multi-attribute Utility Theory (MAUT) and Rank Dependent Utility (RDU)) was presented, with the difference that the SAD tool was tested with real data of only one company. Thus, the results of applying this model show substantial differences between using the classic method of Expected Utility (EU) and use RDU; while minor differences, but also relevant, were found between eliciting the probability weighting function and using the values of the parameters commonly suggested in the literature based on behavioral studies.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2018-05-25T13:02:54Z No. of bitstreams: 1 guilhermedesouzaferreira.pdf: 1163831 bytes, checksum: ec0bec904b2e6110d9b9e4934727f35d (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-06-14T11:52:03Z (GMT) No. of bitstreams: 1 guilhermedesouzaferreira.pdf: 1163831 bytes, checksum: ec0bec904b2e6110d9b9e4934727f35d (MD5) / Made available in DSpace on 2018-06-14T11:52:03Z (GMT). No. of bitstreams: 1 guilhermedesouzaferreira.pdf: 1163831 bytes, checksum: ec0bec904b2e6110d9b9e4934727f35d (MD5) Previous issue date: 2018-02-22 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / O escalonamento de tarefas é um problema de otimização combinatória no qual tenta-se sequenciar da melhor maneira os trabalhos a serem realizados em processos de produção. O intuito neste caso é atingir os objetivos de desempenho estipulados pelo tomador de decisão, tais como, minimizar o makespan e minimizar o atraso total. O Problema de Sequencia-mento do tipo Job-Shop Flexível (FJSP) pertence a essa categoria, e caracteriza-se pela possibilidade de haver rotas tecnológicas diferentes para as tarefas e cada estágio poder ser composto por mais de uma máquina. Esse é o núcleo da tecnologia do gerenciamento de produção, pois sequenciamentos melhores podem encurtar o tempo de manufatura, reduzir os níveis de estoque, possibilitar a entrega de encomendas no tempo correto e aumentar a credibilidade dos processos e da empresa. Métodos exatos, que são computacionalmente custosos, são geralmente aplicados nos problemas de sequenciamento menores, portanto quando os problemas aumentam em tamanho, os métodos heurísticos e metaheurísticos começaram a ser aplicados. As metaheurísticas são importantes para solucionar FJSPs porque são mais rápidas do que os métodos exatos. Dentre elas, os Algoritmos Genéti-cos (AGs) estão entre as técnicas mais utilizadas para solucionar FJSPs e, atualmente, modelos híbridos vem sendo explorados, combinando AGs com técnicas de busca local e heurísticas para inicializar a população. No entanto, a escolha adequada dos parâmetros dos AGs é um trabalho difícil, recaindo num outro problema de otimização. Os Algoritmos Genéticos Adaptativos (AGAs) foram introduzidos para lidar com essa adversidade, uma vez que podem ajustar os parâmetros dos AGs durante o processo de busca. Portanto, o objetivo da presente dissertação é analisar diferentes técnicas adaptativas desenvolvidas para AGAs, com o intuito de reduzir o tempo de configuração dos AGs quando aplicados a FJSPs. Além disso, serão propostas alterações para as técnicas de atribuição de crédito e de seleção de operadores. Os estudos foram realizados em instâncias de diferentes tamanhos e os AGAs são comparados com AGs tradicionais. Duas diferentes análises foram realizadas baseadas em cenários no qual o tomador de decisão tem pouco tempo para configurar os algoritmos. Na Análise I, os AGAs tiveram desempenho semelhante aos AGs tradicionais, mas são interessantes por possuírem um menor número de parâmetros e, consequentemente, um menor tempo de configuração. Na Análise II, os AGAs geraram melhores resultados do que aqueles obtidos pelos AGs, o que os tornam apropriados para o caso em que há incerteza no processo produtivo e menor tempo de configuração. / Scheduling is a combinatorial optimization problem, in which one tries ordering the tasks to be performed in the processing units. The objective is to achieve the best values with respect to the performance indicators chosen by the decision-maker, such as, minimize the makespan and minimize the total lateness. The Flexible Job-Shop Scheduling Problem (FJSP) belongs to this category, and its characteristics are the different technological routes for the tasks and that each stage may consist of more than one machine. This is the technological core of the production management, as better schedules may reduce the manufacturing time, reduce the inventory, deliver the order in the right time, and raise the reliability of the process and the company. Exact methods, as they are computationally expensive, are usually employed for small scheduling problems, then heuristic and metaheuristic methods become interesting techniques for this type of problem. Metaheuristics are important to solve FJSPs as they are faster than the exact methods, and among then, Genetic Algorithms (GAs) are one of the most used techniques to solve FJSPs and, currently, they have been hybridized with local search and heuristics to initialize their population. However, to set up GAs is a hard-work and often generates another optimization problem. Adaptive Genetic Algorithms (AGAs) were introduced to work around this problem as they adapt the parameters of the GAs during the search process. Therefore, the objective of this dissertation is to analyze different adaptive techniques developed for AGAs with the purpose of reducing the setup time of GAs when they are applied to FJSPs. In addition, modifications will be proposed for the operator selection techniques and for credit assignment schemes. The studies were performed in instances of different sizes, and the AGAs are compared with traditional GAs. Two different analyzes were performed based on scenarios in which the decision maker does not has to much time to configure the algorithms. In Analysis I, some AGAs performed similarly to the traditional GAs, but they are more interesting as they have a smaller number of parameters, thus a shorter configuration time. In Analysis II, some AGAsgeneratedbetterresultsthanthoseobtainedbyGAs, whichmakesthemappropriate for the case when there is uncertainty in the production process and the decision maker does not have too much time to configure the algorithm.

The topic of this thesis is valuation of selected e-shop. The  theorethical knowledge including the keyword definitions and details of  valuation methods will be worked out and processed in this thesis. These  findings will be stated in theoretical part of this thesis. The practical  part will address the actual valuation of e-shop. The practical part  will include several analyzes such as strategic and financial analysis.  There will be created three variants of the financial plan – realistic,  optimistic as well as pessimistic version. The aim  is to determine the subjective value of e-shop on the date January 1st,  2013.

Abstract Optimizing the use of resources plays an important role in today’s modern manufacturing and service organizations. Scheduling, involving setup times and costs, leads to better allocation of resources over time to perform a collection of required tasks. This compilation dissertation examines how the learning effect of workers and a combination of setup activities can be used to optimize resource utilization in manufacturing systems and maintenance services. The learning effect is a technique that can model improvement in worker’s ability as a result of repeating similar tasks. By considering the learning effect, setup times will be reduced, and a schedule can be determined to place jobs that share similar tools and fixtures next to each other. The purpose is to schedule a set of jobs in a hybrid flow shop environment while minimizing two criteria that represent the manufacturers’ and consumers’ concerns: namely maximum completion time (makespan) and total tardiness. Combining setup activities can also reduce setup times and costs. In the maintenance of systems consisting of multiple components, costs can be saved when several components are jointly maintained. By using this technique, a schedule can be determined to minimize the total cost of maintenance and renewal projects for various components and their relevant setup activities. Mathematical programming models that incorporate these aspects of the problem are developed in this research and the performance of the proposed models are tested on a set of problem instances. The results of this work show that the proposed techniques perform well in reducing setup times and costs and eliminate the need for setups through scheduling. This work proposes several exact, heuristic, and meta-heuristic methods to solve the developed models and compare their efficiency. This study contributes to the theoretical discussion of multi-criteria production and maintenance scheduling. For practitioners, this dissertation work provides optimization techniques and tools through scheduling that can help keep costs down and allow companies to operate according to time and budget constraints. / Tiivistelmä Resurssien käytön optimoinnilla on tärkeä rooli nykypäivän tuotanto- ja palveluympäristöissä. Joukko tehtäviä voidaan toteuttaa resurssitehokkaammin niille varatussa ajassa huomioimalla aikataulutuksessa asetusajat ja –kustannukset. Tämä kokoomaväitöskirja tarkastelee, kuinka työntekijöiden oppimisefektin mallinnus ja asetustoimien yhdistäminen tukevat resurssien optimointia tuotantojärjestelmissä ja kunnossapitopalveluissa. Oppimisefekti on tekniikka, jolla voidaan mallintaa työntekijän osaamisen kehittymistä samankaltaisia työtehtäviä toistettaessa. Huomioimalla oppimisefekti asetusaikoja voidaan pienentää, ja töille luoda aikataulu jossa samankaltaiset työkalut ja laitteet ovat lähellä toisiaan. Osana väitöskirjaa esitetään työerän aikataulutus tietyssä yksittäistuotantoympäristössä minimoiden kahta kriteeriä: valmistajan tavoite kokonaisläpimenoaika ja asiakkaan tavoite yksittäisten töiden aikataulussa valmistuminen. Toinen väitöskirjassa esitetty tekniikka asetusaikojen ja –kustannusten pienentämiseen on asetustöiden yhdistely. Useista komponenteista koostuvassa systeemissä kustannussäästöjä voidaan saavuttaa huoltamalla useita komponentteja yhtä aikaa. Tämän yhdistelyn avulla voidaan luoda aikataulu, joka minimoi useiden komponenttien ylläpidon, uusimisen, ja asetuskustannusten kokonaiskustannuksen. Työssä mallinnetaan näitä tekniikoita matemaattisen ohjelmoinnin keinoin, ja luotuja malleja testataan joukolla esimerkkiongelmia. Väitöskirjan tulokset osoittavat, että ehdotetuilla tekniikoilla voidaan vähentää asetusaikoja ja –kustannuksia, tai poistaa asetustöistä aiheutuvia kustannuksia kokonaan. Siinä esitetään useita eksakteja, heuristisia ja metaheuristisia menetelmiä kehitettyjen mallien ratkaisuun ja niiden suorituskyvyn vertailuun. Työn tulokset edistävät tieteellistä keskustelua monikriteeriskeduloinnin alalla, erityisesti liittyen tuotanto- ja kunnossapitosysteemeihin. Käytännön toimijoille väitöskirja tarjoaa optimointitekniikoita- ja työkaluja aikataulutukseen ja sen kautta taloudellisissa ja ajallisissa rajoitteissa toiminnan mahdollistamiseen.

This diploma thesis deals with a demand forecasting in electronic shop focused on electronics Alza.cz. The aim of the thesis is to evaluate several forecasting methods for different groups of products and to determine which of them provides the most accurate forecasts. The theoretical part is focused on electronic business, logistics cost, demand forecast, demand forecasting methods and forecast accuracy measuring methods. In practical part, selected methods are applied on data of past demand to calculate the forecasts. Afterwards the forecast accuracy is measured. At the end the thesis provides evaluation of forecast accuracy of the methods.

Submitted by Nadir Basilio (nadirsb@uninove.br) on 2016-06-01T14:43:08Z No. of bitstreams: 1 Valdemar Modolo Junior.pdf: 2802590 bytes, checksum: f3956818acd10efc3244abc007294827 (MD5) / Made available in DSpace on 2016-06-01T14:43:08Z (GMT). No. of bitstreams: 1 Valdemar Modolo Junior.pdf: 2802590 bytes, checksum: f3956818acd10efc3244abc007294827 (MD5) Previous issue date: 2015-06-10 / Among the optimization methods, the Genetic Algorithm (GA) has been producing good results in problems with high order of complexity, such as, for example, the production scheduling problem in job shop environment. The production sequencing problems must be translated into a mathematical representation, so that the AG can act. In this process we came up a problematic, the choice between different ways to represent the solution as some representations have limitations, how to present not feasible and / or redundant solutions. Therefore the aim of this study is to conduct a comparative study between different representations of the solution in the AG in production sequencing problems in job shop environments. Two representations of the solution were analyzed, the priority lists based and based on order of operations and compared with a binary representation, in the context of sequencing problem set defined by Lawrence (1984). The results were evaluated according to the total processing time (makespan), the computational cost and the proportion of generated feasible solutions. It was noticed that the representation of the solution based on order of operations, which produced 100% of feasible solutions, was the one that showed the best results although no convergence to the best known solution to every problem. / Dentre os métodos de otimização, o Algoritmo Genético (AG) vem produzindo bons resultados em problemas com ordem de complexidade elevada, como é o caso, por exemplo, do problema de sequenciamento da produção em ambiente job shop. Os problemas de sequenciamento da produção devem ser traduzidos para uma representação matemática, para que o AG possa atuar. Neste processo surgi uma problemática, a escolha entre as diferentes formas de se representar a solução visto que algumas representações apresentam limitações, como apresentar soluções não factíveis e/ou redundantes. Portanto o objetivo deste trabalho é realizar um estudo comparativo entre diferentes representações da solução no AG em problemas de sequenciamento da produção em ambientes job shop. Duas representações da solução foram analisadas, a baseada em listas de prioridades e a baseada em ordem de operações e comparada com uma representação binária, no contexto do conjunto de problemas de sequenciamento definidos por Lawrence (1984). Os resultados foram avaliados em função do tempo total de processamento (makespan), do custo computacional e da proporção de soluções factíveis geradas. Percebeu-se que, a representação da solução baseada em ordem de operações, a qual produziu 100% de soluções factíveis, foi a que mostrou os melhores resultados apesar de não apresentar convergência para a melhor solução conhecida em todos os problemas.

This diploma thesis addresses the processing of project documentation for construction of four storey mixed-use bouilding with partial basement in Velké Opatovice. The building is designed on flat terrain. In the basement are located technical utilities of the building and three cellar cubicles. On the first floor there is a beer-shop, textile shop and design office. On the second floor there is an office space for local company. The thrid floor is designed as two large-area apartments with terraces. The fourth floor is designed as one large-area apartment with terraces.

Aim of this master’s thesis was design of front-end and back-end interfaces of electronic shopping system. Design consists of completing individual use-case and workflow diagrams. Next it was explored possible security risks, designed security actions against these risks, explored payment methods usable in electronic shopping systems and methods of its implementation. There was chosen PHP programming language in combination with MySQL relation database management system to be used for development of final application. As result of this work was development of electronic shopping system final application with extended user options, ability of placement at any business type and possibilities that present-day internet user expects from electronic shopping system. To accomplishment the aim of this work contributed implementation of extended user options as advanced catalog items sorting, multi level catalog structure and advanced search options. It succeeded in choosing and implementing designed security prevention and implementing of template engine into final application. Whole system is described in detail using data modeling and class diagrams.

This thesis is focused on promoting the company Winery Josef Uher through Internet market. This is especially the design of appropriate ways of selling products of analyzed company using the internet and several options of internet promotion thanks to which the Josef Uher Winery will atrract new customers. The thesis contains theoretical knowledge of solved problems, further analysis focused on exploring the external and internal environment of the company, e-commerce and questionnaire investigation. The main part of this work depicts some ideas which should help the companies to attract new customers in the future, ensure better marketing of products and thus achieving greater profit.