• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 296
  • 159
  • 88
  • 50
  • 26
  • 26
  • 23
  • 18
  • 14
  • 13
  • 9
  • 9
  • 8
  • 6
  • 4
  • Tagged with
  • 808
  • 154
  • 135
  • 135
  • 109
  • 107
  • 104
  • 95
  • 89
  • 83
  • 67
  • 62
  • 61
  • 55
  • 55
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
241

Contribution à l'ordonnancement conjoint de la production et de la maintenance : Application au cas d'un Job Shop.

Harrath, Youssef 16 December 2003 (has links) (PDF)
Le contexte de notre travail s'intéresse à l'ordonnancement d'un atelier de type job shop. L'objectif de la thèse concerne l'élaboration d'une méthode de résolution aussi bien dans le cas classique d'un ordonnancement relatif à la production que dans le cas beaucoup moins étudié touchant l'ordonnancement conjoint de la production et de la maintenance. Les algorithmes génétiques ayant fait leur preuve dans le domaine aussi bien mono objectif que multiobjectif seront à la base de notre étude. Etude faite tout d'abord sur un problème classique de job shop noté J / / Cmax , en ne tenant pas compte des contraintes de disponibilité des machines, puis en introduisant dans un deuxième temps l'aspect de maintenance préventive ayant des objectifs parfois antagonistes avec la production et qui nécessite une résolution multiobjectif. Notre contribution comporte deux volets. Le premier volet prend appui sur les solutions générées par un algorithme génétique qui sont étudiées par des méthodes d'apprentissage. Méthodes qui seront resituées dans le processus d'Extraction de Connaissance à partir des Données (ECD). Dans un soucis de validation et de comparaison par rapport aux travaux faits dans la communauté, la démarche proposée a été élaborée sur un problème classique de type J / / Cmax et sur des benchmarks connus. Le deuxième volet propose un algorithme génétique Pareto optimal résolvant le problème d'ordonnancement conjoint de la production et de la maintenance au sein du job shop. Cet algorithme génétique génère des solutions Pareto optimales. Solutions que nous validerons par des bornes inférieures. Nous optons pour la maintenance préventive systématique pour l'appliquer dans l'atelier de job shop. L'une des difficultés majeures de ce type de maintenance est le choix des périodes d'interventions. Nous proposons dans ce cadre deux méthodes de choix de périodes systématiques.
242

Decision-making at operational level

Spasova, Paraskeva January 2007 (has links)
<p>One of the universal characteristics of all organization concerns their attempts to achieve high product quality at low price. For that reason, the contemporary organizations direct their attempts to improve the utilization of workers’ potential and adopt the line-stopping strategies at the shop .The research presented in this thesis aims at analyzing and revealing to what extent the decisions at the shop floor depend on operators. The conclusions drawn in this paper contribute to determination of the scope of operators’ responsibilities and examination of the ways in which workers maintain the process uninterrupted. The role of operators for attaining the desired product quality is presented as well. These objectives have been accomplished through theoretical work.</p>
243

Tvarkaraščių sudarymo uždavinių ir jų algoritmų tyrimas / Analysis of scheduling problems and their algorithms

Kairaitis, Gediminas 25 August 2010 (has links)
Tvarkaraščių sudarymo uždaviniai – viena iš sunkiau sprendžiamų problemų, kylančių įvairiose gamybinėse struktūrose, grupė. Darbo pradžioje supažindinama su bendrais tvarkaraščių sudarymo uždavinių bruožais ir jų sprendimo algoritmais. Detaliau nagrinėti šiame darbe parenkamas vienas sunkiausių gamybinių tvarkaraščių ir apskritai kombinatorinių optimizavimo uždavinių – darbo fabriko uždavinys (angl. job shop scheduling problem), kuris be abejo nėra tiksliai sprendžiamas per polinominį sprendimo laiką. Šio uždavinio pradiniai duomenys yra duotos darbų ir įrenginių aibės. Kiekvienas darbas apdorojamas specifine įrenginių tvarka. Uždavinio tikslas – minimizuoti visų darbų atlikimo laiką. Šiam uždaviniui spręsti pristatėme du apytikslius tabu – atkaitinimo modeliavimo bei paieškos kintamose aplinkose algoritmus, priklausančius metaeuristinių metodų šeimai. Iš tabu – atkaitinimo modeliavimo galima nesunkiai gauti paprastą tabu paiešką, tad prie dviejų minėtų algoritmų galima pridėti ir paprastąją tabu paiešką. Šiame darbe atlikta minėtų algoritmų programinė realizacija. Pristatytų algoritmų efektyvumui įvertinti ir algoritmų parametrų parinkimo rekomendacijoms pateikti, buvo pasirinkti gerai literatūroje žinomi bei sunkiau sprendžiami etaloniniai darbo fabriko uždavinių pavyzdžiai. Darbo pabaigoje pateikiamos minėtų algoritmų parametrų parinkimo rekomendacijos ir aptariamas algoritmų efektyvumas, kuris nagrinėtuose uždaviniuose nebuvo pastovus minėtų trijų algoritmų atvejais, t... [toliau žr. visą tekstą] / At the beginning of this work we introduce to the combinatorial optimization, scheduling problems and methods used to solve them. In computer science scheduling problems is considered strongly NP-complete. The combinatorial optimization problem considered in this paper is a static job shop problem scheduling arising in the manufacturing processes. In the static job shop scheduling problem, a finite number of jobs are to be processed by a finite number of machines. Each job consists of a prederminated sequence of task operations, each of which needs to be processed without preemption for a given period of time on a given machine. Tasks of the same job cannot be processed concurrently and each job must visit each machine exactly once. A schedule is an assignment of operation to time slots on a machine. The makespan is the maximum completion time of the jobs and the objective of the job shop scheduling problem is to find a schedule that minimizes the makespan. When the size of problem increases, the computational time of the exact methods grows exponentially. Therefore, the recent research on job shop and other scheduling problems is focused on heuristic algorithms. We also presented some meta-heuristic algorithms such as Tabu search – Simulated annealing (TS/SA), Tabu Search (TS), Variable Neighborhood Search (VNS) and showed their results on some job shop instances. At the end of this work we tell recommendations about choosing suitable parameters.
244

Conscientious objectors, closed shop agreements and freedom of association / by J.J. van der Merwe

Van der Merwe, Johannes Jacobus January 2005 (has links)
Section 26 of the Labour Relations Act 95 of 1996 makes provision for the introduction of closed shop agreements at the workplace between majority unions and employers. All employees covered by such agreements are required to be members of such unions or otherwise face the possibility of dismissal. "Conscientious objector" employees are an exception to this rule. The purpose of this submission is to investigate the constitutional validity of s26 in the light of the fundamental right to freedom of association in the Constitution of the Republic of South Africa, 1 996 whilst investigating the position of "conscientious objectors" in certain foreign jurisdictions. / Thesis (LL.M. (Labour Law))--North-West University, Potchefstroom Campus, 2006.
245

The Identification of Effective Practices for Teaching Multiple Shop Activities

Campbell, Robert Dale 05 1900 (has links)
This study was conducted to identify certain effective practices currently being utilized in teaching multiple activity industrial arts classes. The study was concerned with those practices being used in middle school, junior high school, and intermediate school general shop classes where multiple activities were being taught.
246

TOWARDS A REFLECTIVE-AGILE LEARNING MODEL AND METHOD IN THE CASE OF SMALL-SHOP SOFTWARE DEVELOPMENT: EVIDENCE FROM AN ACTION RESEARCH STUDY

Babb, Jeffry 13 April 2009 (has links)
The ascension and use of agile and lightweight software development methods have challenged extant software design and development paradigms; this is especially notable in the case of small-team and small-shop software development. In this dissertation, a Reflective-Agile Learning Method and Methodology (RALMM) for small-shop software development, is proposed to enhance communication and learning in the use of agile methods. The purpose of the inquiry in this dissertation pertains to: the nature of the professional practice of small team software development; the implications of the epistemology of Reflective Practice has for the professional practice of small-team software development; and whether the introduction of Reflective Practice to an extant agile methodology improves process, productivity and professional confidence for a small development team. This dissertation uses Dialogical Action Research (Mårtensson and Lee 2004), or Dialogical AR, a qualitative and interpretive research approach, to iteratively develop and refine the Reflective-Agile Learning Model and Method (RALMM). The proposed model and method also considers Hazzan and Tomayko’s (2002, 2004, and 2005) synthesis of Schön’s (1983, 1987) Reflective Practice and Extreme Programming (XP). RALMM is shaped by Argyris and Schön’s theories of practice (1974) and Organizational Learning (1978, 1996) and Schön’s ancillary work on generative metaphor (1979) and frames (Schön et al. 1994). The RALMM artifact was developed in a Dialogical AR Partnership using Lee’s (2007) framework for synthesizing design science and action research. The development and use of RALMM facilitated theorizing on the role of Reflective Practice in the successful use of agile methods. To assist in interpretation and analysis, the data collected during Dialogical AR cycles are analyzed using Strauss and Corbin’s (1998) Grounded Theory as a mode of analysis to guide in the coding and analysis of qualitative evidence from the research. As a result of this research, RALMM improved the practitioners’ processes and productivity. Furthermore, RALMM helped to establish, formalize and reinforce a team learning system for the continued development of the practitioners’ professional repertoire. Additionally, the iterative development of RALMM provides a basis for theorizing on Reflective Practice as an epistemology, paradigm, metaphor and frame of reference for the professional practice of small-shop software development.
247

Uživatelské preference v prostředí prodejních webů / User preferences in the domain of web shops

Peška, Ladislav January 2011 (has links)
The goal of the thesis is first to find available information about user preferences, user feedback and their acquisition, processing, storing etc. The collected information is then used for making suggestions / advices for the creating an recommender system for the web shops (with special emphasis on implicit feedback). The following chapters introduces UPComp - our solution of the recommender system for the web shops. The UPComp is written in the programming language PHP and uses MySQL database. The thesis also includes testing of the UPComp on real-user web shop sites slantour.cz and antikvariat-ichtys.cz.
248

Marketingový výzkum merchandisingu české fotbalové reprezentace / Marketing research of merchanidising Czech national football team

Pata, Tomáš January 2011 (has links)
Title: Marketing research of merchandising of Czech national football team Objectives: The aim of this work is to try out the position of registered users on the website www.fotbal.cz the breadth of supply and affordability of products, merchandising Czech national football team in official e-shop and stand in the stadium for home matches, the Czech national football team. The interpretation of the results to be obtained through marketing research, the task of proposing suggestions for improvements to current product offerings and optimize merchandising and increase awareness of the official e-shop merchandising Czech national football team. Methods: To obtain data from respondents was used method of electronic polling. Questionnaires were stored using the Internet with Google Docs. Results: Respondents expressed a comprehensive merchandising Czech national football team. Evaluation of the data was the basis for the determination of proposals and recommendations to improve the overall merchandising. These proposals and recommendations aimed at the marketing agency STES and company BIGSPORT. Keywords: football, marketing research, merchandising, product, stadium, e-shop
249

Systém pro on-line výměnu dat mezi webovým systémem a ERP systémem / System for Online Data Interchange between Web and ERP System

Pekař, Daniel Unknown Date (has links)
The paper describes a layout and a development of the software product used for fully automatic data exchange and synchronization between a business information system (ERP system) and a web system (an e-shop). The reason for designing such a system is an effort to minimize human work performed when handling the data in both systems. The data integrity in both systems is established due to this mechanism and a significant time saving is likewise a key factor. If the data are changed in one system, the changes are detected and synchronized with the data from the other system which constantly ensures up to date data.
250

Práva z vadného plnění ve spotřebitelských smlovách / Rights from defective performance in consumer contracts

Nováková, Kristýna January 2019 (has links)
1 Rights from defective performance in consumer contracts Abstract This diploma thesis deals with rights from defective performance in consumer contracts, with both the general regulation of the rights of defective performance in the contract between the entrepreneur and the consumer, as well as the specific rights of defective performance in this contract in the case of the purchase contract and contract for work. The thesis contains definitions of the basic subjects of consumer law, as well as legal terms, which are often associated with the application of legal rules of consumer law. Such terms are defective performance, as well as individual types of defects, or even the disputed warranty under the law or voluntary contractual guarantees provided by the seller. This thesis deals in detail with the rights of defective performance, which belongs to the buyer in case of conclusion of the purchase contract. A special focus is given to the special subsection of civil code on the sale of goods in the shop. The part of this thesis is also the definition of the term of complaint, the exercise of the right from defective performance in terms of its content, manner or form, or the work also represents the persons entitled or compulsory to complain. The thesis also solves problems with proper application of the...

Page generated in 0.0307 seconds