| 1993 | ||
|---|---|---|
| j7 | Jianzhong Du, Joseph Y.-T. Leung: Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops. J. Algorithms 14(1): 24-44 (1993) | |
| j6 | Jianzhong Du, Joseph Y.-T. Leung: Minimizing Mean Flow Time with Release Time and Deadline Constraints. J. Algorithms 14(1): 45-68 (1993) | |
| 1991 | ||
| j5 | Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young: Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time. Inf. Comput. 92(2): 219-236 (1991) | |
| 1990 | ||
| j4 | Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young: Minimizing Mean Flow Time with Release Time Constraint. Theor. Comput. Sci. 75(3): 347-355 (1990) | |
| 1989 | ||
| j3 | Jianzhong Du, Joseph Y.-T. Leung: Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length. SIAM J. Discrete Math. 2(2): 176-196 (1989) | |
| j2 | Jianzhong Du, Joseph Y.-T. Leung: Complexity of Scheduling Parallel Task Systems. SIAM J. Discrete Math. 2(4): 473-487 (1989) | |
| 1988 | ||
| j1 | Jianzhong Du, Joseph Y.-T. Leung: Scheduling Tree-Structured Tasks with Restricted Execution Times. Inf. Process. Lett. 28(4): 183-188 (1988) | |
| c1 | Jianzhong Du, Joseph Y.-T. Leung: Minimizing Mean Flow Time with Release Time and Deadline Constraints. RTSS 1988: 24-32 | |
| 1 | Joseph Y.-T. Leung | |
| 2 | Gilbert H. Young |
Data released under the ODC-BY 1.0 license — See also our legal information page