Search the dblp DataBase

Publications of Author

1. Ching-Fang Liaw
   An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2003, v:30, n:14, pp:2081-2095 [Journal]
   
2. Ching-Fang Liaw
   Scheduling two-machine preemptive open shops to minimize total completion time. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2004, v:31, n:8, pp:1349-1363 [Journal]
   
3. Ching-Fang Liaw
   A tabu search algorithm for the open shop scheduling problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:2, pp:109-126 [Journal]
   
4. Ching-Fang Liaw
   A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:7, pp:679-693 [Journal]
   
5. Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen
   The total completion time open shop scheduling problem with a given sequence of jobs on one machine. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:9, pp:1251-1266 [Journal]
   
6. Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen
   Scheduling two-machine no-wait open shops to minimize makespan. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2005, v:32, n:, pp:901-917 [Journal]
   
7. Ching-Fang Liaw, Yang-Kuei Lin, Chun-Yuan Cheng, Mingchih Chen
   Scheduling unrelated parallel machines to minimize total weighted tardiness. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2003, v:30, n:12, pp:1777-1789 [Journal]
   
8. Ching-Fang Liaw
   Scheduling preemptive open shops to minimize total tardiness. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2005, v:162, n:1, pp:173-183 [Journal]
   
9. 
   An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops. [Citation Graph (, )][DBLP]