Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem

Integrated-circuit wire bonding

Ta-Ho Yang, Yu An Shen

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)67-78
Number of pages12
JournalProduction Planning and Control
Volume23
Issue number1
DOIs
Publication statusPublished - 2012 Jan 1

Fingerprint

Heuristic algorithms
Integrated circuits
Scheduling
Wire
Heuristics
Heuristic algorithm
Parallel machine scheduling
Packaging
Control systems

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research

Cite this

@article{95c4f4f68de043068763ecc410126d21,
title = "Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: Integrated-circuit wire bonding",
abstract = "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.",
author = "Ta-Ho Yang and Shen, {Yu An}",
year = "2012",
month = "1",
day = "1",
doi = "10.1080/09537287.2011.572090",
language = "English",
volume = "23",
pages = "67--78",
journal = "Production Planning and Control",
issn = "0953-7287",
publisher = "Taylor and Francis Ltd.",
number = "1",

}

Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem : Integrated-circuit wire bonding. / Yang, Ta-Ho; Shen, Yu An.

In: Production Planning and Control, Vol. 23, No. 1, 01.01.2012, p. 67-78.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem

T2 - Integrated-circuit wire bonding

AU - Yang, Ta-Ho

AU - Shen, Yu An

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84855924199&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84855924199&partnerID=8YFLogxK

U2 - 10.1080/09537287.2011.572090

DO - 10.1080/09537287.2011.572090

M3 - Article

VL - 23

SP - 67

EP - 78

JO - Production Planning and Control

JF - Production Planning and Control

SN - 0953-7287

IS - 1

ER -