Machine capacity allocation strategies for scheduling a large multi-chip assembly line

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 512
  • Download : 0
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]
Publisher
INDERSCIENCE ENTERPRISES LTD
Issue Date
2011
Language
English
Article Type
Article
Keywords

HYBRID TABU SEARCH; MINIMIZING MAKESPAN; GENETIC ALGORITHM; REENTRANT; FLOWSHOP; SHOP

Citation

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, v.5, pp.327 - 337

ISSN
1751-5254
URI
http://hdl.handle.net/10203/97990
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0