Article ID: | iaor2005127 |
Country: | United Kingdom |
Volume: | 42 |
Issue: | 11 |
Start Page Number: | 2243 |
End Page Number: | 2261 |
Publication Date: | Jan 2004 |
Journal: | International Journal of Production Research |
Authors: | Chang Y.-H., Tseng H.-E., Li J.D. |
Keywords: | scheduling |
Assembly planning refers to the task where planners arrange a specific assembly sequence according to the product design description as well as to their particular heuristics in putting together all the components of a product. In assembly planning, one needs to take into consideration the relationships between components such as the geometric limitation factor before the precedence sequence is set up for assembly. This deliberation will contribute strongly to lower the production cost. Unlike traditional studies where the liaison graph goes with a genetic algorithm, an attempt is made to solve problems in assembly planning by using a genetic algorithm under the connector-based environment. Such a connector-based genetic algorithm takes a more realistic view. The key point in this approach to assembly planning is to combine the connector concept and characteristics of a genetic algorithm using object-oriented programming; thus, the programming language C++ is used to develop the mechanism of the algorithm. Finally, a stapler and a computer hard disk were used as practical examples to illustrate the possibility of such an idea. Consequently, in terms of assembly planning, it is feasible to create a genetic algorithm based on the connector's engineering features.