Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: Integrated-circuit wire bonding

Taho Yang, Yu An Shen

研究成果: Article同行評審

8 引文 斯高帕斯(Scopus)

摘要

The parallel-machine scheduling problem has been an active research field over the past decades because of its practical applications. The present study proposes job-driven scheduling heuristic (JDSH) and machine-driven scheduling heuristic (MDSH) to solve a practical-size dynamic parallel-machine scheduling problem with stochastic failures. The proposed methodology is applicable for solving an identical, uniform or an unrelated parallel-machine scheduling problem. In addition, it is sufficiently robust to accommodate product mix or demand changes. A practical-size wire-bonding workstation from an integrated-circuit packaging plant is adopted for the empirical application. The empirical results are promising, and lead to the use of MDSH as the scheduler a priori. The proposed heuristics are suitable for practical application due to their efficiency and effectiveness. When an automatic shop-floor control system is available, the proposed heuristics are seen to be superior schedulers for providing a real-time scheduling decision.

原文English
頁(從 - 到)67-78
頁數12
期刊Production Planning and Control
23
發行號1
DOIs
出版狀態Published - 2012 1月 1

All Science Journal Classification (ASJC) codes

  • 電腦科學應用
  • 策略與管理
  • 管理科學與經營研究
  • 工業與製造工程

指紋

深入研究「Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: Integrated-circuit wire bonding」主題。共同形成了獨特的指紋。

引用此