| 國立勤益科技大學 |
2009-03 |
On genetic algorithms for shoe making nesting–A Taiwan case
|
Yang, Hsu-Hao;Lin, Chien-Li |
| 國立勤益科技大學 |
2007 |
Visualization of machine clustering for a Taiwanese IC packaging foundry
|
Yang, Hsu-Hao ; Kang, He-Yau ; Liu, Tzu-Chiang |
| 國立勤益科技大學 |
2007 |
Applying rough sets to prevent customer complaints for IC packaging foundry
|
Yang, Hsu-Hao ; Liu, Tzu-Chiang ; Lin, Yen-Ting |
| 國立勤益科技大學 |
2007 |
Applying rough sets to prevent customer complaints for IC packaging foundry
|
Yang, Hsu-Hao; Liu, Tzu-Chiang; Lin, Yen-Ting |
| 國立勤益科技大學 |
2007 |
Visualization of Machine Clustering for a Taiwanese IC Packaging Foundry
|
Yang, Hsu-Hao ; Kang, He-Yau ; Liu, Tzu-Chiang |
| 國立勤益科技大學 |
2007 |
Visualization of machine clustering for a Taiwanese IC packaging foundry
|
Yang, Hsu-Hao ; Kang, He-Yau ; Liu, Tzu-Chiang |
| 國立勤益科技大學 |
2006 |
Finding k shortest looping paths with waiting time in a time-window network
|
Yang, Hsu-Hao ; Chen, Yen-Liang |
| 國立勤益科技大學 |
2005 |
Finding k shortest looping paths in a traffic-light network
|
Yang, Hsu-Hao ; Chen, Yen-Liang |
| 國立勤益科技大學 |
2004 |
The first K shortest unique-arc walks in a traffic-light network
|
Yang, Hsu-Hao ; Chen, Yen-Liang |
| 國立勤益科技大學 |
2004 |
Finding the first K shortest paths in a time-window network
|
Chen, Yen-Liang ; Yang, Hsu-Hao |
| 國立勤益科技大學 |
2003 |
Minimization of travel time and weighted number of stops in a traffic-light network
|
Chen, Yen-Liang ; Yang, Hsu-Hao |
| 國立勤益科技大學 |
2000 |
Shortest paths in traffic-light networks
|
Chen, Yen-Liang ; Yang, Hsu-Hao |
| 國立勤益科技大學 |
2000 |
Finding the critical path in an activity network with time-switch constraints
|
Yang, Hsu-Hao ; Chen, Yen-Liang |
| 國立勤益科技大學 |
2000 |
A performance index approach to managing service quality
|
Yang, Hsu-Hao ; Chen, K.S. |
| 國立勤益科技大學 |
1997 |
Investigation of path-following algorithms for signomial geometric programming problems
|
Yang, Hsu-Hao ; Bricker, Dennis L. |
