An efficient approach to reduce search space of capacity planning for PWB assembly system: random demand

Author

Zhongsheng, Hua ; Liang, Liang ; Jin, Qin ; Guolian, Chen

Author_Institution

Sch. of Bus., Univ. of Sci. & Technol. of China, Hefei, China

Volume

3

fYear

2000

fDate

2000

Firstpage

2018

Abstract

An algorithm of determining the rough addition set for PWB assembly line capacity expansion problem under random demand is developed. For the single period problem, the algorithm can drop the size of integer decision variables dramatically and even to the extent that the corresponding problem can be directly solved by a standard integer programming code for realistic PWB assembly systems. The described algorithm can further help the heuristic search process or solving the procedure for the multiple-period problem

Keywords

assembly planning; integer programming; printed circuit manufacture; production control; assembly; capacity planning; integer programming; multiple-period problem; printed wire board; production control; random demand; search space; single period problem; Assembly systems; Capacity planning; Code standards; Computer science; Cost function; Linear programming; Production planning; Random variables; Space technology; Subcontracting;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on

Conference_Location

Hefei

Print_ISBN

0-7803-5995-X

Type

conf

DOI

10.1109/WCICA.2000.862938

Filename

862938