A robust optimization model for the wire bonding scheduling problem

James T. Lin*, Yu Sheng Lee, Nai Fang Chang, Sheng-I Chen

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

This article considers the scheduling problem of wire bonding machine in a semiconductor assembly factory. There are unrelated parallel machines, and the decision maker is to determine the order of jobs under the environment of uncertain ready time, machine eligibility and sequence-dependent setup times. The objective is to minimize the weighted sum of setup time and delay time. A robust optimization model is proposed to obtain a close to optimal solution and satisfy all possible realizations of the uncertain data simultaneously. To solve the problem, a genetic algorithm embedded with neighborhood search operators has been developed. The chromosome has encoded with a feasibility function to penalize the violation of the constraints for certain realizations. Computational experiment shows that our method is outperformed in terms of solution quality and runtime.

Original languageEnglish
JournalProceedings of International Conference on Computers and Industrial Engineering, CIE
Volume2018-December
StatePublished - 2018
Event48th International Conference on Computers and Industrial Engineering, CIE 2018 - Auckland, New Zealand
Duration: 2 Dec 20185 Dec 2018

Keywords

  • Robust optimization model
  • Uncertain ready times
  • Unrelated parallel machine scheduling problem

Fingerprint

Dive into the research topics of 'A robust optimization model for the wire bonding scheduling problem'. Together they form a unique fingerprint.

Cite this