• 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.
171

Learning from a Genetic Algorithm with Inductive Logic Programming

Gandhi, Sachin 17 October 2005 (has links)
No description available.
172

MATHEMATICAL FORMULATION AND SCHEDULING HEURISTICS FOR CYCLIC PERMUTATION FLOW-SHOPS

Nambiar, Arun N. 25 September 2007 (has links)
No description available.
173

The design of an integrated production and inventory control system for a traffic sign shop

Barbosa, Wagner January 1990 (has links)
No description available.
174

Artificial Immune Systems Applied to Job Shop Scheduling

Bondal, Akshata A. 25 April 2008 (has links)
No description available.
175

A computer simulation analysis of a flow shop

Walters, Robert H. January 1984 (has links)
No description available.
176

Lot streaming in a two-stage assembly system and a hybrid flow shop

Cheng, Ming 10 October 2012 (has links)
In this dissertation, we investigate the use of lot streaming in a two-stage assembly system and a two-stage hybrid flow shop in order to improve system performance. Lot streaming accelerates the flow of a production lot through a production process by splitting it into sublots, and then, processing these sublots in an overlapping fashion over the machines, thereby reducing work-in-process and cycle-time. Traditionally, lot streaming has been applied to problems in various flow shop machine configurations. It has also been applied to machine environments of job shop, open shop, and parallel machines. Its application to assembly system is relatively new. The two-stage assembly system that we consider consists of multiple suppliers at Stage 1 with each supplier producing one type of a subassembly (or a component), and one or more assembly locations at Stage 2, where the subassemblies are then put together. Lot-attached and sublot-attached setup time and cost are encountered on the machines at both the stages, and sublot-attached time and cost are encountered for the transfer of sublots from Stage 1 to Stage 2. Mass customization is an example of such a system in which the final assembly of a product is postponed to capture specific customer demands. Dell Computer constitutes a real-life example of this system. A customer picks his/her computer processor, memory, storage, and other equipment, on Dell's web site. Dell's supply chain is configured to obtain subassemblies from suppliers (stage 1), and then, to assemble the requisite systems in different market areas (stage 2). This enables a reduction in operating cost while improving responsiveness to customers. The problem that we address is as follows: Given a maximum number of sublots of each lot, determine the number of sublots to use (assuming equal sublot sizes), and also, the sequence in which to process the lots, in order to minimize two criteria, namely, makespan, total cost. We propose two column generation-based methods that rely on different decomposition schemes. The results of our computational investigation conducted by using randomly generated data sets reveal that the proposed column generation methods obtain solutions in a few seconds of CPU time while the direct solution by CPLEX of a mixed integer programming model of the problem requires much larger CPU times. For the hybrid flow shop lot streaming problem, the machine configuration that we consider consists of one machine at Stage 1 and two machines at Stage 2 (designated as 1+2 system). A single lot is to be processed in the system, and the objective is to minimize the makespan. A removal time is associated with each sublot at Stage 1. We present a mixed integer programming model for this problem to determine optimal number of sublots and sublot sizes. First, we consider the case of a given number of sublots for which we develop closed-form expressions to obtain optimal, continuous sublot sizes. Then, we consider determination of optimal number of sublots in addition to their sizes. We develop an upper bound on optimal number of sublots, and use a simple search procedure in conjunction with the closed-form expressions for sublot sizes to obtain an optimal solution. We also consider the problem of determining integer sublot sizes, and propose a heuristic method that directly solves the mixed integer programming model after having fixed values of appropriate variables. The results of our numerical experimentation reveal the efficacy of the proposed method to obtain optimal, continuous sublot sizes, and also, that of the proposed heuristic method to obtain integer sublot sizes, which are within 0.2% of optimal solutions for the testbed of data used, each obtained within a few seconds of CPU time. The last problem that we address is an extension of the single-lot lot streaming problem for a $1+2$ hybrid flow shop considered above to the case of multiple lots, where each lot contains items of a unique product type. We consider two objectives: minimize makespan, and minimize the sum of the completion times for all the lots. The consideration of multiple lots introduces a complicating issue of sequencing the lots. We use the results derived for the single-lot problem and develop effective heuristic methods for this problem. The results of our computational investigation on the use of different heuristic methods reveal their efficacy in solving this problem. / Ph. D.
177

Entrepreneurship - an undiscovered country

Sheppy, B., McIntosh, Bryan January 2013 (has links)
Yes / The Body Shop’s business has been an entrepreneurial enterprise of remarkable success. Its core lies on the principle, pioneered by founder Anita Roddick, that ‘(…) the business of business should not be just about money, it should be about responsibility.’ The company is the symbol of the 1970’s corporate social responsibility (CSR) revolution.
178

Entrepreneurship - A new dawn

McIntosh, Bryan 10 1900 (has links)
Yes / Gold
179

A Contemporary Turkish Coffeehouse Design Based on Historic Traditions

Oral, Timur 16 April 1997 (has links)
The custom of coffee drinking in Turkey dates back to the sixteenth century coffeehouses of Istanbul, which were once important forums for community integration. Even though coffee drinking today is still an important custom in Turkey, traditional coffeehouses have lost their importance in urban areas and are rapidly being replaced by contemporary cafes that promote European themes. With the new generation placing less emphasis on traditional values and accepting a modernized lifestyle, the existence of Turkish coffeehouse culture is struggling to survive. The purpose of this thesis project was to develop a design concept for a contemporary Turkish coffeehouse franchise retaining important aspects of the traditional coffeehouses of the past. Historic features were identified through observations and visual recordings of historic Turkish coffeehouses and interviews with older patrons of traditional coffeehouses. Focus group discussions were held with graduate and undergraduate Turkish students enrolled at Virginia Tech to obtain information on their perceptions of traditional coffeehouses and responses to the idea of a contemporary coffeehouse. Based on the information gathered, design criteria were established for the design of individual coffeehouse components with a consistent image, adaptable to various sites and spaces. Coffeehouse logo, nameplate, and facade designs were proposed. Presentations for the design included detailed elevations, plans, sketches, and perspective views. / Master of Science
180

Test av OCR-verktyg för Linux / OCR software tests for Linux

Nilsson, Elin January 2010 (has links)
<p>Denna rapport handlar om att ta fram ett OCR-verktyg för digitalisering av pappersdokument. Krav på detta verktyg är att bland annat det ska vara kompatibelt med Linux, det ska kunna ta kommandon via kommandoprompt och dessutom ska det kunna hantera skandinaviska tecken.</p><p>Tolv OCR-verktyg granskades, sedan valdes tre verktyg ut; Ocrad, Tesseract och OCR Shop XTR. För att testa dessa scannades två dokument in och digitaliserades i varje verktyg.</p><p>Resultatet av testerna är att Tesseract är de verktyget som är mest precist och Ocrad är det verktyget som är snabbast. OCR Shop XTR visar på sämst resultat både i tidtagning och i antal korrekta ord.</p> / <p>This report is about finding OCR software for digitizing paper documents. Requirements were to include those which were compatible with Linux, being able to run commands via the command line and also being able to handle the Scandinavian characters.</p><p>Twelve OCR softwares were reviewed, and three softwares were chosen; Ocrad, Tesseract and OCR Shop XTR. To test these, two document were scanned and digitized in each tool.</p><p>The results of the tests are that Tesseract is the tool which is the most precise and Ocrad is the tool which is the fastest. OCR Shop XTR shows the worst results both in timing and number of correct words.</p>

Page generated in 0.039 seconds