China
Africa
Explore chapters and articles related to this topic
Layout
Published in Michael Pecht, Handbook of Electronic Package Design, 2018
Michael D. Osterman, Michael Pecht
When considering the component placement problem, some components may be located on the board at specific locations for various engineering reasons. Min-cut techniques operate only on the components that are free to reside anywhere on the board. Thus, when performing a min-cut procedure on a board, part of the preprocessing operations is to specify the set of movable components. Breuer [12] discusses these restriction and other considerations for employing the Kernighan and Lin procedure.
More MILP models for hybrid flow shop scheduling problem and its extended problems
Published in International Journal of Production Research, 2020
Leilei Meng, Chaoyong Zhang, Xinyu Shao, Biao Zhang, Yaping Ren, Wenwen Lin
In some manufacturing shops, there is no intermediate buffer between two adjacent processing stages. For example, in the electronics industry for assembling printed circuit boards, there is no intermediate buffer between the following three stages namely solder printing, component placement, and solder reflow (Tavakkoli-Moghaddam, Safaei, and Sassani 2009; Zhang and Chen 2013; Li and Pan 2015). To the author's knowledge, no research has been done to formulate the MILP models for HFSP-UPM-B. Thus, this section extends all the MILP models proposed in Section 3.3 to solve HFSP-UPM-B.
Many-objective flow shop scheduling optimisation with genetic algorithm based on fuzzy sets
Published in International Journal of Production Research, 2021
Wen-Jie Xu, Li-Jun He, Guang-Yu Zhu
In this section, the scheduling problem of PCB assembly is studied. In PCB assembly shop, all PCB boards (jobs) will be mounted through six main processes: solder paste printing, component placement, pre-reflow automated optical inspection (AOI), reflow soldering, post-reflow AOI, final inspection and functional test. Each PCB is handled by one machine in each process and shall go through all processes. The processing time of each job at each process is different. This is a flow-shop scheduling problem and can be optimised with many objectives.