2006
DOI: 10.1504/ijmtm.2006.010059
|View full text |Cite
|
Sign up to set email alerts
|

A quota-constrained, speed control model for production scheduling in semiconductor manufacturing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Daily fab operations are usually differentiated to several levels of priorities to cope with frequent process changes, engineering experiments, or pilot production. In a fab, a lot is granted as high priority (named as Hot Lot or Super Hot Lot) if either it is going to execute several operations for experiments or inspections on process conditions; or it was borne as a pilot or risk lot for process characterization or design validation before releasing a new product for production (Liao & Tsai, 2006). Hot lots are given to higher priority to reduce their cycle time.…”
Section: Intelligent and Computer-integrated Framework For Prioritizementioning
confidence: 99%
“…Daily fab operations are usually differentiated to several levels of priorities to cope with frequent process changes, engineering experiments, or pilot production. In a fab, a lot is granted as high priority (named as Hot Lot or Super Hot Lot) if either it is going to execute several operations for experiments or inspections on process conditions; or it was borne as a pilot or risk lot for process characterization or design validation before releasing a new product for production (Liao & Tsai, 2006). Hot lots are given to higher priority to reduce their cycle time.…”
Section: Intelligent and Computer-integrated Framework For Prioritizementioning
confidence: 99%
“…Lagrangian relaxation (LR) is a decomposition and coordination approach that produce near optimal solutions with quantifiable precision in a reasonable computational time (Mao et al, 2014;Liao and Tsai, 2006) and it is extensively studied in combinatorial optimisation problems (Lin and Wu, 2005). There have been a great many studies focusing on LR, which is exploited as a practical approach for complex scheduling problems (Zhang et al, 2008;Nishi et al, 2010;Yin et al, 2016) and the competitive edge of LR to solve HFS problems has also been manifested by Sun and Yu (2015).…”
Section: Introductionmentioning
confidence: 99%