English  |  正體中文  |  简体中文  |  Total items :2856704  
Visitors :  53779905    Online Users :  1813
Project Commissioned by the Ministry of Education
Project Executed by National Taiwan University Library
 
臺灣學術機構典藏系統 (Taiwan Academic Institutional Repository, TAIR)
About TAIR

Browse By

News

Copyright

Related Links

"ching fang liaw"

Return to Browse by Author
Sorting by Title Sort by Date

Showing items 1-11 of 11  (1 Page(s) Totally)
1 
View [10|25|50] records per page

Institution Date Title Author
朝陽科技大學 2008 An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops 廖經芳; Ching-Fang Liaw
朝陽科技大學 2005 Scheduling Preemptive Open Shops to Minimize Total Tardiness 廖經芳; Ching-Fang Liaw
朝陽科技大學 2005 Scheduling Two-Machine No-Wait Open Shops to Minimize Makespan 廖經芳; Ching-Fang Liaw
朝陽科技大學 2004 Scheduling Two-Machine Preemptive Open Shops to Minimize Total Completion Time 廖經芳; Ching-Fang Liaw
朝陽科技大學 2003 Scheduling Unrelated Parallel Machines to Minimize Total Weighted Tardiness 廖經芳;陳銘芷;林晹桂; Ching-Fang Liaw;Yang-Kuei Lin;Chun-Yuan Cheng;Mingchih Chen
朝陽科技大學 2003 An Efficient Tabu Search Approach for the Two-Machine Preemptive Open Shop Scheduling Problem 廖經芳; Ching-Fang Liaw
朝陽科技大學 2002 The total completion time open shop scheduling problem with a given sequence of jobs on one machine 廖經芳;鄭純緩;陳銘芷; Ching-Fang Liaw;Chun-Yuan Cheng;Mingchih Chen
朝陽科技大學 2000 A hybrid genetic algorithm for the open shop scheduling problem 廖經芳; Ching-Fang Liaw
朝陽科技大學 1999 A Tabu search algorithm for the open shop scheduling problem 廖經芳; Ching-Fang Liaw
朝陽科技大學 1999 A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem 廖經芳; Ching-Fang Liaw
朝陽科技大學 1999 Applying simulated annealing to the open shop scheduling problem 廖經芳; Ching-Fang Liaw

Showing items 1-11 of 11  (1 Page(s) Totally)
1 
View [10|25|50] records per page