Solving the Product and Operator assignment problem for a PC assembly factory by Genetic Algorithms

碩士 === 國立成功大學 === 製造工程研究所碩博士班 === 90 === In recent years, needs of electronic products grow rapidly. For the PC assembly, immediate response to the market needs is required. In the production planning, fast and precise product assignment design is, thus, very important. The characteristics of extrem...

Full description

Bibliographic Details
Main Authors: Yin-Chieh Hung, 洪英傑
Other Authors: Taho Yang
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/72012969592617571083
Description
Summary:碩士 === 國立成功大學 === 製造工程研究所碩博士班 === 90 === In recent years, needs of electronic products grow rapidly. For the PC assembly, immediate response to the market needs is required. In the production planning, fast and precise product assignment design is, thus, very important. The characteristics of extreme short lead time of computer assembly factories makes the assignment difficult to be planned. In addition, because of the external form of computer, automatic or semi-automatic assembly is not possible. Manual assembly is the only method. Therefore, for the assigned program, learning curve should be taken into consideration. The size effect has influence on learning curve. For example, when the assigned assembly operation of operator varies, it consumes twice the time that a single machine requires. It is due to lacking adaptation. Thus, the main issue of computer assembly program is about choosing an adequate scale between manual cost and makespan. This research targets on the development of a real-time model of computer assembly assignment. In order to be the reference of actual computer assembly factories, multiple aims arrangement between manual cost and makespan, decision of whether split the order, the quantity of assembly lines, the process of operation, and the assignment of operators are to be considered. At last, genetic algorithms will be applied in order to obtain the result.