The assembly of printed circuit boards: A case with multiple machines and multiple board types |
| |
| Institution: | 1. Ecole d''Administration des Affaires, Universite de Liege, Boulevard du Rectorat 7 (B31), 4000 Liège, Belgium;2. Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands;3. Department of Mathematics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands;1. Department of Computer Science, Brunel University, Uxbridge, Middlesex UB8 3PH, United Kingdom;2. Communication Systems and Networks (CSN) Research Group, Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi Arabia;3. Department of Mathematics, Southeast University, Nanjing 210096, China;4. Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi Arabia;5. Department of Mechanical and Electrical Engineering, Xiamen University, Xiamen 361005, China;6. College of Electrical Engineering and Automation, Fuzhou University, Fuzhou 350002, China;7. School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China;1. Faculty of Applied Economics, Department of Engineering Management, University of Antwerp, Belgium;2. Faculty of Bioscience Engineering, Department of Biosystems, KU Leuven, Belgium |
| |
| Abstract: | In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of different types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds significantly to the complexity of the problem, which is already very hard to solve in the case of a single board type. In addition, relatively few studies deal with the multiple board type case. We propose a solution procedure based on a hierarchical decomposition of the planning problem. An important subproblem in this decomposition is the so-called feeder rack assignment problem. By taking into account as much as possible the individual board type characteristics (as well as the machine characteristics) we heuristically solve this problem. The remaining subproblems are solved using constructive heuristics and local search methods. The solution procedure is tested on real-life instances. It turns out that, in terms of the makespan, we can substantially improve the current solutions. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
