Two Integrated Algorithms for Minimizing the Makespan of the PCB Assembly Using Two Fuji CP Machines
碩士 === 元智大學 === 工業工程與管理學系 === 90 === The minimization of the makespan of a printed circuit board assembly process is a complex problem. In this research, we investigate the case of an assembly line containing two Fuji CP series placement machines. Decisions involved in this problem concern (a) the a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/44802820228223973617 |