#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1973

2017

- This year (0)
- Last 5 years (12)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov
- European Journal of Operational Research
- 2008

The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of scheduling researchâ€¦ (More)

- T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Zhaohui Liu
- European Journal of Operational Research
- 2005

The problem of minimizing the total weighted tardiness in single machine scheduling is a well-known strongly NPhard problem. In this paper, we present an OÃ°nÃž time approximation algorithm for theâ€¦ (More)

- C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
- J. Comb. Optim.
- 2006

We consider a two-agent scheduling problem on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the number of tardy jobs ofâ€¦ (More)

- T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
- J. Scheduling
- 2003

- T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
- Theor. Comput. Sci.
- 2006

We consider the feasibility model of multi-agent scheduling on a single machine, where each agentâ€™s objective function is to minimize the total weighted number of tardy jobs. We show that the problemâ€¦ (More)

- C. T. Ng, M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov
- European Journal of Operational Research
- 2010

- T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
- European Journal of Operational Research
- 2008

We consider multi-agent scheduling on a single machine, where the objective functions of the agents are of the max-form. For the feasibility model, we show that the problem can be solved inâ€¦ (More)

- J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
- Theor. Comput. Sci.
- 2004

In this paper we consider the unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. We show that this problem is strongly NP-hard, andâ€¦ (More)

- Eric R Houpt, Oluma Yoseph Bushen, +8 authors John F. Shao
- The American journal of tropical medicine andâ€¦
- 2005

Few data exist on the relative importance of individual Cryptosporidium species in acquired immunodeficiency syndrome cryptosporidiosis. We characterized 127 inpatients infected with humanâ€¦ (More)

- T. C. Edwin Cheng, Liying Kang, C. T. Ng
- Discrete Applied Mathematics
- 2007

We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m + n) time algorithm to solve the paired-dominationâ€¦ (More)