By Topic

A GSPN-Based Approach to Stacked Chips Scheduling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yong-Hee Han ; Samsung Electronics, Suwon, Korea ; Jin Young Choi

This paper discusses scheduling characteristics unique in stacked chips [including multichip package (MCP) and multidie package (MDP)] production process such as reentrant work flow and synchronization constraint. It also proposes a modeling and analytical framework for stacked chips assembly operations, which is based on the formal framework of generalized stochastic Petri net. This approach allows the seamless integration of the logical and timed dynamics of stacked chip assembly operations in a single representation. Furthermore, the proposed framework supports the analytical representation of the stacked chips scheduling problem as a mathematical programming formulation, which can be effectively solved to optimality through enumerative techniques. The framework presentation and its capabilities are elucidated by detailed application on a small system configuration for MCP.

Published in:

IEEE Transactions on Semiconductor Manufacturing  (Volume:23 ,  Issue: 1 )