Authors: Sang-Jin Lee, Tae-Eog Lee
Addresses: Hyundai Steel Co., 167-32, Kodea-ri, Songak-myeon, Dangjin-gun, Choongnam, Korea. ' Department of Industrial and System Engineering, Korea Advanced Institute of Science and Technology (KAIST), 335 Gwahak-ro, Yuseong-gu, Daejeon, Korea
Abstract: A multi-chip package (MCP) consists of several chip modules in a single package. We consider a scheduling problem for assembling MCPs. In order to assemble an MCP, a lot should repeat assembly process stages such as die attach and wire bonding as many as the number of chips to be assembled. The two key process stages have many parallel machines of various types. A machine processes different types of MCP lots with significant setup times. We therefore should reduce the number of setups effectively while not sacrificing the on-time delivery performance significantly. We propose a scheduling strategy that first allocates the machine capacity of many parallel machines to product groups and lots depending on their production progresses appropriately and then applies known dispatching rules. We report experimental performances of the proposed methods. [Received: 21 June 2009; Revised: 03 December 2009; Accepted: 01 February 2010]
Keywords: multi-chip packages; MCP; machine capacity allocation; unrelated parallel machines; on-time delivery; OTD; setups; parallel machine scheduling; multi-chip assembly lines.
European Journal of Industrial Engineering, 2011 Vol.5 No.3, pp.327 - 337
Available online: 28 Jul 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article