• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 35
  • 15
  • 6
  • 5
  • 3
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 90
  • 90
  • 36
  • 32
  • 20
  • 19
  • 19
  • 16
  • 16
  • 13
  • 12
  • 12
  • 11
  • 10
  • 9
  • 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.
41

SIMULATION-BASED TOLERANCE STACKUP ANALYSIS IN MACHINING

MUSA, RAMI ADNAN 02 September 2003 (has links)
No description available.
42

SIMULTANEOUS DIMENSIONAL AND TOLERANCE SYNTHESIS IN PROCESS PLANNING

SRINIVASAN, SREERAM January 2003 (has links)
No description available.
43

Space Search Based Algorithm for Cell Formation with Alternative Process Plans

Rajaraman, Srinivas January 2003 (has links)
No description available.
44

Modeling of Scheduling Algorithms with Alternative Process Plans in an Optimization Programming Language

Harihara, Ramachandra Sharma January 2004 (has links)
No description available.
45

Analysis of feature interactions and generation of feature precedence network for automated process planning

Arumugam, Jaikumar January 2004 (has links)
No description available.
46

Prediction of manufacturing operations sequence using recurrent neural networks

Mehta, Manish P. January 1997 (has links)
No description available.
47

A methodology for semantic unification of capp and MRP II data models

Rowe, Mark R. January 1996 (has links)
No description available.
48

CAD feature development and abstraction for process planning

Sivakumar, Krish January 1994 (has links)
No description available.
49

Planning and Control of Safety-Aware Plug & Produce

Massouh, Bassam January 2024 (has links)
The Plug & Produce manufacturing system is a visionary concept that promises to facilitate the seamless integration and adaptation of manufacturing resources and production processes. The Plug & Produce control system allows for the automatic addition and removal of manufacturing resources, minimizing human intervention. However, the reconfigurability and autonomous decision-making features of Plug & Produce control systems pose challenges to safety design and control functions. In contrast to conventional manufacturing systems with fixed layouts and processes, ensuring safety in Plug & Produce systems is complicated due to the complex risk assessment process, the difficulty of implementing non-restrictive safety measures covering all possible hazards, and the challenge of designing a reliable controller for consistent safe operation. This thesis addresses these challenges through various contributions. It introduces an automatic hazard identification method, considering emergent hazards after reconfiguration. A novel domain ontology is developed, incorporating safety models specific to Plug & Produce systems. The work also proposes a generic, model-based, and automatic risk assessment method, along with a method for the safe execution of plans based on the results of the risk assessment. The results of this research offer benefits to process planners, who are responsible for coordinating the manufacturing processes with product design in the Plug & Produce system. The proposed solution provides tools for process planners to validate their plans and reduces their safety-related responsibilities. The proposed safety assurance method seamlessly integrates into the multi-agent control of Plug & Produce, providing the control system with risk scenarios associated with process plans. This enables proactive and reliable control, effectively avoiding potential risks during system operation. / Föreställ dig en automatiserad produktionsanläggning som omedelbart och automatiskt kan anpassa sig till förändringar utan att kompromissa med säkerheten för den personal som arbetar där. Denna avhandling strävar efter att uppnå just detta genom ett smartare sätt att säkerställa att produktionsanläggningar baserat på Plug & Produce kan hantera säkerhet. Dettainnebär att konceptet Plug & Produce nu närmar sig ett industriellt förverkligande. Säkerhet för automatiserade produktionsanläggningar innebär att alla maskiner ska vara utrustade med skydd för att göra arbetet säkrare. Idag är det vanligt med övervakning som skydd, dvs en dator som övervakar att allt går rätt till och stänger av om något är på väg att hända. I ett produktionsavsnitt som är baserat på Plug & Produce kan man enkelt ställa om, det vill säga, lägga till eller ta bort maskiner, ändra layouten eller ändra på produkter som produceras. Efter en sådan omställning så måste säkerheten i produktionsanläggningen ses över enligt föreskrivna lagar och regler. Traditionellt så kräver detta anlitande av en säkerhetsexpert. Detta medför att en omställning utifrån ett säkerhetsperspektiv är både kostsamt och tidskrävande. Med resultatet från denna avhandling så går det nu att ställa om utan att behöva implementera nya säkerhetsfunktioner efter varje förändring. Denna forskning har utvidgat kunskapsområdet inom produktionsteknik för att skapa en "smartarefabrik" genom att inkludera säkerhetsfunktioner.Resultatet inkluderar algoritmer som kan upptäcka potentiella faror i fabriken och automatiskt tillämpa säkerhetsåtgärder för ett övervakat system. Detta innebär mindre tidsåtgång och lägre kostnader för säkerhetsarbetet. De som drar mest nytta av detta är människorna som planerar för hur saker skall tillverkas med hjälp av Plug & Produce. Resultatet av detta arbete underlättar deras arbetsuppgifter och bevarar flexibiliteten i Plug & Produce, vilket eliminerar behovet av att välja mellan flexibilitet och säkerhet
50

Optimization of the Assignment of Printed Circuit Cards to Assembly Lines in Electronics Assembly

Bhoja, Sudeer 28 September 1998 (has links)
The focus of this research is the line assignment problem in printed circuit card assembly systems. The line assignment problem involves the allocation of circuit card types to an appropriate assembly line among a set of assembly lines with the objective of reducing the total assembly time. These circuit cards are to be assembled in a manufacturing facility, capable of simultaneously producing a wide variety of printed circuit cards in different production volumes. A set of component types is required for each printed circuit card. The objective is to assign the circuit cards to the assembly line such that the total assembly time, which includes the setup time as well as the processing time required for all card types in a set, is minimized. The focus of this research is to develop an algorithmic strategy for addressing this problem in electronics assembly. This problem involves considering several interrelated decision problems such as assigning printed circuit cards to assembly lines, grouping circuit cards into families to reduce the number of setups, and assigning component types to machines to balance workload. The line assignment models are formulated as large scale mixed integer programming problems and are solved using a branch-and-bound algorithm, supplemented by techniques for improving the solution time. The models and solution approaches are demonstrated using industry representative data sets and can serve as useful decision support tools for process planning engineers. / Master of Science

Page generated in 0.1134 seconds