| |
| 2008 | ||
|---|---|---|
| 9 | EE | Ching-Fang Liaw: An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops. Computers & OR 35(10): 3276-3283 (2008) |
| 2005 | ||
| 8 | EE | Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen: Scheduling two-machine no-wait open shops to minimize makespan. Computers & OR 32: 901-917 (2005) |
| 7 | EE | Ching-Fang Liaw: Scheduling preemptive open shops to minimize total tardiness. European Journal of Operational Research 162(1): 173-183 (2005) |
| 2004 | ||
| 6 | EE | Ching-Fang Liaw: Scheduling two-machine preemptive open shops to minimize total completion time. Computers & OR 31(8): 1349-1363 (2004) |
| 2003 | ||
| 5 | EE | Ching-Fang Liaw, Yang-Kuei Lin, Chun-Yuan Cheng, Mingchih Chen: Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & OR 30(12): 1777-1789 (2003) |
| 4 | EE | Ching-Fang Liaw: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Computers & OR 30(14): 2081-2095 (2003) |
| 2002 | ||
| 3 | EE | 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. Computers & OR 29(9): 1251-1266 (2002) |
| 1999 | ||
| 2 | EE | Ching-Fang Liaw: A tabu search algorithm for the open shop scheduling problem. Computers & OR 26(2): 109-126 (1999) |
| 1 | EE | Ching-Fang Liaw: A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers & OR 26(7): 679-693 (1999) |
| 1 | Mingchih Chen | [3] [5] [8] |
| 2 | Chun-Yuan Cheng | [3] [5] [8] |
| 3 | Yang-Kuei Lin | [5] |