Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2009 | |
---|---|---|

138 | EE | Vincent Cho, T. C. Edwin Cheng, W. M. Jennifer Lai: The role of perceived user-interface design in continued usage intention of self-paced e-learning tools. Computers & Education 53(2): 216-227 (2009) |

137 | EE | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: Bicriterion scheduling with equal processing times on a batch processing machine. Computers & OR 36(1): 110-118 (2009) |

136 | EE | T. C. Edwin Cheng, A. A. Lazarev, E. R. Gafarov: A hybrid algorithm for the single-machine total tardiness problem. Computers & OR 36(2): 308-315 (2009) |

135 | EE | Yaojun Chen, T. C. Edwin Cheng, Ran Xu: The Ramsey number for a cycle of length six versus a clique of order eight. Discrete Applied Mathematics 157(1): 8-12 (2009) |

134 | EE | T. C. Edwin Cheng, Liying Kang, Erfang Shan: A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discrete Applied Mathematics 157(2): 262-271 (2009) |

133 | EE | Erfang Shan, T. C. Edwin Cheng: Upper bounds on the upper signed total domination number of graphs. Discrete Applied Mathematics 157(5): 1098-1103 (2009) |

132 | EE | C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov: The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. Discrete Applied Mathematics 157(8): 1806-1824 (2009) |

131 | EE | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: Scheduling jobs with release dates on parallel batch processing machines. Discrete Applied Mathematics 157(8): 1825-1830 (2009) |

130 | EE | T. C. Edwin Cheng, Bertrand M. T. Lin: Johnson's rule, composite jobs and the relocation problem. European Journal of Operational Research 192(3): 1008-1013 (2009) |

129 | EE | Xiuli Wang, T. C. Edwin Cheng: Production scheduling with supply and delivery considerations to minimize the makespan. European Journal of Operational Research 194(3): 743-752 (2009) |

128 | EE | Qiu-Hong Zhao, T. C. Edwin Cheng: An analytical study of the modification ability of distribution centers. European Journal of Operational Research 194(3): 901-910 (2009) |

127 | EE | T. C. Edwin Cheng, Peng-Jen Lai, Chin-Chia Wu, Wen-Chiung Lee: Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Inf. Sci. 179(18): 3127-3135 (2009) |

126 | EE | Min Ji, T. C. Edwin Cheng: Parallel-machine scheduling of simple linear deteriorating jobs. Theor. Comput. Sci. 410(38-40): 3761-3768 (2009) |

125 | EE | C. T. Ng, Zhiyi Tan, Yong He, T. C. Edwin Cheng: Two semi-online scheduling problems on two uniform machines. Theor. Comput. Sci. 410(8-10): 776-792 (2009) |

2008 | ||

124 | EE | Ji-Bo Wang, C. T. Ng, T. C. Edwin Cheng: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Computers & OR 35(8): 2684-2693 (2008) |

123 | EE | Erfang Shan, T. C. Edwin Cheng, Liying Kang: An application of the Turán theorem to domination in graphs. Discrete Applied Mathematics 156(14): 2712-2718 (2008) |

122 | EE | Erfang Shan, T. C. Edwin Cheng: Remarks on the minus (signed) total domination in graphs. Discrete Mathematics 308(15): 3373-3380 (2008) |

121 | EE | Bing Chen, Shenggui Zhang, T. C. Edwin Cheng: Heavy cycles in k-connected weighted graphs with large weighted degree sums. Discrete Mathematics 308(20): 4531-4543 (2008) |

120 | EE | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng: Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. Discrete Mathematics 308(7): 1296-1307 (2008) |

119 | EE | Erfang Shan, Zuosong Liang, T. C. Edwin Cheng: Clique-transversal Number in Cubic Graphs. Discrete Mathematics & Theoretical Computer Science 10(2): (2008) |

118 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, S. S. Lam: Group sequencing around a common due date. Discrete Optimization 5(3): 594-604 (2008) |

117 | EE | Yaojun Chen,
T. C. Edwin Cheng,
Yunqing Zhang:
The Ramsey numbers R(C_{m}, K_{7}) and R(C_{7}, K_{8}).
Eur. J. Comb. 29(5): 1337-1352 (2008) |

116 | EE | Joseph Y.-T. Leung, C. T. Ng, T. C. Edwin Cheng: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. European Journal of Operational Research 187(3): 1090-1099 (2008) |

115 | EE | Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3): 985-1032 (2008) |

114 | EE | Min Ji, T. C. Edwin Cheng: Parallel-machine scheduling with simple linear deterioration to minimize total completion time. European Journal of Operational Research 188(2): 342-347 (2008) |

113 | EE | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan: Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research 188(2): 603-609 (2008) |

112 | EE | M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov: Batch scheduling of deteriorating reworkables. European Journal of Operational Research 189(3): 1317-1326 (2008) |

111 | EE | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan: Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. European Journal of Operational Research 191(2): 320-331 (2008) |

110 | EE | Min Ji, T. C. Edwin Cheng: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan. Inf. Process. Lett. 108(4): 171-174 (2008) |

109 | EE | T. C. Edwin Cheng, Chin-Chia Wu, Wen-Chiung Lee: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Inf. Sci. 178(11): 2476-2487 (2008) |

108 | EE | M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov: Batch scheduling of step deteriorating jobs. J. Scheduling 11(1): 17-28 (2008) |

107 | EE | 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) |

106 | EE | 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) |

2007 | ||

105 | EE | Zuosong Liang, Erfang Shan, T. C. Edwin Cheng: Clique-Transversal Sets in Cubic Graphs. ESCAPE 2007: 107-115 |

104 | EE | Shuying Peng, Meili Li, Shenggui Zhang, T. C. Edwin Cheng: Some New Structural Properties of Shortest 2-Connected Steiner Networks. FAW 2007: 317-324 |

103 | EE | Bing Chen, Shenggui Zhang, T. C. Edwin Cheng: Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums. International Conference on Computational Science (3) 2007: 338-346 |

102 | EE | Ji-Bo Wang, T. C. Edwin Cheng: Scheduling Problems with the Effects of deterioration and Learning. APJOR 24(2): 245-261 (2007) |

101 | EE | Guangjun Xu, Erfang Shan, Liying Kang, T. C. Edwin Cheng: The algorithmic complexity of the minus clique-transversal problem. Applied Mathematics and Computation 189(2): 1410-1418 (2007) |

100 | EE | Nitin Singh, Kee-hung Lai, T. C. Edwin Cheng: Intra-organizational perspectives on IT-enabled supply chains. Commun. ACM 50(1): 59-65 (2007) |

99 | EE | Xiuli Wang, T. C. Edwin Cheng: Heuristics for two-machine flowshop scheduling with setup times and an availability constraint. Computers & OR 34(1): 152-162 (2007) |

98 | EE | Xiuli Wang, T. C. Edwin Cheng: An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint. Computers & OR 34(10): 2894-2901 (2007) |

97 | EE | Min Ji, Yong He, T. C. Edwin Cheng: Single-machine scheduling with periodic maintenance to minimize makespan. Computers & OR 34(6): 1764-1770 (2007) |

96 | EE | T. C. Edwin Cheng, Liying Kang, C. T. Ng: An improved algorithm for the p-center problem on interval graphs with unit lengths. Computers & OR 34(8): 2215-2222 (2007) |

95 | EE | Min Ji, Yong He, T. C. Edwin Cheng: A simple linear time algorithm for scheduling with step-improving processing times. Computers & OR 34(8): 2396-2402 (2007) |

94 | EE | Eric W. T. Ngai, T. C. Edwin Cheng, S. Au, Kee-hung Lai: Mobile commerce integrated with RFID technology in a container depot. Decision Support Systems 43(1): 62-76 (2007) |

93 | EE | T. C. Edwin Cheng, L. Y. Kang, C. T. Ng: Paired domination on interval and circular-arc graphs. Discrete Applied Mathematics 155(16): 2077-2086 (2007) |

92 | EE | T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. T. Ng: The Ramsey numbers for a cycle of length six or seven versus a clique of order seven. Discrete Mathematics 307(9-10): 1047-1053 (2007) |

91 | EE | T. C. Edwin Cheng, Natalia V. Shakhlevich: Two-machine open shop problem with controllable processing times. Discrete Optimization 4(2): 175-184 (2007) |

90 | EE | Min Ji, Yong He, T. C. Edwin Cheng: Batch delivery scheduling with batch delivery cost on a single machine. European Journal of Operational Research 176(2): 745-755 (2007) |

89 | EE | J. J. Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng: Approximability of single machine scheduling with fixed jobs to minimize total completion time. European Journal of Operational Research 178(1): 46-56 (2007) |

88 | EE | Xiuli Wang, T. C. Edwin Cheng: Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research 178(1): 57-70 (2007) |

87 | EE | Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng: Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research 178(2): 331-342 (2007) |

86 | EE | J. J. Yuan, T. C. Edwin Cheng, C. T. Ng: NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time. European Journal of Operational Research 178(2): 631-633 (2007) |

85 | EE | Chin-Shan Lu, Kee-hung Lai, T. C. Edwin Cheng: Application of structural equation modeling to evaluate the intention of shippers to use Internet services in liner shipping. European Journal of Operational Research 180(2): 845-867 (2007) |

84 | EE | Min Ji, T. C. Edwin Cheng: An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan. Inf. Process. Lett. 102(2-3): 41-47 (2007) |

83 | EE | Erfang Shan, T. C. Edwin Cheng, Liying Kang: Absorbant of generalized de Bruijn digraphs. Inf. Process. Lett. 105(1): 6-11 (2007) |

82 | EE | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: Scheduling jobs with agreeable processing times and due dates on a single batch processing machine. Theor. Comput. Sci. 374(1-3): 159-169 (2007) |

2006 | ||

81 | EE | Ji-Bo Wang, C. T. Daniel Ng, T. C. Edwin Cheng, Li-Li Liu: Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Applied Mathematics and Computation 180(1): 185-193 (2006) |

80 | EE | Xiuli Wang, T. C. Edwin Cheng: A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups. Computers & OR 33: 1326-1344 (2006) |

79 | EE | Kee-hung Lai, Christina W. Y. Wong, T. C. Edwin Cheng: Institutional isomorphism and the adoption of information technology for supply chain management. Computers in Industry 57(1): 93-98 (2006) |

78 | EE | T. C. Edwin Cheng, David Y. C. Lam, Andy C. L. Yeung: Adoption of internet banking: An empirical study in Hong Kong. Decision Support Systems 42(3): 1558-1572 (2006) |

77 | EE | T. C. Edwin Cheng, Yaojun Chen, C. T. Ng: A note on acyclic domination number in graphs of diameter two. Discrete Applied Mathematics 154(6): 1019-1022 (2006) |

76 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich: Scheduling with controllable release dates and processing times: Makespan minimization. European Journal of Operational Research 175(2): 751-768 (2006) |

75 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich: Scheduling with controllable release dates and processing times: Total completion time minimization. European Journal of Operational Research 175(2): 769-781 (2006) |

74 | EE | T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov: A new algorithm for online uniform-machine scheduling to minimize the makespan. Inf. Process. Lett. 99(3): 102-105 (2006) |

73 | EE | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan: A note on the complexity of the problem of two-agent scheduling on a single machine. J. Comb. Optim. 12(4): 387-394 (2006) |

72 | EE | Zhongjun Tian,
C. T. Ng,
T. C. Edwin Cheng:
An O(n^{2}) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness.
J. Scheduling 9(4): 343-364 (2006) |

71 | EE | J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng: Single machine batch scheduling problem with family setup times and release dates to minimize makespan. J. Scheduling 9(6): 499-513 (2006) |

70 | EE | T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger: Scheduling with step-improving processing times. Oper. Res. Lett. 34(1): 37-40 (2006) |

69 | EE | Min Ji, Yong He, T. C. Edwin Cheng: Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theor. Comput. Sci. 362(1-3): 115-126 (2006) |

68 | EE | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor. Comput. Sci. 362(1-3): 273-281 (2006) |

2005 | ||

67 | EE | Bing Chen, Shenggui Zhang, T. C. Edwin Cheng: An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs. CJCDGCGT 2005: 21-29 |

66 | EE | Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao: Scheduling to Minimize Makespan with Time-Dependent Processing Times. ISAAC 2005: 925-933 |

65 | EE | Bertrand M. T. Lin, T. C. Edwin Cheng: Two-Machine Flowshop Batching and Scheduling. Annals OR 133(1-4): 149-161 (2005) |

64 | EE | C. T. Ng, T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov: Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. Annals OR 133(1-4): 163-174 (2005) |

63 | EE | Kok Lay Teo, T. C. Edwin Cheng, Xiaoqiang Cai, Xiaoqi Yang: Preface. Annals OR 133(1-4): 17-20 (2005) |

62 | EE | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Erfang Shan: A note on domination and minus domination numbers in cubic graphs. Appl. Math. Lett. 18(9): 1062-1067 (2005) |

61 | EE | Xiuli Wang, T. C. Edwin Cheng: Two-machine flowshop scheduling with job class setups to minimize total flowtime. Computers & OR 32: 2751-2770 (2005) |

60 | EE | T. C. Edwin Cheng, J. J. Yuan, A. F. Yang: Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Computers & OR 32: 849-859 (2005) |

59 | EE | Xiuli Wang, T. C. Edwin Cheng: Single machine scheduling with resource dependent release times and processing times. European Journal of Operational Research 162(3): 727-739 (2005) |

58 | EE | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Z. H. Liu: Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research 165(2): 423-443 (2005) |

57 | EE | T. C. Edwin Cheng, Natalia V. Shakhlevich: Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem. European Journal of Operational Research 165(2): 444-456 (2005) |

56 | EE | Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng: On the single machine total tardiness problem. European Journal of Operational Research 165(3): 843-846 (2005) |

55 | EE | F. K. T. Wat, Eric W. T. Ngai, T. C. Edwin Cheng: Potential risks to e-commerce development using exploratory factor analysis. IJSTM 6(1): 55-71 (2005) |

54 | EE | T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov: Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337(1-3): 134-146 (2005) |

53 | EE | Zhaohui Liu, T. C. Edwin Cheng: Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine. Theor. Comput. Sci. 347(1-2): 288-298 (2005) |

2004 | ||

52 | EE | Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich: Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Annals OR 129(1-4): 81-106 (2004) |

51 | EE | T. C. Edwin Cheng, Qing Ding, Bertrand M. T. Lin: A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research 152(1): 1-13 (2004) |

50 | EE | C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov: Single machine batch scheduling with jointly compressible setup and processing times. European Journal of Operational Research 153(1): 211-219 (2004) |

49 | EE | J. J. Yuan, A. F. Yang, T. C. Edwin Cheng: A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. European Journal of Operational Research 158(2): 525-528 (2004) |

48 | EE | Zhaohui Liu, T. C. Edwin Cheng: Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. J. Scheduling 7(4): 313-327 (2004) |

47 | EE | J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theor. Comput. Sci. 320(2-3): 199-212 (2004) |

46 | EE | Liying Kang, Moo Young Sohn, T. C. Edwin Cheng: Paired-domination in inflated graphs. Theor. Comput. Sci. 320(2-3): 485-494 (2004) |

2003 | ||

45 | EE | T. C. Edwin Cheng, Qing Ding: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine. Computers & OR 30(1): 51-62 (2003) |

44 | EE | Hong Yan, Zhenxin Yu, T. C. Edwin Cheng: A strategic model for supply chain design with logical constraints: formulation and solution. Computers & OR 30(14): 2135-2155 (2003) |

43 | EE | C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, S. S. Lam: Single machine scheduling with a variable common due date and resource-dependent processing times. Computers & OR 30(8): 1173-1185 (2003) |

42 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov: Scheduling a Single Server in a Two-machine Flow Shop. Computing 70(2): 167-180 (2003) |

41 | EE | Ceyda Oguz, Muhammet Fikret Ercan, T. C. Edwin Cheng, Yu-Fai Fung: Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. European Journal of Operational Research 149(2): 390-403 (2003) |

40 | EE | T. C. Edwin Cheng, Zhaohui Liu: 3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. Inf. Process. Lett. 88(4): 161-165 (2003) |

39 | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan: Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. J. Scheduling 6(4): 405-412 (2003) | |

38 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan: The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. J. Scheduling 6(5): 483-490 (2003) | |

37 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan: A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. J. Scheduling 6(6): 551-555 (2003) | |

36 | EE | Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng: On scheduling an unbounded batch machine. Oper. Res. Lett. 31(1): 42-48 (2003) |

35 | EE | T. C. Edwin Cheng, Zhaohui Liu: Approximability of two-machine no-wait flowshop scheduling with availability constraints. Oper. Res. Lett. 31(3): 319-322 (2003) |

34 | EE | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan, Zhaohui Liu: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. Oper. Res. Lett. 31(3): 323-326 (2003) |

2002 | ||

33 | EE | T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich: Common due date assignment and scheduling with ready times. Computers & OR 29(14): 1957-1967 (2002) |

32 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov: An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Computers & OR 29(14): 2087-2091 (2002) |

31 | EE | Eric W. T. Ngai, T. C. Edwin Cheng: Applications of information support technologies for small and medium enterprises: a research agenda. IJITM 1(2/3): 211-224 (2002) |

30 | EE | C. T. Ng, T. C. Edwin Cheng, Aleksander Bachman, Adam Janiak: Three scheduling problems with deteriorating jobs to minimize the total completion time. Inf. Process. Lett. 81(6): 327-333 (2002) |

29 | EE | Zhaohui Liu, T. C. Edwin Cheng: Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett. 82(2): 107-111 (2002) |

28 | EE | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan: Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. Inf. Process. Lett. 82(4): 187-191 (2002) |

27 | EE | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan: A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Oper. Res. Lett. 30(1): 66-68 (2002) |

2001 | ||

26 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov: Single Supplier Scheduling for Multiple Deliveries. Annals OR 107(1-4): 51-63 (2001) |

25 | EE | W. K. Yeung, Ceyda Oguz, T. C. Edwin Cheng: Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty. Annals OR 108(1-4): 33-54 (2001) |

24 | EE | W. K. Yeung, Ceyda Oguz, T. C. Edwin Cheng: Single-machine scheduling with a common due window. Computers & OR 28(2): 157-175 (2001) |

23 | EE | Bertrand M. T. Lin, T. C. Edwin Cheng: Batch scheduling in the no-wait two-machine flowshop to minimize the makespan. Computers & OR 28(7): 613-624 (2001) |

22 | EE | Zhenxin Yu, Hong Yan, T. C. Edwin Cheng: Benefits of information sharing with supply chain partnerships. Industrial Management and Data Systems 101(3): 114-121 (2001) |

2000 | ||

21 | EE | T. C. Edwin Cheng, Qing Ding: Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times. Acta Inf. 36(9/10): 673-692 (2000) |

20 | EE | T. C. Edwin Cheng, Guoqing Wang: An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper. Res. Lett. 26(5): 223-229 (2000) |

1999 | ||

19 | EE | Dirk Biskup, T. C. Edwin Cheng: Multiple-machine scheduling with earliness, tardiness and completion time penalties. Computers & OR 26(1): 45-57 (1999) |

18 | EE | T. C. Edwin Cheng, Guoqing Wang, Chelliah Sriskandarajah: One-operator-two-machine flowshop scheduling with setup and dismounting times. Computers & OR 26(7): 715-730 (1999) |

17 | EE | T. C. Edwin Cheng, Qing Ding: The time dependent machine makespan problem is strongly NP-complete. Computers & OR 26(8): 749-754 (1999) |

16 | Eric W. T. Ngai, T. C. Edwin Cheng: MSS4TQM-a management support system for total quality management. IEEE Transactions on Systems, Man, and Cybernetics, Part C 29(3): 371-386 (1999) | |

15 | EE | Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng: Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines. Inf. Process. Lett. 69(6): 275-281 (1999) |

14 | EE | T. C. Edwin Cheng, Guoqing Wang: Two-Machine Flowshop Scheduling with Consecutive Availability Constraints. Inf. Process. Lett. 71(2): 49-54 (1999) |

1998 | ||

13 | EE | Xiaoqiang Cai, T. C. Edwin Cheng: Multi-machine Scheduling with Variance Minimization. Discrete Applied Mathematics 84(1-3): 55-70 (1998) |

12 | EE | T. C. Edwin Cheng, Qing Ding: The Complexity of Scheduling Starting Time Dependent Tasks with Release Times. Inf. Process. Lett. 65(2): 75-79 (1998) |

1997 | ||

11 | EE | Ceyda Oguz, Bertrand M. T. Lin, T. C. Edwin Cheng: Two-stage flowshop scheduling with a common second-stage machine. Computers & OR 24(12): 1169-1174 (1997) |

1996 | ||

10 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov: Batch Scheduling and Common Due-date Assignment on a Single Machine. Discrete Applied Mathematics 70(3): 231-245 (1996) |

1995 | ||

9 | EE | Chung-Lun Li, T. C. Edwin Cheng, Zhi-Long Chen: Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs. Computers & OR 22(2): 205-219 (1995) |

1994 | ||

8 | EE | T. C. Edwin Cheng, Zhi-Long Chen, Ceyda Oguz: One-machine batching and sequencing of multiple-type items. Computers & OR 21(7): 717-721 (1994) |

1993 | ||

7 | Migar M. C. Tam, Doris H. L. Choi, Walter W. C. Chung, T. C. Edwin Cheng, P. P. K. Chiu: A Predictive and Reactive Scheduling Tool Kit for Repetitive Manufacturing. Knowledge-Based Reactive Scheduling 1993: 147-162 | |

6 | EE | Hermann G. Kahlbacher, T. C. Edwin Cheng: Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs. Discrete Applied Mathematics 47(2): 139-164 (1993) |

1990 | ||

5 | EE | T. C. Edwin Cheng: A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem. Computers & OR 17(3): 321-324 (1990) |

4 | EE | T. C. Edwin Cheng: A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem. Computers & OR 17(4): 425-426 (1990) |

1988 | ||

3 | EE | T. C. Edwin Cheng: Optimal common due-date with limited completion time deviation. Computers & OR 15(2): 91-96 (1988) |

1987 | ||

2 | EE | T. C. Edwin Cheng: An algorithm for the con due-date determination and sequencing problem. Computers & OR 14(6): 537-542 (1987) |

1986 | ||

1 | EE | T. C. Edwin Cheng: EOQ with limited backorder delays. Computers & OR 13(4): 477-480 (1986) |