Abstract

A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. However, the scheduling process is usually difficult due to the wide product mix, large number of parallel machines, product family-related setups, and high weekly demand consisting of thousands of lots. In this paper, we present a new mixed-integer-linear- programming (MILP) model for the batch production scheduling of a semiconductor back-end facility with serial production stages. Computational results are provided for finding optimal solutions to small problem instances. Due to the limitation on the solvable size of the MILP formulation, a deterministic scheduling system (DSS), including an optimizer and a scheduler, is proposed to provide suboptimal solutions in a reasonable time for large real-world problem instances. Small problem instances are randomly generated to compare the performances of the optimization model and the DSS. An experimental design is utilized to understand the behavior of the DSS under different production scenarios.

Original languageEnglish (US)
Article number5752257
Pages (from-to)249-260
Number of pages12
JournalIEEE Transactions on Semiconductor Manufacturing
Volume24
Issue number2
DOIs
StatePublished - May 2011

Fingerprint

scheduling
Scheduling
Semiconductor materials
linear programming
Linear programming
integers
products
schedules
Design of experiments
delivery
formulations
optimization

Keywords

  • Heuristic
  • mixed integer linear programming
  • scheduling
  • semiconductor back-end

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Industrial and Manufacturing Engineering
  • Condensed Matter Physics
  • Electronic, Optical and Magnetic Materials

Cite this

Batch production scheduling for semiconductor back-end operations. / Fu, Mengying; Askin, Ronald; Fowler, John; Haghnevis, Moeed; Keng, Naiping; Pettinato, Jeffrey S.; Zhang, Muhong.

In: IEEE Transactions on Semiconductor Manufacturing, Vol. 24, No. 2, 5752257, 05.2011, p. 249-260.

Research output: Contribution to journalArticle

Fu, Mengying ; Askin, Ronald ; Fowler, John ; Haghnevis, Moeed ; Keng, Naiping ; Pettinato, Jeffrey S. ; Zhang, Muhong. / Batch production scheduling for semiconductor back-end operations. In: IEEE Transactions on Semiconductor Manufacturing. 2011 ; Vol. 24, No. 2. pp. 249-260.
@article{87c4f15663aa4bb18ad042d993a7cd4a,
title = "Batch production scheduling for semiconductor back-end operations",
abstract = "A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. However, the scheduling process is usually difficult due to the wide product mix, large number of parallel machines, product family-related setups, and high weekly demand consisting of thousands of lots. In this paper, we present a new mixed-integer-linear- programming (MILP) model for the batch production scheduling of a semiconductor back-end facility with serial production stages. Computational results are provided for finding optimal solutions to small problem instances. Due to the limitation on the solvable size of the MILP formulation, a deterministic scheduling system (DSS), including an optimizer and a scheduler, is proposed to provide suboptimal solutions in a reasonable time for large real-world problem instances. Small problem instances are randomly generated to compare the performances of the optimization model and the DSS. An experimental design is utilized to understand the behavior of the DSS under different production scenarios.",
keywords = "Heuristic, mixed integer linear programming, scheduling, semiconductor back-end",
author = "Mengying Fu and Ronald Askin and John Fowler and Moeed Haghnevis and Naiping Keng and Pettinato, {Jeffrey S.} and Muhong Zhang",
year = "2011",
month = "5",
doi = "10.1109/TSM.2011.2114900",
language = "English (US)",
volume = "24",
pages = "249--260",
journal = "IEEE Transactions on Semiconductor Manufacturing",
issn = "0894-6507",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Batch production scheduling for semiconductor back-end operations

AU - Fu, Mengying

AU - Askin, Ronald

AU - Fowler, John

AU - Haghnevis, Moeed

AU - Keng, Naiping

AU - Pettinato, Jeffrey S.

AU - Zhang, Muhong

PY - 2011/5

Y1 - 2011/5

N2 - A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. However, the scheduling process is usually difficult due to the wide product mix, large number of parallel machines, product family-related setups, and high weekly demand consisting of thousands of lots. In this paper, we present a new mixed-integer-linear- programming (MILP) model for the batch production scheduling of a semiconductor back-end facility with serial production stages. Computational results are provided for finding optimal solutions to small problem instances. Due to the limitation on the solvable size of the MILP formulation, a deterministic scheduling system (DSS), including an optimizer and a scheduler, is proposed to provide suboptimal solutions in a reasonable time for large real-world problem instances. Small problem instances are randomly generated to compare the performances of the optimization model and the DSS. An experimental design is utilized to understand the behavior of the DSS under different production scenarios.

AB - A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. However, the scheduling process is usually difficult due to the wide product mix, large number of parallel machines, product family-related setups, and high weekly demand consisting of thousands of lots. In this paper, we present a new mixed-integer-linear- programming (MILP) model for the batch production scheduling of a semiconductor back-end facility with serial production stages. Computational results are provided for finding optimal solutions to small problem instances. Due to the limitation on the solvable size of the MILP formulation, a deterministic scheduling system (DSS), including an optimizer and a scheduler, is proposed to provide suboptimal solutions in a reasonable time for large real-world problem instances. Small problem instances are randomly generated to compare the performances of the optimization model and the DSS. An experimental design is utilized to understand the behavior of the DSS under different production scenarios.

KW - Heuristic

KW - mixed integer linear programming

KW - scheduling

KW - semiconductor back-end

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

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

U2 - 10.1109/TSM.2011.2114900

DO - 10.1109/TSM.2011.2114900

M3 - Article

VL - 24

SP - 249

EP - 260

JO - IEEE Transactions on Semiconductor Manufacturing

JF - IEEE Transactions on Semiconductor Manufacturing

SN - 0894-6507

IS - 2

M1 - 5752257

ER -