| 2011 | ||
|---|---|---|
| j4 | Q. Q. Nong, T. C. E. Cheng, C. T. Ng: Two-agent scheduling to minimize the total cost. European Journal of Operational Research 215(1): 39-44 (2011) | |
| 2010 | ||
| j3 | Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng: A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. Theor. Comput. Sci. 411(31-33): 2978-2986 (2010) | |
| 2008 | ||
| j2 | Q. Q. Nong, C. T. Ng, T. C. Edwin Cheng: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. Oper. Res. Lett. 36(1): 61-66 (2008) | |
| j1 | Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Oper. Res. Lett. 36(5): 584-588 (2008) | |
| 1 | T. C. Edwin Cheng (T. C. E. Cheng) | |
| 2 | C. T. Ng (C. T. Daniel Ng) |
Data released under the ODC-BY 1.0 license — See also our legal information page