Daily planning and scheduling system for the EDS process in a semiconductor manufacturing facility

Young Hoon Lee, Myoungsoo Ham, Bruce Yoo, Jae Sun Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Operations management in a complex manufacturing environment is practiced hierarchically: production planning and scheduling in sequence since the integrated approach is not efficient and practical. Production targets and allocation to the equipment are determined in the planning procedure by considering the only the critical factors, and the detailed scheduling is determined with more information needed to accomplish the production targets provided in the planning step. There is always, therefore, a gap between the planning and scheduling procedure, and some control parameters or factors are used to control those gaps. In this paper an approach connecting two procedures is suggested, which can be applied in the EDS (electrical die sorting) or the probe process in the semiconductor manufacturing. The EDS process requires very flexible operation management since the manufacturing processing time is relatively short and the supply of upstream fabrication and the demand of downstream assembly have to be met simultaneously. Daily planning and scheduling procedure are modeled to minimize the tester change-over within the daily target. Because of the relatively long setup change-over time, daily planning and scheduling have to be performed so that the time needed for the device and probe card change is minimized as possible. Mathematical programming is suggested for the problem, and the modified model is developed which can be solved in a practical computational time on a daily base. The scheduling heuristic with the planning data obtained from the suggested model, is designed, and their performance is evaluated through the computational experiment.

Original languageEnglish
Pages (from-to)568-579
Number of pages12
JournalInternational Journal of Advanced Manufacturing Technology
Volume41
Issue number5-6
DOIs
Publication statusPublished - 2009 Mar 1

Fingerprint

Sorting
Scheduling
Semiconductor materials
Planning
Mathematical programming
Fabrication
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Mechanical Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Cite this

@article{5823e191c74f458089e7ef10202b8073,
title = "Daily planning and scheduling system for the EDS process in a semiconductor manufacturing facility",
abstract = "Operations management in a complex manufacturing environment is practiced hierarchically: production planning and scheduling in sequence since the integrated approach is not efficient and practical. Production targets and allocation to the equipment are determined in the planning procedure by considering the only the critical factors, and the detailed scheduling is determined with more information needed to accomplish the production targets provided in the planning step. There is always, therefore, a gap between the planning and scheduling procedure, and some control parameters or factors are used to control those gaps. In this paper an approach connecting two procedures is suggested, which can be applied in the EDS (electrical die sorting) or the probe process in the semiconductor manufacturing. The EDS process requires very flexible operation management since the manufacturing processing time is relatively short and the supply of upstream fabrication and the demand of downstream assembly have to be met simultaneously. Daily planning and scheduling procedure are modeled to minimize the tester change-over within the daily target. Because of the relatively long setup change-over time, daily planning and scheduling have to be performed so that the time needed for the device and probe card change is minimized as possible. Mathematical programming is suggested for the problem, and the modified model is developed which can be solved in a practical computational time on a daily base. The scheduling heuristic with the planning data obtained from the suggested model, is designed, and their performance is evaluated through the computational experiment.",
author = "Lee, {Young Hoon} and Myoungsoo Ham and Bruce Yoo and Lee, {Jae Sun}",
year = "2009",
month = "3",
day = "1",
doi = "10.1007/s00170-008-1505-6",
language = "English",
volume = "41",
pages = "568--579",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "5-6",

}

Daily planning and scheduling system for the EDS process in a semiconductor manufacturing facility. / Lee, Young Hoon; Ham, Myoungsoo; Yoo, Bruce; Lee, Jae Sun.

In: International Journal of Advanced Manufacturing Technology, Vol. 41, No. 5-6, 01.03.2009, p. 568-579.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Daily planning and scheduling system for the EDS process in a semiconductor manufacturing facility

AU - Lee, Young Hoon

AU - Ham, Myoungsoo

AU - Yoo, Bruce

AU - Lee, Jae Sun

PY - 2009/3/1

Y1 - 2009/3/1

N2 - Operations management in a complex manufacturing environment is practiced hierarchically: production planning and scheduling in sequence since the integrated approach is not efficient and practical. Production targets and allocation to the equipment are determined in the planning procedure by considering the only the critical factors, and the detailed scheduling is determined with more information needed to accomplish the production targets provided in the planning step. There is always, therefore, a gap between the planning and scheduling procedure, and some control parameters or factors are used to control those gaps. In this paper an approach connecting two procedures is suggested, which can be applied in the EDS (electrical die sorting) or the probe process in the semiconductor manufacturing. The EDS process requires very flexible operation management since the manufacturing processing time is relatively short and the supply of upstream fabrication and the demand of downstream assembly have to be met simultaneously. Daily planning and scheduling procedure are modeled to minimize the tester change-over within the daily target. Because of the relatively long setup change-over time, daily planning and scheduling have to be performed so that the time needed for the device and probe card change is minimized as possible. Mathematical programming is suggested for the problem, and the modified model is developed which can be solved in a practical computational time on a daily base. The scheduling heuristic with the planning data obtained from the suggested model, is designed, and their performance is evaluated through the computational experiment.

AB - Operations management in a complex manufacturing environment is practiced hierarchically: production planning and scheduling in sequence since the integrated approach is not efficient and practical. Production targets and allocation to the equipment are determined in the planning procedure by considering the only the critical factors, and the detailed scheduling is determined with more information needed to accomplish the production targets provided in the planning step. There is always, therefore, a gap between the planning and scheduling procedure, and some control parameters or factors are used to control those gaps. In this paper an approach connecting two procedures is suggested, which can be applied in the EDS (electrical die sorting) or the probe process in the semiconductor manufacturing. The EDS process requires very flexible operation management since the manufacturing processing time is relatively short and the supply of upstream fabrication and the demand of downstream assembly have to be met simultaneously. Daily planning and scheduling procedure are modeled to minimize the tester change-over within the daily target. Because of the relatively long setup change-over time, daily planning and scheduling have to be performed so that the time needed for the device and probe card change is minimized as possible. Mathematical programming is suggested for the problem, and the modified model is developed which can be solved in a practical computational time on a daily base. The scheduling heuristic with the planning data obtained from the suggested model, is designed, and their performance is evaluated through the computational experiment.

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

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

U2 - 10.1007/s00170-008-1505-6

DO - 10.1007/s00170-008-1505-6

M3 - Article

VL - 41

SP - 568

EP - 579

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 5-6

ER -