Hybrid estimation of distribution algorithm with multiple subpopulations for semiconductor manufacturing scheduling problem with limited waiting-time constraint

Hung Kai Wang, Chen Fu Chien, Mitsuo Gen

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)

Abstract

This paper considers a semiconductor manufacturing scheduling problem (SMSP), subjected to all the practical constraints such as limited waiting time, machine status, different process time on different machines, setup time and arrival time in wafer fabrication facilities (fabs) of semiconductor manufacturing industry. A hybrid estimation of distribution algorithm with multiple subpopulations (HEDA-MS) is proposed to solve SMSP effectively within several specified minutes for an online scheduling requirement. An empirical study simulates eight scenarios from practical data to compare the performance of HEDA-MS and GA, not only to minimize the makespan, but to make total exceeded of limited waiting time into zero. For all the scenarios, the proposed HEDA-MS obtains a smaller makespan than GA with less total exceeded limited waiting time.

Original languageEnglish
Article number6899311
Pages (from-to)101-106
Number of pages6
JournalIEEE International Conference on Automation Science and Engineering
Volume2014-January
DOIs
Publication statusPublished - 2014
Event2014 IEEE International Conference on Automation Science and Engineering, CASE 2014 - Taipei, Taiwan
Duration: 2014 Aug 182014 Aug 22

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Hybrid estimation of distribution algorithm with multiple subpopulations for semiconductor manufacturing scheduling problem with limited waiting-time constraint'. Together they form a unique fingerprint.

Cite this