The aim of this dissertation is to create a business plan for an online e-shop with food. The main aim of this paper is to evaluate the success of this business idea. This work is divided into a theoretical and practical section. The theoretical part describes the characteristics of small and medium-sized entrepreneurial businesses, and their strengthens and weaknesses. Then it describes the reasons for setting up a business, a founder's budget, and the structure of a business plan. The practical part describes the business idea. It is divided into categories and chapters according to the theoretical part. There is a conclusion at the end of my dissertation work. I am summarizing results discovered during writing this work. And I am evaluating the success of the business idea.

Ce travail de thèse s'inscrit dans le cadre d'une collaboration industrielle avec la société Volume Software pour le développement du module d'ordonnancement du logiciel "DirectPlanning". Dans ce travail, nous étudions le problème de job shop flexible multicritère et le problème de job shop multiressource multicritère. Notre objectif est de déterminer une approximation du front de Pareto. Nous avons proposé des algorithmes de résolution approchés et plus particulièrement des algorithmes de recherche Tabou et des algorithmes génétiques. Nous avons proposé différentes versions de nos méthodes pour les deux problèmes considérés. Des expérimentations ont été réalisées et montrent les bonnes performances de nos algorithmes, à la fois d'un point de vue qualité des résultats et d'un point de vue de la rapidité des méthodes.

Darbo tema - sandėliavimo apskaitos ir prekių pardavimo sistemų kūrimas. Šiuolaikinėse įmonėse, kai technologijos labai sparčiai vystosi ir gyvenimo greitis didėja yra labai svarbu viską daryti tiksliai ir greitai, taupant laiką. Todėl įmonėms svarbu turėti sistemas, kurios veikia kokybiškai, paprastai ir patikimai. Pagrindinis šio darbo tikslas- sukurti sandėliavimo ir prekių pardavimo informacinę sistemą WH2009, didmenine automobilių detalių prekyba užsiimančiai įmonei. Darbe analizuojami vartotojo keliami reikalavimai informacinei sistemai, sukurtą programa palyginama su analogiška sandėliavimo programa, nagrinėjamos panaudotos sistemos kūrime programinės priemonės. Pateiktos rekomendacijos, pastebėjimai, tolimesni sukurtos programos tobulinimo žingsniai. / The title of the project is a creation of storage accounting and goods selling systems. With a high development of technologies and lifestyle in the modern enterprises it is quite important to do everything precisely and quickly, saving the time. That is why for the enterprises it is important to have qualitatively, quickly and reliably functioning systems. The aim of this work is to create a storage accounting and goods selling data system WH2009 for an enterprise of wholesale trade of cars’ details. The consumers’ demands IS were analyzed in the work; the created programme is compared to analogical storage program; the software used in the programme creation are analyzed. The commendations, notes, future steps of programme development are given.

This research is a exploratory and descriptive study based on juvenile's perceptions with regard to shop theft. Secondary data sources were consulted to supplement the empirical data collected by means of a comprehensive questionnaire. Five hundred learners from grades 10, 11 and 12 in Mabopane were selected for the completion of the questionnaires. Shop theft was further elucidated by the application of criminological theories to explain research findings by highlighting their relationship with shop theft. Main research findings established that there are significant statistical differences with regard to the learner gender, age and grade as far as their views on shop theft were concerned. Recommendations based on the findings include teaching Criminology at secondary schools, the development of an anti shop theft youth oriented crime prevention program, shop theft educational and awareness programmes, and shoplifter offender prevention programs. / Criminology and Security Science / M.A. (Criminology)

Este trabalho dedica-se ao problema de programação em flow shop permutacional com tempos de setup separados dos tempos de processamento e independentes da seqüência de execução das tarefas com o objetivo de minimizar a duração total da programação (Makespan). Por intermédio de investigações realizadas sobre as características estruturais do problema de programação e sua solução, uma propriedade deste problema é apresentada. Esta propriedade, denominada \"Propriedade LBY\", considerando quaisquer duas tarefas adjacentes Ju e Jv (Ju imediatamente precede Jv) independentemente de suas posições na seqüência de tarefas, fornece, um limitante inferior do tempo de espera para a tarefa Jv entre o fim do seu processamento na máquina Mk e o início do seu processamento na máquina seguinte. Dois novos métodos heurísticos são desenvolvidos, com base na propriedade apresentada e no procedimento de inserção de tarefas dos conhecidos métodos N&M e NEH: um construtivo, denominado BMc; e, um melhorativo, denominado BMm. Os métodos heurísticos propostos são comparados com os métodos heurísticos melhorativos de Cao; Bedworth (1992) e Rajendran; Ziegler (1997), através de um grande número de problemas gerados aleatoriamente. Os tempos de processamento são distribuídos no intervalo [1, 99] e os tempos de setup nos intervalos de [1, 49], [1, 99], [51, 149] e [101, 199]. Os métodos são avaliados quanto à porcentagem de sucesso em obter a melhor solução, ao desvio relativo médio e o tempo médio de computação. Os resultados da experimentação computacional mostram a qualidade do método construtivo BMc e a melhor performance do método melhorativo BMm. Estes resultados são apresentados e discutidos. / This work addresses the permutation flow shop scheduling problem with separated, non-batch, and sequence-independent setup times with the objective of minimizing the total time to complete the schedule (Makespan). Following an investigation of problem structural characteristics and your solution a property of this scheduling problem is presented. This property, denoted by \"Property LBY\", given any two adjacent jobs Ju e Jv (Ju immediately precedes Jv), regardless of their position in the sequence of jobs, provides an lower bound of the waiting time for job Jv between the end of its operations on the machine Mk and the beginning on machine M(k+1). Two news heuristics methods are development, on the basis of the presented property and in the job insertion procedure of the known methods named N&M and NEH: one constructive, denote by BMc; and, one improvement, denote by BMm. The proposed heuristics methods are compared with the improvement heuristics methods of Cao; Bedworth (1992) and Rajendran; Ziegler (1997), by a large number of randomly generated problems. The processing time are sampled from a distribution ranging from [1, 99] and, the setup times are sampled from distributions ranging from [1, 49], [1, 99], [51, 149] and [101, 199]. The methods are evaluated by the percentage of success in find the best solution, the average relative deviation and the average computation time. The results of the computational investigation show the quality of the constructive heuristic method BMc and that the improvement heuristic method BMc outperforms all others. These results are presented and discussed.

This thesis focuses on the Internet shop in family business. In the first part the terms Internet shop and family business are specified. Its formation, development, advantages and disadvantages are defined, as well as the usage of Internet in marketing and the factors of success and problems connected with family business. The second part describes in detail chosen areas of the company Ryor -- the environment of its e-shop, advertising and distribution of products. This part gives a description of functioning mentioned areas. The real state is confronted with technical literature. On the basis of that, shortcomings are got. Moreover, suggestions for better functioning of chosen areas are formed. The second part of thesis also includes SWOT analysis of e-shop, analysis of competitors and questionnaire survey about customer's satisfaction with areas that the thesis explores.

The theme of this diploma thesis is design and run the e-shop with airsoft improved airsoft parts and accessories. However, the creation of the e-shop have to be for free. The e-shop will be connected with the same name site page on the social network Facebook.com, where the products will be primarily promoted. To this end, it is necessary to map and explore the possibilities for creating online store for free. Simultaneously, deploy and optimize the Facebook page mentioned before. Partial aim of this thesis is to use tools of Competitive Intelligence at the created Facebook page and on the Facebook pages of competition, to obtain important information for better or for more favorable treatment of Facebook page related to the e-shop.

This diploma thesis concerns the analyses of a particular e-shop selling specialized sports equipment. The first part of the thesis deals with a theoretical background of the internet marketing. In the next part the thesis analyses the e-shop, its competitors and compares them with each other. The main part of the thesis includes new proposals that should lead to the better and stronger position in the market and make the selling increase. In conclusion, the thesis evaluetes these propasals in terms of how it shall contribute to the increase of competitiveness of the e-shop.

The present thesis focuses on a specific e-shop operating mainly within the Czech market and the ways it uses one of the most significant tools of web analysis -- Google Analytics. The aim of the thesis is an analysis of the key areas, i.e. visitor analysis, visitor sourcing analysis and content analysis. The problematic areas are based on these as well as recommendations and suggestions that should help, once these have been applied, improve the service quality leading to increased revenue and better competitiveness within the market.

O Job Shop Scheduling Problem é um problema NP-Difícil que chama a atenção de muitos pesquisadores devido seu desafio matemático e sua aplicabilidade em contextos reais. Geralmente, principalmente em cenários próximos aos de fábricas e indústrias, obter um escalonamento ótimo por meio de métodos computacionais exatos implica em um alto desprendimento de tempo. Em contrapartida, devido às exigências de um mercado cada vez mais competitivo, as decisões de onde, como, quando e com o que produzir devem ser tomadas rapidamente. O presente trabalho propõe o desenvolvimento de um método heurístico Beam Search para solucionar o Job Shop Scheduling Problem e o Flexible Job Shop Scheduling Problem. Para isso, inicialmente um algoritmo do tipo list scheduling é definido e então o método Beam Search é construído baseado neste algoritmo. Os métodos propostos foram avaliados em diferentes níveis de complexidade utilizando instâncias da literatura que retratam diferentes cenários de planejamento. Em linhas gerais, as soluções encontradas se mostraram bastante competitivas quando comparadas a outras soluções da literatura. / The Job Shop Scheduling Problem is a NP-Hard problem which draws the attention of researchers due to both its mathematical challenge and its applicability in real contexts. Usually, mainly in industry and factory environments, an optimal schedule got by the use of exact computational methods implies in a long spending time. On the other hand, due to a more and more competitive marketplace, the decisions on where, how, when and with which to produce must be taken quickly. The present work proposes the development of an heuristic Beam Search method to solve both the Job Shop Scheduling Problem and the Flexible Job Shop Scheduling Problem. To that end, at rst a list scheduling algorithm is dened and then the Beam Search method is built based on the list scheduling algorithm. The proposed methods were evaluated over dierent complexity levels using instances from the literature that report dierent planning environments. In general terms, the solutions implemented have been proved very competitive when compared against other solutions in the literature.