An Assignment-Balance-Optimization Algorithm for Minimizing Production Cycle Time of a Printed Circuit Board Assembly Line

Title & Authors
An Assignment-Balance-Optimization Algorithm for Minimizing Production Cycle Time of a Printed Circuit Board Assembly Line
Lee, Sang-Un;

Abstract
This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $\small{T^*}$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.
Keywords
Assembly line;Cycle time;Assignment;Balanced;Swap optimization;
Language
Korean
Cited by
References
1.
J. C. Ammonds, M. Carlyle, L. Cranmer, G. Depuy, K. Ellis, L. F. McGinnis, C. A. Tovey, and H. Xu, "Component Allocation to Balance Workload in Printed Circuit Card Assembly System," IIE Transactions, Vol. 29, No. 4, pp. 265-275, Apr. 1997.

2.
D. M. Kodek and M. Krisper, "Optimal Algorithm for Minimizing Production Cycle Time of a Printed Circuit Board Assembly Line," International Journal of Production Research, Vol. 42, No. 23, pp. 5031-5048, Dec. 2004.

3.
P. Ji and Y. F. Wan, "Minimizing Cycle Time for PCB Assembly Lines: An Integer Programming Model and a Branch-and-Bound Approach," International Journal of Information and Management Sciences, Vol. 19, No. 2, pp. 237-243, Jun. 2008.

4.
Z. Drezner, and S. Nof, "On Optimizing Bin Picking and Insertion Plans for Assembly Robots," IIE Transactions, Vol. 16, No. 3, pp. 262-270, Jan. 1984.

5.
H. O. Gunther, M. Gronalt, and F. Piller, "Component Knitting in Semi-Automated Printed Circuit Board Assembly," International Journal of Production Economics, Vol. 43, No. 2-3, pp. 213-226, Jun. 1996.

6.
R. E. Watkins and J. K. Cochran, "A Line Balancing Heuristic Case Study for Existing Automated Surface Mount Assembly Line Setups," Computers and Industrial Engineering, Vol. 29, No. 1-4, pp. 681-685, Sep. 1995.

7.
H. Ho and P. Ji, "PCB Assembly Line Assignment: A Genetic Algorithm Approach," Journal of Manufacturing Technology, Vol. 16, No. 6, pp. 682-692, Aug. 2005.

8.
P. Neammancee and S. U. Randhawa, "Integrated Methodology for Board Assignment and Component Allocation in Printed Circuit Board Assembly," International Journal of Production Research, Vol. 41, No. 5, pp. 919-937, Feb. 2003.

9.
N. Thakoor, V. Devarajan, and J, Gao, "Computation Complexity of Branch-and-Bound Model Selection," IEEE 12th International Conference on Computer Vision (ICCV), pp. 1895-1900, Sep. 2009.

10.
T. H. Lee and S. S. Park, "An Integer Programming Approach to the Time Slot Assignment Problem in SS/TDMA Systems with Intersatellite Links," European Journal of Operational Research, Vol. 135, No. 1, pp. 57-66, Nov. 2001.

11.
J. P. Jue, "Lightpath Establishment in Wavelength-Routed WDM Optical Networks," Optical networks, Kluwer Academic Publishers, pp. 99-122, 2001.

12.
S. U. Lee, "An Assignment Problem Algorithm Using Minimum Cost Moving Method," Journal of KSCI, Vol. 20, No. 8, pp. 105-112, Aug. 2015.

13.
S. U. Lee, "Linear Bottleneck Assignment Problem Based on Reverse-delete Algorithm," Journal of IIBC, Vol. 13, No. 6, pp. 211-220, Dec. 2013.

14.
S. U. Lee, "The Assignment-Swap Algorithm for Large-scale Transportation Problem with Incomplete Cost Lists," Journal of KSCI, Vol. 20, No. 6, pp. 51-58, Jun. 2015.