Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Linear programming
Heuristics for scheduling flexible flow lines
Computers and Industrial Engineering
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Efficiency measures of PCB manufacturing firms using relational two-stage data envelopment analysis
Expert Systems with Applications: An International Journal
A memetic algorithm-based heuristic for a scheduling problem in printed circuit board assembly
Computers and Industrial Engineering
Using grey relation analysis and TOPSIS to measure PCB manufacturing firms efficiency in Taiwan
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
In circuit board manufacturing, the production sequencing problem with sequence dependent setups is complicated by the fact that the amount of setup required depends on not only the setup directly before the current setup, but can depend on all of the preceding setups. We present a case study that examines the use of a heuristic for estimating the expected number of setups from the sequence dependent setups. Our method is based on estimating the expected number of setups which may occur given a board-feeder setup configuration. Once estimates for the sequence dependent setups are established, they can be used to measure the similarity between boards in clustering algorithms and in nearest neighbor heuristics for group sequencing. The method is tested on an actual printed circuit board assembly system. Then, using a simulation of the assembly system, we compare the sequences generated using the expected number of setups distance measure and the Hamming distance measure to optimal sequences. Our results indicate that grouped sequences generated by using the expected number of setups had significantly better makespan performance when compared to sequences based on the more traditional Hamming distance for the particular system under study. The significant gains in makespan resulted in only moderate increases in work in process and slight increases in manual station utilization.