Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yi-Shiuan Shen

dblp:75/5397 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Mathematical optimization · 89% Automated reasoning and model checking · 11%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
scheduling
0.012003
Colored timed petri-net and GA based approach to modeling and scheduling for wafer probe center · ICRA 2003
Mathematical optimization
auction algorithm
0.012004
Adaptive Lot/equipment Matching Strategy and GA based Approach for Optimized Dispatching and Scheduling in a Wafer Probe Center · ICRA 2004
Mathematical optimization
combinatorial optimization
0.012004
Adaptive Lot/equipment Matching Strategy and GA based Approach for Optimized Dispatching and Scheduling in a Wafer Probe Center · ICRA 2004
Mathematical optimization › evolutionary computation
genetic algorithm
0.012004
Adaptive Lot/equipment Matching Strategy and GA based Approach for Optimized Dispatching and Scheduling in a Wafer Probe Center · ICRA 2004
Mathematical optimization
metaheuristic optimization
0.012004
Adaptive Lot/equipment Matching Strategy and GA based Approach for Optimized Dispatching and Scheduling in a Wafer Probe Center · ICRA 2004
Automated reasoning and model checking
petri net analysis
0.012003
Colored timed petri-net and GA based approach to modeling and scheduling for wafer probe center · ICRA 2003

Methods — techniques the papers use, named apart from their topics

genetic algorithm · 0.1colored-timed petri nets · 0.1auction algorithm · 0.0heuristic rules · 0.0
YearPublicationVenuePosition
2004 Adaptive Lot/equipment Matching Strategy and GA based Approach for Optimized Dispatching and Scheduling in a Wafer Probe Center
abstract
In this paper, we use a graphical and mathematical modeling tool colored-timed Petri nets (CTPN) to model the testing flow in the wafer probe center. With this CTPN model, we can simulate the production processes, and keep track of the equipment status and the lot conditions efficiently and precisely. In the dispatching phase, we present the lot-based and the equipment-based selection schemes. Each of these two schemes has its own advantages, but also some drawbacks. Therefore, we propose a new approach pair generation mechanism and adaptive lot/equipment matching strategy, which can promise a dispatching strategy that can be more optimal in the sense that both lot-based and equipment-based viewpoints are taken into account simultaneously. In this paper, we further adopt an efficient algorithm auction algorithm to help us to find out the optimal solution to the internally generated lot/equipment matching problem. Besides, some adaptive factors are also applied. Lastly in the scheduling phase, we apply the genetic algorithm (GA) based approach to obtain a near-optimal solution to our scheduling problem. From our experiment results, the developed CTPN based genetic algorithm yields a more efficient solution than several other schedulers.
Tsung-Che Chiang, Yi-Shiuan Shen, Li-Chen Fu
ICRA2
2003 Colored timed petri-net and GA based approach to modeling and scheduling for wafer probe center
abstract
In this paper, we propose architecture to simulate wafer probe. We use a modeling tool named CTPN (colored-timed Petri nets) to model all testing flow. With CTPN model, we can predict the delivery date of any specific product under some scheduling policies efficiently and precisely. In the scheduling phase, we combine two popular methods to contract high-quality schedules. One is to select machines for lots and the other is to select lots for machines. In each method, we use the GA-based approach to search for the optimal combination of a number of heuristic rules. This CTPN-based GA scheduler and helps us to find the good solution so as to meet the requirements in the complicated environment.
Shun-Yu Lin, Li-Chen Fu, Tsung-Che Chiang, Yi-Shiuan Shen
ICRA4