T. C. E. Cheng
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j222 | Ling-Huey Su, T. C. E. Cheng, Fuh-Der Chou: A minimum-cost network flow approach to preemptive parallel-machine scheduling. Computers & Industrial Engineering 64(1): 453-458 (2013) | |
| j221 | Ling-Huey Su, Yufang Chiu, T. C. Edwin Cheng: Sports tournament scheduling to determine the required number of venues subject to the minimum timeslots under given formats. Computers & Industrial Engineering 65(2): 226-232 (2013) | |
| j220 | T. C. Edwin Cheng, Yu-Hsiang Chung, Shan-Ci Liao, Wen-Chiung Lee: Two-agent singe-machine scheduling with release times to minimize the total weighted completion time. Computers & OR 40(1): 353-361 (2013) | |
| j219 | Yunqiang Yin, T. C. E. Cheng, Jiayin Wang, Chin-Chia Wu: Single-machine common due window assignment and scheduling to minimize the total cost. Discrete Optimization 10(1): 42-53 (2013) | |
| j218 | Chang Hwan Lee, Byong-Duk Rhee, T. C. E. Cheng: Quality uncertainty and quality-compensation contract for supply chain coordination. European Journal of Operational Research 228(3): 582-591 (2013) | |
| j217 | Yingxue Zhao, Lijun Ma, Gang Xie, T. C. E. Cheng: Coordination of supply chains with bidirectional option contracts. European Journal of Operational Research 229(2): 375-381 (2013) | |
| j216 | Rachel W. Y. Yee, Andy C. L. Yeung, T. C. Edwin Cheng, Peter K. C. Lee: Market competitiveness and quality performance in high-contact service industries. Industrial Management and Data Systems 113(4): 573-588 (2013) | |
| j215 | T. C. E. Cheng, Wen-Hung Kuo, Dar-Li Yang: Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position. Inf. Sci. 221: 490-500 (2013) | |
| j214 | Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper. Res. Lett. 41(3): 216-219 (2013) | |
| j213 | B. Q. Fan, T. C. Edwin Cheng, S. S. Li, Q. Feng: Bounded parallel-batching scheduling with two competing agents. J. Scheduling 16(3): 261-271 (2013) | |
| 2012 | ||
| j212 | Yunqiang Yin, Shuenn-Ren Cheng, T. C. E. Cheng, Chin-Chia Wu, Wen-Hsiang Wu: Two-agent single-machine scheduling with assignable due dates. Applied Mathematics and Computation 219(4): 1674-1685 (2012) | |
| j211 | C. T. Ng, Q. Ding, T. C. E. Cheng, S. S. Lam: Preemptive repayment policy for multiple loans. Annals OR 192(1): 141-150 (2012) | |
| j210 | Xiuli Wang, T. C. E. Cheng: Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates. Computers & Industrial Engineering 62(2): 451-456 (2012) | |
| j209 | Yunqiang Yin, T. C. E. Cheng, Dehua Xu, Chin-Chia Wu: Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost. Computers & Industrial Engineering 63(1): 223-234 (2012) | |
| j208 | T. C. Edwin Cheng, Bertrand M. T. Lin, H. L. Huang: Resource-constrained flowshop scheduling with separate resource recycling operations. Computers & OR 39(6): 1206-1212 (2012) | |
| j207 | Shih-Hsin Chen, Pei-Chann Chang, T. C. E. Cheng, Qingfu Zhang: A Self-guided Genetic Algorithm for permutation flowshop scheduling problems. Computers & OR 39(7): 1450-1457 (2012) | |
| j206 | Dar-Li Yang, T. C. E. Cheng, Suh-Jenq Yang, Chou-Jung Hsu: Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities. Computers & OR 39(7): 1458-1464 (2012) | |
| j205 | Ji Tian, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discrete Applied Mathematics 160(7-8): 1191-1210 (2012) | |
| j204 | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang: A theorem on cycle-wheel Ramsey number. Discrete Mathematics 312(5): 1059-1061 (2012) | |
| j203 | Guowei Hua, Shouyang Wang, T. C. E. Cheng: Optimal order lot sizing and pricing with free shipping. European Journal of Operational Research 218(2): 435-441 (2012) | |
| j202 | Christina W. Y. Wong, Kee-hung Lai, T. C. E. Cheng: Value of Information Integration to Supply Chain Management: Roles of Internal and External Contingencies. J. of Management Information Systems 28(3): 161-200 (2012) | |
| j201 | Ji-Bo Wang, P. Ji, T. C. E. Cheng, Dan Wang: Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optimization Letters 6(7): 1393-1409 (2012) | |
| j200 | T. C. E. Cheng, Hans Kellerer, Vladimir Kotov: Algorithms better than LPT for semi-online scheduling with decreasing processing times. Oper. Res. Lett. 40(5): 349-352 (2012) | |
| j199 | Chi To Ng, Dong-Ping Song, T. C. E. Cheng: Optimal Policy for Inventory Transfer Between Two Depots With Backlogging. IEEE Trans. Automat. Contr. 57(12): 3247-3252 (2012) | |
| j198 | Qian Cao, T. C. E. Cheng, Guohua Wan, Yi Li: Several semi-online scheduling problems on two identical machines with combined information. Theor. Comput. Sci. 457: 35-44 (2012) | |
| j197 | Pui-Sze Chow, Tsan-Ming Choi, T. C. E. Cheng: Impacts of Minimum Order Quantity on a Quick Response Supply Chain. IEEE Transactions on Systems, Man, and Cybernetics, Part A 42(4): 868-879 (2012) | |
| 2011 | ||
| j196 | T. C. Edwin Cheng, Wen-Hsiang Wu, Shuenn-Ren Cheng, Chin-Chia Wu: Two-agent scheduling with position-based deteriorating jobs and learning effects. Applied Mathematics and Computation 217(21): 8804-8824 (2011) | |
| j195 | Danqin Yang, Tsan-Ming Choi, Tiaojun Xiao, T. C. E. Cheng: Coordinating a two-supplier and one-retailer supply chain with forecast updating. Automatica 47(7): 1317-1329 (2011) | |
| j194 | T. C. Edwin Cheng, Shuenn-Ren Cheng, Wen-Hung Wu, Peng-Hsiang Hsu, Chin-Chia Wu: A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Computers & Industrial Engineering 60(4): 534-541 (2011) | |
| j193 | T. C. Edwin Cheng, Chou-Jung Hsu, Dar-Li Yang: Unrelated parallel-machine scheduling with deteriorating maintenance activities. Computers & Industrial Engineering 60(4): 602-605 (2011) | |
| j192 | C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, S. S. Lam: Flowshop scheduling of deteriorating jobs on dominating machines. Computers & Industrial Engineering 61(3): 647-654 (2011) | |
| j191 | Der-Chiang Li, Peng-Hsiang Hsu, Chin-Chia Wu, T. C. Edwin Cheng: Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Computers & Industrial Engineering 61(3): 655-662 (2011) | |
| j190 | T. C. Edwin Cheng, Chou-Jung Hsu, Yi-Chi Huang, Wen-Chiung Lee: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Computers & OR 38(12): 1760-1765 (2011) | |
| j189 | Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng: Best semi-online algorithms for unbounded parallel batch scheduling. Discrete Applied Mathematics 159(8): 838-847 (2011) | |
| j188 | Edouard Wagneur, T. C. Edwin Cheng, C. T. Daniel Ng: A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑wjCj problem. Discrete Applied Mathematics 159(13): 1367-1376 (2011) | |
| j187 | Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. European Journal of Operational Research 210(3): 482-488 (2011) | |
| j186 | L. Yang, C. T. Ng, T. C. Edwin Cheng: Optimal production strategy under demand fluctuations: Technology versus capacity. European Journal of Operational Research 214(2): 393-402 (2011) | |
| j185 | 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) | |
| j184 | Yunan Wu, T. C. E. Cheng: An Erratum on the Multiproduct Network Equilibrium Model. Operations Research 59(5): 1309-1310 (2011) | |
| j183 | Chou-Jung Hsu, T. C. Edwin Cheng, Dar-Li Yang: Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time. Inf. Sci. 181(20): 4799-4803 (2011) | |
| j182 | Jacek Blazewicz, T. C. Edwin Cheng, Maciej Machowiak, Ceyda Oguz: Berth and quay crane allocation: a moldable task scheduling model. JORS 62(7): 1189-1197 (2011) | |
| j181 | Eugene Levner, Amir Elalouf, T. C. Edwin Cheng: An Improved FPTAS for Mobile Agent Routing with Time Constraints. J. UCS 17(13): 1854-1862 (2011) | |
| j180 | Andy C. L. Yeung, Chris K. Y. Lo, T. C. E. Cheng: Behind the Iron Cage: An Institutional Perspective on ISO 9000 Adoption and CEO Compensation. Organization Science 22(6): 1600-1612 (2011) | |
| j179 | Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J. Scheduling 14(4): 361-369 (2011) | |
| j178 | T. C. E. Cheng, Chunyan Gao, Houcai Shen: Production and Inventory Rationing in a Make-to-Stock System With a Failure-Prone Machine and Lost Sales. IEEE Trans. Automat. Contr. 56(5): 1176-1180 (2011) | |
| j177 | Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on unbounded parallel-batch machines with incompatible job families. Theor. Comput. Sci. 412(22): 2380-2386 (2011) | |
| j176 | Qian Cao, Zhaohui Liu, T. C. Edwin Cheng: Semi-online scheduling with known partial information about job sizes on two identical machines. Theor. Comput. Sci. 412(29): 3731-3737 (2011) | |
| c8 | Amir Elalouf, Eugene Levner, T. C. Edwin Cheng: Efficient Routing of Mobile Agents for Agent-Based Integrated Enterprise Management: A General Acceleration Technique. EOMAS 2011: 1-20 | |
| c7 | Amir Elalouf, Eugene Levner, T. C. Edwin Cheng: Computing Mobile Agent Routes with Node-Wise Constraints in Distributed Communication Systems. MICAI (1) 2011: 76-87 | |
| 2010 | ||
| j175 | T. C. Edwin Cheng, Wen-Chiung Lee, Chin-Chia Wu: Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Computers & Industrial Engineering 58(2): 326-331 (2010) | |
| j174 | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: On scheduling unbounded batch processing machine(s). Computers & Industrial Engineering 58(4): 814-817 (2010) | |
| j173 | Eugene Levner, Vladimir Kats, David Alcaide López de Pablo, T. C. Edwin Cheng: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering 59(2): 352-361 (2010) | |
| j172 | Min Ji, T. C. Edwin Cheng: Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan. Computers & Industrial Engineering 59(4): 794-798 (2010) | |
| j171 | C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, L. L. Liu: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Computers & OR 37(1): 83-90 (2010) | |
| j170 | T. C. Edwin Cheng, Xiuli Wang: Machine scheduling with job class setup and delivery considerations. Computers & OR 37(6): 1123-1128 (2010) | |
| j169 | Suh-Jenq Yang, Dar-Li Yang, T. C. Edwin Cheng: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Computers & OR 37(8): 1510-1514 (2010) | |
| j168 | Lianmin Zhang, Yaojun Chen, T. C. Edwin Cheng: The Ramsey numbers for cycles versus wheels of even order. Eur. J. Comb. 31(1): 254-259 (2010) | |
| j167 | C. T. Ng, Mikhail Y. Kovalyov, T. C. E. Cheng: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure. European Journal of Operational Research 200(2): 621-624 (2010) | |
| j166 | L. Yang, C. T. Ng, T. C. Edwin Cheng: Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems. European Journal of Operational Research 201(1): 112-122 (2010) | |
| j165 | Min Ji, T. C. Edwin Cheng: Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan. European Journal of Operational Research 202(1): 90-98 (2010) | |
| j164 | Guowei Hua, Shouyang Wang, T. C. Edwin Cheng: Price and lead time decisions in dual-channel supply chains. European Journal of Operational Research 205(1): 113-126 (2010) | |
| j163 | C. T. Ng, M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov: "Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation. European Journal of Operational Research 207(2): 601-604 (2010) | |
| j162 | Yingxue Zhao, Shouyang Wang, T. C. Edwin Cheng, Xiaoqi Yang, Zhimin Huang: Coordination of supply chains by option contracts: A cooperative game theory approach. European Journal of Operational Research 207(2): 668-675 (2010) | |
| j161 | T. C. E. Cheng, W. H. Yeung: An Empirical Study of the Impact of Brand Name on Personal Customers' Adoption of Internet Banking in Hong Kong. IJEBR 6(1): 32-51 (2010) | |
| j160 | T. C. E. Cheng, M. W. Chung: An Empirical Study of Predicting Hong Kong Consumers' Online Shopping Intentions: Personal Hygiene Products. IJEBR 6(3): 56-70 (2010) | |
| j159 | Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. Inf. Process. Lett. 110(11): 444-450 (2010) | |
| j158 | Min Ji, T. C. Edwin Cheng: Scheduling with job-dependent learning effects and multiple rate-modifying activities. Inf. Process. Lett. 110(11): 460-463 (2010) | |
| j157 | T. C. E. Cheng, S. J. Li, X. Q. Yang: Vector equilibrium flows with nonconvex ordering relations. J. Global Optimization 46(4): 537-542 (2010) | |
| j156 | G. Tang, F. Chen, T. C. Edwin Cheng, C. T. Daniel Ng, Zhi-Long Chen: The loader problem: formulation, complexity and algorithms. JORS 61(5): 840-848 (2010) | |
| j155 | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: On the complexity of bi-criteria scheduling on a single batch processing machine. J. Scheduling 13(6): 629-638 (2010) | |
| j154 | Wing-Kwan Yeung, Tsan-Ming Choi, T. C. Edwin Cheng: Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows. IEEE Trans. Automat. Contr. 55(12): 2767-2777 (2010) | |
| j153 | 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) | |
| j152 | C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan: Preemptive scheduling with simple linear deterioration on a single machine. Theor. Comput. Sci. 411(40-42): 3578-3586 (2010) | |
| 2009 | ||
| j151 | C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng: Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. APJOR 26(6): 715-734 (2009) | |
| j150 | Yaojun Chen, T. C. Edwin Cheng, Zhengke Miao, C. T. Ng: The Ramsey numbers for cycles versus wheels of odd order. Appl. Math. Lett. 22(12): 1875-1876 (2009) | |
| j149 | Huajun Tang, T. C. E. Cheng, C. T. Ng: Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. Computers & Industrial Engineering 57(3): 707-712 (2009) | |
| j148 | 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) | |
| j147 | 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) | |
| j146 | T. C. Edwin Cheng, Alexander A. Lazarev, Evgeny R. Gafarov: A hybrid algorithm for the single-machine total tardiness problem. Computers & OR 36(2): 308-315 (2009) | |
| j145 | Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang: Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers & OR 36(10): 2748-2751 (2009) | |
| j144 | T. C. Edwin Cheng, Bertrand M. T. Lin, Y. Tian: Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times. Computers & OR 36(11): 3031-3040 (2009) | |
| j143 | 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) | |
| j142 | 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) | |
| j141 | 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) | |
| j140 | 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) | |
| j139 | 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) | |
| j138 | T. C. Edwin Cheng, Yaojun Chen, C. T. Ng: Codiameters of 3-domination critical graphs with toughness more than one. Discrete Mathematics 309(5): 1067-1078 (2009) | |
| j137 | T. C. Edwin Cheng, Yonglin Guo, Shenggui Zhang, Yongjun Du: Extreme values of the sum of squares of degrees of bipartite graphs. Discrete Mathematics 309(6): 1557-1564 (2009) | |
| j136 | Yunqing Zhang, T. C. Edwin Cheng, Yaojun Chen: The Ramsey numbers for Stars of odd Order versus a Wheel of Order nine. Discrete Math., Alg. and Appl. 1(3): 413-436 (2009) | |
| j135 | 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) | |
| j134 | 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) | |
| j133 | 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) | |
| j132 | Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inf. Process. Lett. 109(21-22): 1211-1215 (2009) | |
| j131 | 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) | |
| j130 | Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng: Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness. Oper. Res. Lett. 37(5): 368-374 (2009) | |
| j129 | 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) | |
| j128 | Min Ji, T. C. Edwin Cheng: Parallel-machine scheduling of simple linear deteriorating jobs. Theor. Comput. Sci. 410(38-40): 3761-3768 (2009) | |
| 2008 | ||
| j127 | 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) | |
| j126 | 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) | |
| j125 | 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) | |
| j124 | 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) | |
| j123 | Erfang Shan, T. C. Edwin Cheng: Remarks on the minus (signed) total domination in graphs. Discrete Mathematics 308(15): 3373-3380 (2008) | |
| j122 | 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) | |
| j121 | Erfang Shan, Zuosong Liang, T. C. Edwin Cheng: Clique-transversal Number in Cubic Graphs. Discrete Mathematics & Theoretical Computer Science 10(2) (2008) | |
| j120 | Yaojun Chen, T. C. Edwin Cheng, Yunqing Zhang: The Ramsey numbers R(Cm, K7) and R(C7, K8). Eur. J. Comb. 29(5): 1337-1352 (2008) | |
| j119 | 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) | |
| j118 | 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) | |
| j117 | 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) | |
| j116 | 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) | |
| j115 | 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) | |
| j114 | 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) | |
| j113 | Kee-hung Lai, Christina W. Y. Wong, T. C. Edwin Cheng: A coordination-theoretic investigation of the impact of electronic integration on logistics performance. Information & Management 45(1): 10-20 (2008) | |
| j112 | T. C. Edwin Cheng, L. C. F. Lai, Andy C. L. Yeung: The Driving Forces of Customer Loyalty: A Study of Internet Service Providers in Hong Kong. IJEBR 4(4): 26-42 (2008) | |
| j111 | 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) | |
| j110 | 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) | |
| j109 | 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) | |
| j108 | 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) | |
| j107 | 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) | |
| 2007 | ||
| j106 | 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) | |
| j105 | Ji-Bo Wang, T. C. Edwin Cheng: Scheduling Problems with the Effects of deterioration and Learning. APJOR 24(2): 245-261 (2007) | |
| j104 | Nitin Singh, Kee-hung Lai, T. C. Edwin Cheng: Intra-organizational perspectives on IT-enabled supply chains. Commun. ACM 50(1): 59-65 (2007) | |
| j103 | 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) | |
| j102 | Min Ji, Yong He, T. C. Edwin Cheng: Single-machine scheduling with periodic maintenance to minimize makespan. Computers & OR 34(6): 1764-1770 (2007) | |
| j101 | 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) | |
| j100 | 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) | |
| j99 | 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) | |
| j98 | T. C. Edwin Cheng, Liying Kang, C. T. Ng: Paired domination on interval and circular-arc graphs. Discrete Applied Mathematics 155(16): 2077-2086 (2007) | |
| j97 | T. C. Edwin Cheng, Natalia V. Shakhlevich: Two-machine open shop problem with controllable processing times. Discrete Optimization 4(2): 175-184 (2007) | |
| j96 | 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) | |
| j95 | 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) | |
| j94 | 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) | |
| j93 | 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) | |
| j92 | 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) | |
| j91 | 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) | |
| j90 | 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) | |
| j89 | 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) | |
| j88 | 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) | |
| j87 | Erfang Shan, T. C. Edwin Cheng, Liying Kang: Absorbant of generalized de Bruijn digraphs. Inf. Process. Lett. 105(1): 6-11 (2007) | |
| j86 | 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) | |
| c6 | Zuosong Liang, Erfang Shan, T. C. Edwin Cheng: Clique-Transversal Sets in Cubic Graphs. ESCAPE 2007: 107-115 | |
| c5 | Shuying Peng, Meili Li, Shenggui Zhang, T. C. Edwin Cheng: Some New Structural Properties of Shortest 2-Connected Steiner Networks. FAW 2007: 317-324 | |
| c4 | 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 | |
| 2006 | ||
| j85 | 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) | |
| j84 | 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) | |
| j83 | 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) | |
| j82 | 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) | |
| j81 | 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) | |
| j80 | 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) | |
| j79 | 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) | |
| j78 | T. C. Edwin Cheng, Y. N. Wu: A Multiproduct, Multicriterion Supply-Demand Network Equilibrium Model. Operations Research 54(3): 544-554 (2006) | |
| j77 | 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) | |
| j76 | 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) | |
| j75 | N. Au, Eric W. T. Ngai, T. C. Edwin Cheng: Extending the Understanding of End User Information Systems Satisfaction Formation: An Equitable Needs Fulfillment Model Approach. MIS Quarterly 32(1): 43-66 (2006) | |
| j74 | 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) | |
| j73 | Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng: An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. J. Scheduling 9(4): 343-364 (2006) | |
| j72 | 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) | |
| j71 | 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) | |
| j70 | 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 | ||
| j69 | Kok Lay Teo, T. C. Edwin Cheng, Xiaoqiang Cai, Xiaoqi Yang: Preface. Annals OR 133(1-4): 17-20 (2005) | |
| j68 | Bertrand M. T. Lin, T. C. Edwin Cheng: Two-Machine Flowshop Batching and Scheduling. Annals OR 133(1-4): 149-161 (2005) | |
| j67 | 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) | |
| j66 | 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) | |
| j65 | 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) | |
| j64 | Xiuli Wang, T. C. Edwin Cheng: Two-machine flowshop scheduling with job class setups to minimize total flowtime. Computers & OR 32: 2751-2770 (2005) | |
| j63 | 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) | |
| j62 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Zhaohui Liu: Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research 165(2): 423-443 (2005) | |
| j61 | 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) | |
| j60 | 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) | |
| j59 | H. K. Yau, Eric W. T. Ngai, T. C. Edwin Cheng: Conceptual Framework and Architecture for Agent-Oriented Knowledge Management Supported E-Learning Systems. IJDET 3(2): 48-67 (2005) | |
| j58 | 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) | |
| j57 | 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) | |
| j56 | 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) | |
| c3 | Bing Chen, Shenggui Zhang, T. C. Edwin Cheng: An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs. CJCDGCGT 2005: 21-29 | |
| c2 | Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao: Scheduling to Minimize Makespan with Time-Dependent Processing Times. ISAAC 2005: 925-933 | |
| 2004 | ||
| j55 | 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) | |
| j54 | 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) | |
| j53 | 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) | |
| j52 | 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) | |
| j51 | 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) | |
| j50 | 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) | |
| j49 | Liying Kang, Moo Young Sohn, T. C. Edwin Cheng: Paired-domination in inflated graphs. Theor. Comput. Sci. 320(2-3): 485-494 (2004) | |
| 2003 | ||
| j48 | T. C. Edwin Cheng, Mikhail Y. Kovalyov: Scheduling a Single Server in a Two-machine Flow Shop. Computing 70(2): 167-180 (2003) | |
| j47 | 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) | |
| j46 | 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) | |
| j45 | 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) | |
| j44 | 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) | |
| j43 | 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) | |
| j42 | Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng: On scheduling an unbounded batch machine. Oper. Res. Lett. 31(1): 42-48 (2003) | |
| j41 | 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) | |
| j40 | 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) | |
| j39 | 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) | |
| j38 | 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) | |
| j37 | 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) | |
| 2002 | ||
| j36 | 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) | |
| j35 | 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) | |
| j34 | 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) | |
| j33 | 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) | |
| j32 | Zhaohui Liu, T. C. Edwin Cheng: Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett. 82(2): 107-111 (2002) | |
| j31 | 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) | |
| j30 | 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 | ||
| j29 | T. C. Edwin Cheng, Mikhail Y. Kovalyov: Single Supplier Scheduling for Multiple Deliveries. Annals OR 107(1-4): 51-63 (2001) | |
| j28 | Wing-Kwan 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) | |
| j27 | Wing-Kwan Yeung, Ceyda Oguz, T. C. Edwin Cheng: Single-machine scheduling with a common due window. Computers & OR 28(2): 157-175 (2001) | |
| j26 | 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) | |
| j25 | T. C. E. Cheng, Q. Ding: Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research 134(3): 623-630 (2001) | |
| j24 | T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov: Single machine batch scheduling with resource dependent setup and processing times. European Journal of Operational Research 135(1): 177-183 (2001) | |
| j23 | 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 | ||
| j22 | 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) | |
| j21 | 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 | ||
| j20 | Dirk Biskup, T. C. Edwin Cheng: Multiple-machine scheduling with earliness, tardiness and completion time penalties. Computers & OR 26(1): 45-57 (1999) | |
| j19 | 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) | |
| j18 | T. C. Edwin Cheng, Qing Ding: The time dependent machine makespan problem is strongly NP-complete. Computers & OR 26(8): 749-754 (1999) | |
| j17 | T. C. Edwin Cheng, Mikhail Y. Kovalyov: Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. European Journal of Operational Research 114(2): 403-410 (1999) | |
| j16 | Bertrand M. T. Lin, T. C. Edwin Cheng: Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints. European Journal of Operational Research 116(1): 183-193 (1999) | |
| j15 | 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) | |
| j14 | T. C. Edwin Cheng, Guoqing Wang: Two-Machine Flowshop Scheduling with Consecutive Availability Constraints. Inf. Process. Lett. 71(2): 49-54 (1999) | |
| j13 | 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) | |
| 1998 | ||
| j12 | Xiaoqiang Cai, T. C. Edwin Cheng: Multi-machine Scheduling with Variance Minimization. Discrete Applied Mathematics 84(1-3): 55-70 (1998) | |
| j11 | 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 | ||
| j10 | 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 | ||
| j9 | 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 | ||
| j8 | 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 | ||
| j7 | 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 | ||
| j6 | 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) | |
| c1 | 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 | |
| 1990 | ||
| j5 | 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) | |
| j4 | 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 | ||
| j3 | T. C. Edwin Cheng: Optimal common due-date with limited completion time deviation. Computers & OR 15(2): 91-96 (1988) | |
| 1987 | ||
| j2 | T. C. Edwin Cheng: An algorithm for the con due-date determination and sequencing problem. Computers & OR 14(6): 537-542 (1987) | |
| 1986 | ||
| j1 | ||
Colors in the list of coauthors
Last update Sun May 26 11:21:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page