By Brahim Rekiek

Efficient meeting line layout is an issue of substantial business significance. regrettably, like many different layout tactics, it may be time-consuming and repetitive. as well as this, meeting line layout is frequently complicated due to the variety of a number of elements concerned: line potency, rate, reliability and area for instance. the most target is to combine the layout with operations concerns, thereby minimising its costs.

Since it truly is most unlikely to switch a designer’s intelligence, adventure and creativity, it is very important supply him with a collection of suggestions instruments in an effort to meet the conflicting ambitions concerned. Assembly Line Design offers 3 thoughts in keeping with the Grouping Genetic set of rules (a robust and commonly acceptable optimisation and stochastic seek strategy) which might be used to help effective meeting line design:

• ‘equal piles for meeting lines’, a brand new set of rules brought to accommodate meeting line balancing (balancing stations’ loads);

• a brand new procedure in line with a a number of target grouping genetic set of rules (MO-GGA) aiming to accommodate source making plans (selection of kit to hold out meeting tasks);

‘• stability for operation’ (BFO), brought to accommodate the adjustments in the course of the operation part of meeting traces.

Assembly Line Design might be of curiosity to technical team of workers operating in layout, making plans and construction departments in in addition to managers in who are looking to study extra approximately concurrent engineering. This publication can be of worth to researchers and postgraduate scholars in mechanical, production or micro-engineering.

Show description

Read or Download Assembly Line Design: The Balancing of Mixed-Model Hybrid Assembly Lines with Genetic Algorithms PDF

Similar structured design books

Java(tm) for S/390® and AS/400® COBOL Programmers

The booklet may still specialize in Java on AS400. additionally it makes use of visible Age that is superseded may still use Websphere in its place. the code isn't transparent because it attempts to check COBOL(structure programing) with Java(Object orientated

Web Work: Information Seeking and Knowledge Work on the World Wide Web

This booklet brings jointly 3 nice motifs of the community society: the looking and utilizing of knowledge via participants and teams; the construction and alertness of information in companies; and the elemental transformation of those actions as they're enacted on the net and the area broad internet.

On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops: OTM Confederated International Workshops and Posters, AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007, Vilamoura, Portugal

This two-volume set LNCS 4805/4806 constitutes the refereed lawsuits of 10 overseas workshops and papers of the OTM Academy Doctoral Consortium held as a part of OTM 2007 in Vilamoura, Portugal, in November 2007. The 126 revised complete papers awarded have been rigorously reviewed and chosen from a complete of 241 submissions to the workshops.

Dynamic Data-Driven Environmental Systems Science: First International Conference, DyDESS 2014, Cambridge, MA, USA, November 5-7, 2014, Revised Selected Papers

This ebook constitutes the refereed lawsuits of the 1st overseas convention on Dynamic Data-Driven Environmental platforms technological know-how, DyDESS 2014, held in Cambridge, MA, united states, in November 2014.

Extra resources for Assembly Line Design: The Balancing of Mixed-Model Hybrid Assembly Lines with Genetic Algorithms

Sample text

Use of Penalty Functions. This method is based on both ‘constraints satisfaction’ method and ‘weighting objectives’ method. The basic idea is to ‘punish’ the fitness value of a solution whenever it violates some constraints. 2 Non-Pareto Approaches These methods are used to overcome difficulties and the limitations involved in the aggregating approaches. Vector Evaluated Genetic Algorithm. Schaffer [145] developed an approach approach to use an extension of the simple GA (called vector evaluated GA, ‘VEGA’).

Deterministic Time. In the case of manual ALs, the task time is constant only in the case of highly qualified and motivated workers. More advanced machines and robots are able to work permanently at a constant speed. One can reduce the task time variation by increasing the line’s automation degree. Stochastic Time. In automated flow line, varying production rates may result from machine breakdowns. Furthermore, significant variation may result from non-qualified workers, motivations of the employees, lack of training, etc.

The partial ordering of tasks can be illustrated by means of a precedence graph [142]. The nodes represent tasks and the directed arcs (i, j) constitute precedence relationships. 4 task 4 is preceded by tasks 1 and 2. 4. Precedence graph Cycle Time (C). This is the time between the exit of two consecutive products from the line. It represents the maximal amount of work processed by each station. The desired C is what the planning department asks for, while the effective C (EC) is the real C by which the line will operate.

Download PDF sample

Rated 4.40 of 5 – based on 31 votes