|
English
|
正體中文
|
简体中文
|
总笔数 :0
|
|
造访人次 :
51945844
在线人数 :
1032
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
"liaw ching fang"的相关文件
显示项目 1-9 / 9 (共1页)
1
每页显示[10|25|50]项目
| 朝陽科技大學 |
2024-06-04 |
A risk assessment model with dependent failure modes for the manufacturing and design processes of medical equipment
|
Lo, Huai-Wei; Gul, Muhammet; Yucesan, Melih; Liaw, Ching-Fang; 廖經芳 |
| 朝陽科技大學 |
2024-03-30 |
Top-notch 30 Years．Beyond Global．Towards Sustainability
|
Liaw, Ching-Fang |
| 朝陽科技大學 |
2022-11 |
Two-Machine Open Shop Scheduling with Proportionally Deteriorating Jobs and Makespan Objective
|
Liaw, Ching-Fang |
| 朝陽科技大學 |
2021-12 |
Sustainable supplier evaluation and transportation planning in multi-level supply chain networks using multi-attribute- and multi-objective decision making
|
羅懷暐; Lo, Huai-Wei;Liaw, Ching-Fang;Gul, Muhammet;Lin, Kuan-Yu |
| 朝陽科技大學 |
2020-11 |
A Hybrid MCDM Model to Evaluate and Classify Outsourcing Providers in Manufacturing
|
Liaw, Ching-Fang; Hsu, Wan-Chi Jackie; Lo, Huai-Wei; 羅懷暐 |
| 朝陽科技大學 |
2016-08-01 |
A branch-and-bound algorithm for identical parallel-machine total completion time scheduling problem with preemption and release times
|
廖經芳; Liaw, Ching-Fang |
| 朝陽科技大學 |
2016-08-01 |
A branch-and-bound algorithm for identical parallel-machine total tardiness scheduling problem with preemption
|
廖經芳; Liaw, Ching-Fang |
| 朝陽科技大學 |
2014-01 |
A Fast Heuristic to minimize Number of Tardy Jobs in Preemptive Open Shops
|
Liaw, Ching-Fang; 廖經芳 |
| 朝陽科技大學 |
2013 |
An improved branch-and-bound algorithm for the preemptive open shop total completion time scheduling problem
|
Liaw, Ching-Fang; 廖經芳 |
显示项目 1-9 / 9 (共1页)
1
每页显示[10|25|50]项目
|
