| |
| 1998 | ||
|---|---|---|
| 5 | EE | Y. L. Chen, Kwei Tang: Minimum time paths in a network with mixed time constraints. Computers & OR 25(10): 793-805 (1998) |
| 1994 | ||
| 4 | Y. L. Chen, T. H. Sun, Li-Chen Fu: A Petri-Net Based Hierarchical Structure for Dynamic Scheduler of an FMS: Rescheduling and Deadlock Avoidance. ICRA 1994: 1998-2005 | |
| 3 | Y. L. Chen: Finding the k Quickset Simple Paths in a Network. Inf. Process. Lett. 50(2): 89-92 (1994) | |
| 1990 | ||
| 2 | EE | Y. L. Chen, Y. H. Chin: The quickest path problem. Computers & OR 17(2): 153-161 (1990) |
| 1989 | ||
| 1 | EE | Y. L. Chen, Y. H. Chin: Scheduling unit-time jobs on processors with different capabilities. Computers & OR 16(5): 409-417 (1989) |
| 1 | Y. H. Chin | [1] [2] |
| 2 | Li-Chen Fu | [4] |
| 3 | T. H. Sun | [4] |
| 4 | Kwei Tang | [5] |