Liaw Ching-Fang

Ching-Fang Liaw

Information about the author Ching-Fang Liaw will soon be added to the site.
Found 10 papers in total
Scheduling two-machine no-wait open shops to minimize makespan
2005
This paper examines the problem of scheduling two-machine no-wait open shops to...
Scheduling preemptive open shops to minimize total tardiness
2005
This article considers the problem of scheduling preemptive open shops to minimize...
Scheduling two-machine preemptive open shops to minimize total completion time
2004
This paper deals with the problem of scheduling two-machine preemptive open shops to...
Scheduling unrelated parallel machines to minimize total weighted tardiness
2003
This article considers the problem of scheduling a given set of independent jobs on...
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem
2003
This article considers the problem of scheduling two-machine preemptive open shops to...
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
2002
This paper addresses the open shop scheduling problem to minimize the total completion...
A hybrid genetic algorithm for the open shop scheduling problem
2000
This paper examines the development and application of a hybrid genetic algorithm...
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
1999
This paper addresses the problem of scheduling a given set of independent jobs on a...
A tabu search algorithm for the open shop scheduling problem
1999
An approximation algorithm of finding a minimum makespan in a nonpreemptive open shop...
An iterative improvement approach for the nonpreemptive open shop scheduling problem
1998
This paper addresses the problem of scheduling nonpreemptive open shops with the...
Papers per page: