Group set-up for printed circuit board assembly
- 1 October 1989
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 27 (10) , 1795-1810
- https://doi.org/10.1080/00207548908942655
Abstract
The current practice in the assembly of electronic components on printed circuit boards (PCBs) is serial production, a process characterized by very long set-up times. However, with the advent of efficient on-line process information, new production control methods are now possible. This paper proposes a different production method, called the group set-up (GSU) method, which can significantly reduce set-up times. The traditional and the GSU production methods are compared, and it is shown that the GSU always performs better than the traditional method in terms of total production flow (throughput) and labour time. However, the traditional method performs better than the GSU in terms of work in process (WIP) inventory; and in some cases, in terms of makespan (lead time). A detailed analysis for a small number of PCBs is presented.Keywords
This publication has 10 references indexed in Scilit:
- Soft configuration in automated insertionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A LISP-based heuristic scheduler for automatic insertion in electronics assemblyInternational Journal of Production Research, 1986
- A job scheduling model for a flexible manufacturing machinePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Establishing Consistent and Realistic Reorder Intervals in Production-Distribution SystemsOperations Research, 1985
- Grouping problem in scheduling flexible manufacturing systemsRobotica, 1985
- Analysis of integer programming formulations of clustering problemsImage and Vision Computing, 1984
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly SystemsManagement Science, 1984
- Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithmInternational Journal of Production Research, 1980
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Problem Decomposition and Data Reorganization by a Clustering TechniqueOperations Research, 1972