PolyU IR
 

PolyU Institutional Repository >

Browsing by Author "Ng, Chi-to Daniel"

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 7 to 28 of 28
< previous 
Issue DateTitleAuthor(s)
Aug-2008 Group sequencing around a common due dateCheng, T. C. Edwin; Kovalyov, Mikhail Y.; Ng, Chi-to Daniel; Lam, S. S.
6-Apr-2008 Hamilton-connectivity of 3-domination critical graphs with α=δ+1≥5Chen, Yaojun; Cheng, T. C. Edwin; Ng, Chi-to Daniel
Aug-2007 An improved algorithm for the p-center problem on interval graphs with unit lengthsCheng, T. C. Edwin; Kang, Liying; Ng, Chi-to Daniel
Sep-2008 An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machinesNong, Q. Q.; Cheng, T. C. Edwin; Ng, Chi-to Daniel
16-Jun-2008 Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing timesLeung, Joseph Y.-T.; Ng, Chi-to Daniel; Cheng, T. C. Edwin
11-Oct-2006 Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobsCheng, T. C. Edwin; Ng, Chi-to Daniel; Yuan, J. J.
Jul-2008 Multi-agent scheduling on a single machine with max-form criteriaCheng, T. C. Edwin; Ng, Chi-to Daniel; Yuan, J. J.
16-Aug-2006 A new algorithm for online uniform-machine scheduling to minimize the makespanCheng, T. C. Edwin; Ng, Chi-to Daniel; Kotov, Vladimir
15-Apr-2006 A note on acyclic domination number in graphs of diameter twoCheng, T. C. Edwin; Chen, Yaojun; Ng, Chi-to Daniel
Sep-2005 A note on domination and minus domination numbers in cubic graphsChen, Yaojun; Cheng, T. C. Edwin; Ng, Chi-to Daniel; Shan, Erfang
16-Apr-2007 NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion timeYuan, J. J.; Cheng, T. C. Edwin; Ng, Chi-to Daniel
1-Oct-2007 Paired domination on interval and circular-arc graphsCheng, T. C. Edwin; Kang, Liying; Ng, Chi-to Daniel
6-May-2007 The Ramsey numbers for a cycle of length six or seven versus a clique of order sevenCheng, T. C. Edwin; Chen, Yaojun; Zhang, Yunqing; Ng, Chi-to Daniel
Sep-2003 The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hardCheng, T. C. Edwin; Ng, Chi-to Daniel; Yuan, J. J.
2006 Single machine batch scheduling problem with family setup times and release dates to minimize makespanYuan, J. J.; Liu, Zhaohui; Ng, Chi-to Daniel; Cheng, T. C. Edwin
May-2005 Single machine due-date scheduling of jobs with decreasing start-time dependent processing timesCheng, T. C. Edwin; Kang, Liying; Ng, Chi-to Daniel
1-Dec-2008 Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion timeCheng, T. C. Edwin; Ng, Chi-to Daniel; Yuan, J. J.
Feb-2008 Single-machine scheduling with a time-dependent learning effectWang, Ji-Bo; Ng, Chi-to Daniel; Cheng, T. C. Edwin; Liu, L. L.
Aug-2008 Single-machine scheduling with deteriorating jobs under a series-parallel graph constraintWang, Ji-Bo; Ng, Chi-to Daniel; Cheng, T. C. Edwin
16-Jun-2008 A survey of scheduling problems with setup times or costsAllahverdi, Ali; Ng, Chi-to Daniel; Cheng, T. C. Edwin; Kovalyov, Mikhail Y.
1-Mar-2009 Two semi-online scheduling problems on two uniform machinesNg, Chi-to Daniel; Tan, Zhiyi; He, Yong; Cheng, T. C. Edwin
14-Jun-2004 The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespanYuan, J. J.; Liu, Zhaohui; Ng, Chi-to Daniel; Cheng, T. C. Edwin
Showing results 7 to 28 of 28
< previous 

 

© Pao Yue-kong Library, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Powered by DSpace (Version 1.5.2)  © MIT and HP
Feedback | Privacy Policy Statement | Copyright & Restrictions - Feedback