The following pages link to Ching-Fang Liaw (Q707006):
Displaying 11 items.
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- A tabu search algorithm for the open shop scheduling problem (Q1302574) (← links)
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (Q1302719) (← links)
- Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
- An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
