Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDT. C. E. Cheng
T. C. Edwin Cheng – Tai Chiu Edwin Cheng
Person information
- affiliation: Hong Kong Polytechnic University, Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j496]Majid Azadi, T. C. E. Cheng, Reza Kazemi Matin, Reza Farzipoor Saen
:
The COVID-19 pandemic and the performance of healthcare supply chains. Ann. Oper. Res. 335(1): 535-562 (2024)- [j495]T. C. E. Cheng, Shu Guo, Chi To Ng:
Operational research in health care: Overview and future research agenda. Comput. Ind. Eng. 187: 109847 (2024) - [j494]Tzu-Ling Huang, Gen-Yih Liao, T. C. E. Cheng, Wei-Xuan Chen, Ching-I Teng:
Tomorrow will be better: Gamers' expectation and game usage. Comput. Hum. Behav. 151: 108021 (2024) - [j493]Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. Discret. Appl. Math. 345: 141-146 (2024) - [j492]Ting Zhang, Tsan-Ming Choi, Tai Chiu Edwin Cheng:
Competitive pricing and product strategies in the presence of consumers' social comparisons. Eur. J. Oper. Res. 312(2): 573-586 (2024) - [j491]Xiaoping Xu, Yuanyuan Yang, Fang Chen, T. C. Edwin Cheng, Hao Qin:
Supply chain coordination with financial constraints considering delivery time and cross-channel spillover effect. Int. Trans. Oper. Res. 31(2): 1021-1060 (2024) - [j490]Yang Peng, Junjie Lu, Tai Chiu Edwin Cheng, Min Ji:
Revenue sharing or not? Coordination of the buy-online-and-pickup-in-store supply chain. Int. Trans. Oper. Res. 31(3): 1917-1948 (2024) - [j489]Fan-Chen Tseng, Pei-Hsun Emma Liu, T. C. Edwin Cheng, Ching-I Teng:
Using online English learning resources: utilitarian and hedonic perspectives. Online Inf. Rev. 48(1): 187-208 (2024) - [j488]Tiaojun Xiao, Tsan-Ming Choi, T. C. E. Cheng:
Collection Responsibility Choice for Competing E-Tailing Supply Chains With Consumer Returns. IEEE Trans. Engineering Management 71: 283-295 (2024) - [j487]Shuai Liu, Guowei Hua, T. C. Edwin Cheng, Tsan-Ming Choi:
Optimal Pricing and Quality Decisions in Supply Chains With Consumers' Anticipated Regret and Online Celebrity Retailers. IEEE Trans. Engineering Management 71: 1115-1129 (2024) - [j486]Xiaowei Li, Guowei Hua, T. C. Edwin Cheng, Tsan-Ming Choi:
What Does Cross-Industry-Production Bring Under COVID-19? A Multi-Methodological Study. IEEE Trans. Engineering Management 71: 1230-1244 (2024) - [j485]Xiaocun Mao, Juliang Zhang, T. C. Edwin Cheng, Yunhui Liu:
How to Choose a Downstream Partner for a Manufacturer Considering Firms' Personal Traits? IEEE Trans. Engineering Management 71: 1409-1421 (2024) - [j484]Jia Song, Juliang Zhang, T. C. Edwin Cheng:
Supply Chain Coordination Facing Boundedly Rational Strategic Customers. IEEE Trans. Engineering Management 71: 3688-3699 (2024) - 2023
- [j483]Tarun Jain, Jishnu Hazra, T. C. E. Cheng:
Analysis of upstream pricing regulation and contract structure in an agriculture supply chain. Ann. Oper. Res. 320(1): 85-122 (2023) - [j482]Yuqing Pan, C. T. Ng, Ciwei Dong, T. C. E. Cheng:
Information sharing and coordination in a vaccine supply chain. Ann. Oper. Res. 329(1): 1197-1220 (2023) - [j481]Min Ji, Kaili Qi, T. C. E. Cheng, Yiwei Jiang:
A Unified Approach to Single-Machine Scheduling with Position-Based Processing Times, Machine Availability, and Job Rejection. Asia Pac. J. Oper. Res. 40(6): 2250040:1-2250040:17 (2023) - [j480]Qi Wang, Hui Li, Dujuan Wang, T. C. E. Cheng, Yunqiang Yin:
Bi-objective perishable product delivery routing problem with stochastic demand. Comput. Ind. Eng. 175: 108837 (2023) - [j479]Yiwei Jiang, Xuelian Tang, Kai Li, T. C. E. Cheng, Min Ji:
Approximation algorithms for bi-objective parallel-machine scheduling in green manufacturing. Comput. Ind. Eng. 176: 108949 (2023) - [j478]Mostafa Khatami, Amir Salehipour, T. C. E. Cheng:
Flow-shop scheduling with exact delays to minimize makespan. Comput. Ind. Eng. 183: 109456 (2023) - [j477]Dujuan Wang, Jian Peng, Hengfei Yang, T. C. E. Cheng, Yuze Yang:
Distributionally robust location-allocation with demand and facility disruption uncertainties in emergency logistics. Comput. Ind. Eng. 184: 109617 (2023) - [j476]Thi Tuan Linh Pham, Tzu-Ling Huang, Gen-Yih Liao, Yu-Jen Chou, T. C. E. Cheng, Ching-I Teng:
Cooperate to play: How in-game cooperation knowledge impacts online gamer loyalty. Comput. Hum. Behav. 143: 107686 (2023) - [j475]Xiaochang Liu, Dujuan Wang, Yunqiang Yin, T. C. E. Cheng:
Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands. Comput. Oper. Res. 151: 106119 (2023) - [j474]Zunhao Luo, Yunqiang Yin, Dujuan Wang, T. C. E. Cheng, Chin-Chia Wu:
Wasserstein distributionally robust chance-constrained program with moment information. Comput. Oper. Res. 152: 106150 (2023) - [j473]Kannan Govindan, Suresh P. Sethi, T. C. E. Cheng, Susan Feng Lu:
Designing supply chain strategies against epidemic outbreaks such as COVID-19: Review and future research directions. Decis. Sci. 54(4): 365-374 (2023) - [j472]Yongjian Yang, Yunqiang Yin, Dujuan Wang, Joshua Ignatius, T. C. E. Cheng, Lalitha Dhamotharan:
Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics. Eur. J. Oper. Res. 305(3): 1042-1062 (2023) - [j471]Sarat Kumar Jena, Sidhartha S. Padhi, T. C. E. Cheng:
Optimal selection of supply chain financing programmes for a financially distressed manufacturer. Eur. J. Oper. Res. 306(1): 457-477 (2023) - [j470]Yujing Chen, Yuanguang Zhong, T. C. E. Cheng:
Impacts of the minimum quantity contract on an online retail platform. Eur. J. Oper. Res. 306(3): 1236-1247 (2023) - [j469]Luoyi Sun, Guowei Hua, T. C. E. Cheng, Ruud H. Teunter, Jingxin Dong, Yixiao Wang:
Purchase or rent? Optimal pricing for 3D printing capacity sharing platforms. Eur. J. Oper. Res. 307(3): 1192-1205 (2023) - [j468]Xiaoping Xu, Zhaofu Hong, Yujing Chen, T. C. E. Cheng:
When is it wise to use artificial intelligence for platform operations considering consumer returns? Eur. J. Oper. Res. 308(3): 1188-1205 (2023) - [j467]Ke Chen, T. C. E. Cheng, Hailiang Huang, Min Ji, Danli Yao:
Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs. Eur. J. Oper. Res. 309(1): 24-34 (2023) - [j466]Xiaoping Xu, Ping He, Li Zhou, T. C. E. Cheng:
Coordination of a platform-based supply chain in the marketplace or reselling mode considering cross-channel effect and blockchain technology. Eur. J. Oper. Res. 309(1): 170-187 (2023) - [j465]Xiaoping Xu, Luling Yan, Tsan-Ming Choi, T. C. E. Cheng:
When Is It Wise to Use Blockchain for Platform Operations with Remanufacturing? Eur. J. Oper. Res. 309(3): 1073-1090 (2023) - [j464]Yunqiang Yin, Dongwei Li, Dujuan Wang, Joshua Ignatius, T. C. E. Cheng, Sutong Wang:
A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows. Eur. J. Oper. Res. 309(3): 1125-1144 (2023) - [j463]Yue Zhai, Guowei Hua, Meng Cheng, T. C. E. Cheng:
Production lead-time hedging and order allocation in an MTO supply chain. Eur. J. Oper. Res. 311(3): 887-905 (2023) - [j462]Shuai Liu, Guowei Hua, T. C. E. Cheng, Tsan-Ming Choi, Jing-Xin Dong:
Pricing strategies for logistics robot sharing platforms. Int. J. Prod. Res. 61(2): 410-426 (2023) - [j461]Yadong Xu, Guowei Hua, T. C. E. Cheng, Tsan-Ming Choi, Yisong Li, Shuai Liu:
Retailing and ordering strategies for online apparel retailers facing bracketing purchase behaviour. Int. J. Prod. Res. 61(9): 2841-2853 (2023) - [j460]Majid Azadi, Zohreh Moghaddas, T. C. E. Cheng, Reza Farzipoor Saen:
Assessing the sustainability of cloud computing service providers for Industry 4.0: a state-of-the-art analytical approach. Int. J. Prod. Res. 61(12): 4196-4213 (2023) - [j459]Tongshui Xia, Yuyan Wang, Lingxue Lv, Liang Shen, T. C. E. Cheng:
Financing decisions of low-carbon supply Chain under Chain-to-Chain competition. Int. J. Prod. Res. 61(18): 6153-6176 (2023) - [j458]Nina Shin, T. C. E. Cheng:
Gaining user confidence in banking industry's quest for digital transformation: a product-service system management perspective. Ind. Manag. Data Syst. 123(8): 2216-2240 (2023) - [j457]Yuyan Wang, Fei Lin, T. C. E. Cheng, Fu Jia, Yulin Sun:
Carbon allowance approach for capital-constrained supply chain under carbon emission allowance repurchase strategy. Ind. Manag. Data Syst. 123(10): 2488-2521 (2023) - [j456]Lei Wu, Xunyan Jiang, Yunqiang Yin, T. C. E. Cheng, Xiutian Sima:
Multi-band remote sensing image fusion based on collaborative representation. Inf. Fusion 90: 23-35 (2023) - [j455]Fan-Chen Tseng, Tzu-Ling Huang, T. C. E. Cheng, Ching-I Teng:
Evaluating e-commerce website qualities: personality traits as triggers. Internet Res. 33(2): 741-773 (2023) - [j454]Sangmi Chai, Bomi Choi, Minkyun Kim, T. C. E. Cheng:
Why do people speak about products online? The role of opinion leadership. Inf. Technol. Manag. 24(1): 1-17 (2023) - [j453]Tarun Jain, Jishnu Hazra, T. C. E. Cheng:
New product design decisions and free sharing of patents with rivals. J. Oper. Res. Soc. 74(1): 59-80 (2023) - [j452]Qi Wei, Yong Wu, T. C. E. Cheng, Fengxin Sun, Yiwei Jiang:
Online hierarchical parallel-machine scheduling in shared manufacturing to minimize the total completion time. J. Oper. Res. Soc. 74(11): 2432-2454 (2023) - [j451]Changwen Li, Bin Cao, Yong-Wu Zhou, T. C. Edwin Cheng:
Pricing, coalition stability, and profit allocation in the pull assembly supply chains under competition. OR Spectr. 45(3): 977-1011 (2023) - [j450]Xing Chai, Wenhua Li, C. T. Ng, T. C. E. Cheng:
Approximation algorithms for batch scheduling with processing set restrictions. J. Sched. 26(6): 523-533 (2023) - [j449]Gang Li, Kaining Yan, Zelong Wei, T. C. Edwin Cheng:
Can Servitization Enhance Customer Loyalty? The Roles of Organizational IT, Social Media, and Service-Oriented Corporate Culture. IEEE Trans. Engineering Management 70(1): 40-54 (2023) - [j448]Sutong Wang, Jiacheng Zhu, Yunqiang Yin, Dujuan Wang, T. C. Edwin Cheng, Yanzhang Wang:
Interpretable Multi-Modal Stacking-Based Ensemble Learning Method for Real Estate Appraisal. IEEE Trans. Multim. 25: 315-328 (2023) - 2022
- [j447]Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. 4OR 20(2): 273-287 (2022) - [j446]Ke Yan, Guowei Hua, T. C. E. Cheng:
Cooperative Promotion of Cross-Market Firms Adopting 3D Printing Technology. Asia Pac. J. Oper. Res. 39(1): 2140028:1-2140028:41 (2022) - [j445]Jie Xu, Chunlin Luo, C. T. Ng, Xuehao Feng, T. C. E. Cheng:
Remanufacturing with random yield in the presence of the take-back regulation. Comput. Ind. Eng. 168: 108097 (2022) - [j444]Mohammed Nawazish, Sidhartha S. Padhi, T. C. Edwin Cheng:
Stratified delivery aid plans for humanitarian aid distribution centre selection. Comput. Ind. Eng. 171: 108451 (2022) - [j443]Xiaozhou He, Jie Xiang, Jin Xiao, T. C. E. Cheng, Yuhang Tian:
An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands. Comput. Oper. Res. 148: 105991 (2022) - [j442]Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
On cycle-nice claw-free graphs. Discret. Math. 345(7): 112876 (2022) - [j441]Rongda Chen, Ze Wang, Liu Yang, Chi To Ng, T. C. E. Cheng:
A Study on Operational Risk and Credit Portfolio Risk Estimation Using Data Analytics. Decis. Sci. 53(1): 84-123 (2022) - [j440]Xun Tong, Kevin W. Linderman, Chris K. Y. Lo, Kee-hung Lai, T. C. E. Cheng:
Anti-Learning Behavior Toward Safety Risk: The Roles of Internal Context and Social Contagion. Decis. Sci. 53(5): 932-961 (2022) - [j439]Gen-Yih Liao, Thi Tuan Linh Pham, Hsin-Yi Huang, T. C. E. Cheng, Ching-I Teng:
Real-world demotivation as a predictor of continued video game playing: A study on escapism, anxiety and lack of intrinsic motivation. Electron. Commer. Res. Appl. 53: 101147 (2022) - [j438]Shuang He, Jian Zhang, Juliang Zhang, T. C. E. Cheng:
Production/inventory competition between firms with fixed-proportions co-production systems. Eur. J. Oper. Res. 299(2): 497-509 (2022) - [j437]Yue Zhai, T. C. E. Cheng:
Lead-time quotation and hedging coordination in make-to-order supply chain. Eur. J. Oper. Res. 300(2): 449-460 (2022) - [j436]Juliang Zhang, Lan Deng, Huimin Liu, T. C. E. Cheng:
Which strategy is better for managing multi-product demand uncertainty: Inventory substitution or probabilistic selling? Eur. J. Oper. Res. 302(1): 79-95 (2022) - [j435]K. Nageswara Reddy, Akhilesh Kumar, Alok Choudhary, T. C. Edwin Cheng:
Multi-period green reverse logistics network design: An improved Benders-decomposition-based heuristic approach. Eur. J. Oper. Res. 303(2): 735-752 (2022) - [j434]Xuemei Zhang, Yaojun Chen, T. C. Edwin Cheng:
Bounds for two multicolor Ramsey numbers concerning quadrilaterals. Finite Fields Their Appl. 79: 101999 (2022) - [j433]Xuemei Zhang, Yaojun Chen, T. C. Edwin Cheng:
On the 3-Color Ramsey Numbers R(C4, C4, Wn). Graphs Comb. 38(3): 103 (2022) - [j432]Mingyang Zhang, Jiayue Lu, Ning Ma, T. C. Edwin Cheng, Guowei Hua:
A Feature Engineering and Ensemble Learning Based Approach for Repeated Buyers Prediction. Int. J. Comput. Commun. Control 17(6) (2022) - [j431]Tzu-Ling Huang, Chun-Han Chen, Gen-Yih Liao, T. C. E. Cheng, Ching-I Teng:
How to Enhance Vendor-Specific Perceived Effectiveness of E-Commerce Institutional Mechanisms and Online Shopper Loyalty. Int. J. Electron. Commer. 26(2): 222-244 (2022) - [j430]Fan-Chen Tseng, Tzu-Ling Huang, Thi Tuan Linh Pham, T. C. E. Cheng, Ching-I Teng:
How does media richness foster online gamer loyalty? Int. J. Inf. Manag. 62: 102439 (2022) - [j429]Ching-I Teng, Wen-Lung Shiau, T. C. E. Cheng, Hsin-Yi Huang:
Drawing goals nearer: Using the goal-gradient perspective to increase online game usage. Int. J. Inf. Manag. 66: 102522 (2022) - [j428]Shouting Zhao, Juliang Zhang, T. C. E. Cheng:
Coordinating supply chains with uncertain production cost by incomplete contracts. Int. J. Prod. Res. 60(4): 1386-1410 (2022) - [j427]Min Ji, Shengkai Hu, Yuan Zhang, T. C. E. Cheng, Yiwei Jiang:
Parallel-machine scheduling with identical machine resource capacity limits and DeJong's learning effect. Int. J. Prod. Res. 60(9): 2753-2765 (2022) - [j426]Ke Yan, Guowei Hua, T. C. E. Cheng, Shouyang Wang, Jing-Xin Dong:
Joint promotion of cross-market retailers: models and analysis. Int. J. Prod. Res. 60(11): 3397-3418 (2022) - [j425]Yunqiang Yin, Feng Chu, Alexandre Dolgui, T. C. E. Cheng, MengChu Zhou:
Big data analytics in production and distribution management. Int. J. Prod. Res. 60(22): 6682-6690 (2022) - [j424]T. C. Edwin Cheng, Sachin S. Kamble, Amine Belhadi, Nelson Oly Ndubisi, Kee-hung Lai, Manoj Govind Kharat:
Linkages between big data analytics, circular economy, sustainable supply chain flexibility, and sustainable performance in manufacturing firms. Int. J. Prod. Res. 60(22): 6908-6922 (2022) - [j423]Thi Tuan Linh Pham, Han-Chung Huang, Fan-Chen Tseng, T. C. E. Cheng, Ching-I Teng:
For whom does flow not enhance online gamer loyalty? Ind. Manag. Data Syst. 122(1): 215-234 (2022) - [j422]Rachel W. Y. Yee, Thomas Y. Choi, Andy C. L. Yeung, T. C. E. Cheng:
High-contact services of the transient and high-uncertainty type: managing customer experience. Ind. Manag. Data Syst. 122(3): 752-773 (2022) - [j421]Adegoke Oke, Daniel I. Prajogo, Moronke Idiagbon-Oke, T. C. Edwin Cheng:
Linking environmental forces, absorptive capacity, information sharing and innovation performance. Ind. Manag. Data Syst. 122(7): 1738-1755 (2022) - [j420]Min Ji, Yingchun Zhang, Yuan Zhang, T. C. E. Cheng, Yiwei Jiang:
Single-machine multitasking scheduling with job efficiency promotion. J. Comb. Optim. 44(1): 446-479 (2022) - [j419]Xin Fan, T. C. E. Cheng, Gang Li:
Opaque or Transparent: Quality Disclosure Strategy for Accommodation-Sharing Platforms. J. Theor. Appl. Electron. Commer. Res. 17(2): 414-438 (2022) - [j418]Hung-Pin Shih, Kee-hung Lai, T. C. E. Cheng:
Complied by Belief Consistency: The Cognitive-Information Lens of User-Generated Persuasion. J. Theor. Appl. Electron. Commer. Res. 18(1): 372-393 (2022) - 2021
- [j417]Chi To Ng, T. C. E. Cheng, Eugene Levner, Boris Kriheli:
Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm. Ann. Oper. Res. 296(1): 407-420 (2021) - [j416]T. C. E. Cheng, Boris Kriheli, Eugene Levner, C. T. Ng:
Scheduling an autonomous robot searching for hidden targets. Ann. Oper. Res. 298(1): 95-109 (2021) - [j415]Yunqiang Yin, Doudou Li, Dujuan Wang, T. C. E. Cheng:
Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann. Oper. Res. 298(1): 497-523 (2021) - [j414]Shaoze Cui, Yanzhang Wang, Dujuan Wang, Qian Sai, Ziheng Huang, T. C. E. Cheng:
A two-layer nested heterogeneous ensemble learning predictive method for COVID-19 mortality. Appl. Soft Comput. 113(Part): 107946 (2021) - [j413]Yiwei Jiang, Lijun Guan, Kun Zhang, Chang Liu, T. C. E. Cheng, Min Ji:
A note on scheduling on two identical machines with early work maximization. Comput. Ind. Eng. 153: 107091 (2021) - [j412]Mingyao Sun, Feng Wu, Chi To Ng, T. C. E. Cheng:
Effects of imperfect IoT-enabled diagnostics on maintenance services: A system design perspective. Comput. Ind. Eng. 153: 107096 (2021) - [j411]Yuqing Pan, Chi To Ng, T. C. E. Cheng:
Effect of free-riding behavior on vaccination coverage with customer regret. Comput. Ind. Eng. 159: 107494 (2021) - [j410]Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Comput. Ind. Eng. 159: 107525 (2021) - [j409]Yi Feng, Tingwei Liu, Zhineng Hu, Dujuan Wang, T. C. E. Cheng, Yunqiang Yin:
Casualty transport scheduling considering survival probability and injury classification. Comput. Ind. Eng. 161: 107655 (2021) - [j408]Xiying Yang, Guowei Hua, Linyuan Hu, T. C. E. Cheng, Anqiang Huang:
Joint optimization of order sequencing and rack scheduling in the robotic mobile fulfilment system. Comput. Oper. Res. 135: 105467 (2021) - [j407]Yueyu Wu, Yaojun Chen, T. C. Edwin Cheng:
Degree sums and dominating cycles. Discret. Math. 344(3): 112224 (2021) - [j406]Tarun Jain, Jishnu Hazra, T. C. Edwin Cheng:
IT Outsourcing and Vendor Cost Improvement Strategies under Asymmetric Information. Decis. Sci. 52(5): 1109-1136 (2021) - [j405]Gen-Yih Liao, T. C. E. Cheng, Wen-Lung Shiau, Ching-I Teng:
Impact of online gamers' conscientiousness on team function engagement and loyalty. Decis. Support Syst. 142: 113468 (2021) - [j404]Fan-Chen Tseng, Tzu-Ling Huang, T. C. E. Cheng, Ching-I Teng:
Not all qualities are equal: Moderating role of online shopper conscientiousness in quality evaluation. Electron. Commer. Res. Appl. 47: 101056 (2021) - [j403]Mohammad Mahdi Ahmadian, Amir Salehipour, T. C. E. Cheng:
A meta-heuristic to solve the just-in-time job-shop scheduling problem. Eur. J. Oper. Res. 288(1): 14-29 (2021) - [j402]Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. Eur. J. Oper. Res. 293(1): 79-92 (2021) - [j401]Mohammad Mahdi Ahmadian, Mostafa Khatami, Amir Salehipour, T. C. E. Cheng:
Four decades of research on the open-shop scheduling problem to minimize the makespan. Eur. J. Oper. Res. 295(2): 399-426 (2021) - [j400]Ke Chen, Danli Yao, T. C. E. Cheng, Min Ji:
Production scheduling with autonomous and induced learning. Int. J. Prod. Res. 59(9): 2817-2837 (2021) - [j399]Dujuan Wang, Yugang Yu, Yunqiang Yin, Tai Chiu Edwin Cheng:
Multi-agent scheduling problems under multitasking. Int. J. Prod. Res. 59(12): 3633-3663 (2021) - [j398]L. M. Daphne Yiu, Andy C. L. Yeung, T. C. Edwin Cheng:
The impact of business intelligence systems on profitability and risks of firms. Int. J. Prod. Res. 59(13): 3951-3974 (2021) - [j397]Jia Song, Juliang Zhang, T. C. E. Cheng:
Inventory management and the value of quick response to the retailer facing boundedly rational strategic customers. Int. J. Prod. Res. 59(19): 5743-5757 (2021) - [j396]Yefei Yang, Ciwei Dong, Xin Yao, Peter K. C. Lee, T. C. E. Cheng:
Improving the effectiveness of social media-based crowdsourcing innovations: roles of assurance mechanism and innovator's behaviour. Ind. Manag. Data Syst. 121(2): 478-497 (2021) - [j395]Gen-Yih Liao, Thi Tuan Linh Pham, Tzu-Ling Huang, T. C. E. Cheng, Ching-I Teng:
Impact of workplace frustration on online gamer loyalty. Ind. Manag. Data Syst. 121(5): 1008-1025 (2021) - [j394]Zhixing Luo, Hu Qin, T. C. E. Cheng, Qinghua Wu, Andrew Lim:
A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. INFORMS J. Comput. 33(2): 452-476 (2021) - [j393]Shaoze Cui, Yanzhang Wang, Yunqiang Yin, T. C. E. Cheng, Dujuan Wang, Mingyu Zhai:
A cluster-based intelligence ensemble learning method for classification problems. Inf. Sci. 560: 386-409 (2021) - [j392]Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. J. Comb. Optim. 41(2): 504-525 (2021) - [j391]Hung-Pin Shih, Kee-hung Lai, Xitong Guo, T. C. E. Cheng:
Believe It or Not: Employees Intend to Comply With Information Security Policy Because of the Desire for Trade-Offs. J. Glob. Inf. Manag. 29(6): 1-20 (2021) - [j390]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin:
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. J. Oper. Res. Soc. 72(10): 2286-2289 (2021) - [j389]Pengcheng Xia, Gang Li, T. C. E. Cheng, Ao Shen:
Competition Strategies for Location-Based Mobile Coupon Promotion. J. Theor. Appl. Electron. Commer. Res. 16(7): 3248-3268 (2021) - [j388]Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
A note on competing-agent Pareto-scheduling. Optim. Lett. 15(1): 249-262 (2021) - [j387]Lei Wu, Yunqiang Yin, Xunyan Jiang, T. C. E. Cheng:
Pan-sharpening based on multi-objective decision for multi-band remote sensing images. Pattern Recognit. 118: 108022 (2021) - [j386]Kaining Yan, T. C. Edwin Cheng, Gang Li, Zelong Wei:
Overcoming the Service Paradox by Leveraging Organizational Design and Cultural Factors: A Combined Configuration and Contingency Approach. IEEE Trans. Engineering Management 68(2): 498-512 (2021) - [i2]Xiying Yang, Guowei Hua, Linyuan Hu, T. C. E. Cheng, Tsan-Ming Choi:
Order assignment and picking station scheduling for multiple stations in KIVA warehouses. CoRR abs/2108.09056 (2021) - 2020
- [j385]Omar Abou Kasm, Ali Diabat, T. C. E. Cheng:
The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study. Ann. Oper. Res. 291(1): 435-461 (2020) - [j384]Yi Zhang, Guowei Hua, T. C. E. Cheng, Juliang Zhang:
Cold chain distribution: How to deal with node and arc time windows? Ann. Oper. Res. 291(1): 1127-1151 (2020) - [j383]Bo Peng, Yuan Zhang, Zhipeng Lü, T. C. E. Cheng, Fred W. Glover:
A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading. Comput. Ind. Eng. 142: 106241 (2020) - [j382]T. C. E. Cheng, Svetlana A. Kravchenko, Bertrand M. T. Lin:
Scheduling step-deteriorating jobs to minimize the total completion time. Comput. Ind. Eng. 144: 106329 (2020) - [j381]Xiaowen Wei, Huaxin Qiu, Dujuan Wang, Jiahui Duan, Yanzhang Wang, T. C. E. Cheng:
An integrated location-routing problem with post-disaster relief distribution. Comput. Ind. Eng. 147: 106632 (2020) - [j380]Jun Wu, Hui Yang, Yuan Cheng, Tatsushi Nishi, T. C. E. Cheng:
An N-Enterprise investment game under risk of domino accidents in a chemical cluster: Nash and pareto equilibria. Comput. Chem. Eng. 134: 106705 (2020) - [j379]Gen-Yih Liao, Thi Tuan Linh Pham, T. C. E. Cheng, Ching-I Teng:
Impacts of real-world need satisfaction on online gamer loyalty: Perspective of self-affirmation theory. Comput. Hum. Behav. 103: 91-100 (2020) - [j378]Tao Zhang, Gang Li, T. C. Edwin Cheng, Stephen Shum:
Consumer Inter-Product Showrooming and Information Service Provision in an Omni-Channel Supply Chain. Decis. Sci. 51(5): 1232-1264 (2020) - [j377]Hengyu Liu, Juliang Zhang, T. C. E. Cheng, Yihong Ru:
Optimal production-inventory policy for the multi-period fixed proportions co-production system. Eur. J. Oper. Res. 280(2): 469-478 (2020) - [j376]Jinjiang Yuan, Chi To Ng, T. C. E. Cheng:
Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur. J. Oper. Res. 280(3): 860-875 (2020) - [j375]Mostafa Khatami, Amir Salehipour, T. C. E. Cheng:
Coupled task scheduling with exact delays: Literature review and models. Eur. J. Oper. Res. 282(1): 19-39 (2020) - [j374]Bin Cao, Xin Chen, T. C. Edwin Cheng, Yuanguang Zhong, Yong-Wu Zhou:
Inventory and Financial Strategies with Capital Constraints and Limited Joint Liability. Found. Trends Technol. Inf. Oper. Manag. 14(1-2): 44-59 (2020) - [j373]Gen-Yih Liao, Thi Tuan Linh Pham, T. C. E. Cheng, Ching-I Teng:
How online gamers' participation fosters their team commitment: Perspective of social identity theory. Int. J. Inf. Manag. 52: 102095 (2020) - [j372]Thi Tuan Linh Pham, Han-Chung Huang, T. C. E. Cheng, May-Kuen Wong, Yen-Ni Liao, Ya-Hui Yang, Ching-I Teng:
The need for exercise in exergaming perspective of the uses and gratifications theory. Ind. Manag. Data Syst. 120(6): 1085-1099 (2020) - [j371]Gen-Yih Liao, Tzu-Ling Huang, T. C. E. Cheng, Ching-I Teng:
Impacts of media richness on network features and community commitment in online games. Ind. Manag. Data Syst. 120(7): 1361-1381 (2020) - [j370]Gen-Yih Liao, Tzu-Ling Huang, T. C. E. Cheng, Ching-I Teng:
Why future friends matter: impact of expectancy of relational growth on online gamer loyalty. Internet Res. 30(5): 1479-1501 (2020) - [j369]Tarun Jain, Jishnu Hazra, T. C. E. Cheng:
Bidding for outsourcing contracts with capacity investments and cost asymmetry. J. Oper. Res. Soc. 71(12): 1986-2012 (2020) - [j368]Bo Peng, Yuan Zhang, T. C. E. Cheng, Zhipeng Lü, Abraham P. Punnen:
A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem. Knowl. Based Syst. 196: 105774 (2020) - [j367]Gen-Yih Liao, Fan-Chen Tseng, T. C. E. Cheng, Ching-I Teng:
Impact of gaming habits on motivation to attain gaming goals, perceived price fairness, and online gamer loyalty: Perspective of consistency principle. Telematics Informatics 49: 101367 (2020) - [j366]Gen-Yih Liao, Huynh Van Nguyen, T. C. E. Cheng, Ching-I Teng:
How do social networks foster online gamer loyalty? Perspective of weak/strong tie theory. Telematics Informatics 53: 101437 (2020) - [j365]Tarun Jain, Jishnu Hazra, T. C. Edwin Cheng:
Strategic Sourcing Under Supplier Development Investments. IEEE Trans. Engineering Management 67(3): 902-917 (2020) - [c14]Jing Fan, C. T. Ng, T. C. E. Cheng, Hui Shi:
Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery. AAIM 2020: 525-536
2010 – 2019
- 2019
- [j364]Shihui Tian, Guowei Hua, T. C. E. Cheng:
Optimal Deployment of Charging Piles for Electric Vehicles Under the Indirect Network Effects. Asia Pac. J. Oper. Res. 36(1): 1950007:1-1950007:17 (2019) - [j363]Jie Xiang, Juliang Zhang, T. C. E. Cheng, Jose Maria Sallan, Guowei Hua:
Efficient Multi-Attribute Auctions Considering Supply Disruption. Asia Pac. J. Oper. Res. 36(3): 1950013:1-1950013:28 (2019) - [j362]Dujuan Wang, Jiaqi Zhu, Xiaowen Wei, T. C. E. Cheng, Yunqiang Yin, Yanzhang Wang:
Integrated production and multiple trips vehicle routing with time windows and uncertain travel times. Comput. Oper. Res. 103: 1-12 (2019) - [j361]Xuemei Zhang, Yaojun Chen, T. C. Edwin Cheng:
On three color Ramsey numbers R(C4, C4, K1, n). Discret. Math. 342(2): 285-291 (2019) - [j360]Yuan Gao, Jinjiang Yuan, Chi To Ng, T. C. E. Cheng:
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. Eur. J. Oper. Res. 273(1): 74-81 (2019) - [j359]Hugo K. S. Lam, Andy C. L. Yeung, Chris K. Y. Lo, T. C. E. Cheng:
Should firms invest in social commerce? An integrative perspective. Inf. Manag. 56(8) (2019) - [j358]Min Ji, Wenya Zhang, Lijuan Liao, T. C. E. Cheng, Yuanyuan Tan:
Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment. Int. J. Prod. Res. 57(6): 1667-1684 (2019) - [j357]Juliang Zhang, Shouting Zhao, T. C. Edwin Cheng, Guowei Hua:
Optimisation of online retailer pricing and carrier capacity expansion during low-price promotions with coordination of a decentralised supply chain. Int. J. Prod. Res. 57(9): 2809-2827 (2019) - [j356]Hengyu Liu, Juliang Zhang, Chen Zhou, T. C. E. Cheng, Yihong Ru:
Optimal purchase and selling strategy for wholesaler of produce: sorted or unsorted selling? Int. J. Prod. Res. 57(19): 6031-6047 (2019) - [j355]Fan-Chen Tseng, T. C. E. Cheng, Pei-Ling Yu, Tzu-Ling Huang, Ching-I Teng:
Media richness, social presence and loyalty to mobile instant messaging. Ind. Manag. Data Syst. 119(6): 1357-1373 (2019) - [j354]Gen-Yih Liao, T. C. E. Cheng, Ching-I Teng:
How do avatar attractiveness and customization impact online gamers' flow and loyalty? Internet Res. 29(2): 349-366 (2019) - [j353]Qi Wei, Yong Wu, Yiwei Jiang, T. C. E. Cheng:
Two-machine hybrid flowshop scheduling with identical jobs: Solution algorithms and analysis of hybrid benefits. J. Oper. Res. Soc. 70(5): 817-826 (2019) - [j352]Na Fu, T. C. E. Cheng, Zhongjun Tian:
RFID investment strategy for fresh food supply chains. J. Oper. Res. Soc. 70(9): 1475-1489 (2019) - [j351]Yiwei Jiang, Ping Zhou, T. C. E. Cheng, Min Ji:
Optimal online algorithms for MapReduce scheduling on two uniform machines. Optim. Lett. 13(7): 1663-1676 (2019) - [j350]Siao-Leu Phouratsamay, T. C. E. Cheng:
The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity. Oper. Res. Lett. 47(5): 339-343 (2019) - [c13]Gen-Yih Liao, Thi Tuan Linh Pham, Tzu-Ling Huang, T. C. E. Cheng, Ching-I Teng:
How Do Workplace Frustration and Need Satisfaction Motivate Online Gamer Loyalty? PACIS 2019: 18 - 2018
- [j349]Guowei Hua, T. C. Edwin Cheng, Shouyang Wang, Mincong Tang:
Preface. Asia Pac. J. Oper. Res. 35(2): 1802001:1-1802001:3 (2018) - [j348]Xin Zhang, Lijuan Liao, Wenya Zhang, T. C. E. Cheng, Yuanyuan Tan, Min Ji:
Single-machine group scheduling with new models of position-dependent processing times. Comput. Ind. Eng. 117: 1-5 (2018) - [j347]Min Ji, Ji Fang, Wenya Zhang, Lijuan Liao, T. C. E. Cheng, Yuanyuan Tan:
Logistics scheduling to minimize the sum of total weighted inventory cost and transport cost. Comput. Ind. Eng. 120: 206-215 (2018) - [j346]C. T. Ng, T. C. E. Cheng, Dmitry Tsadikovich, Eugene Levner, Amir Elalouf, Sharon Hovav:
A multi-criterion approach to optimal vaccination planning: Method and solution. Comput. Ind. Eng. 126: 637-649 (2018) - [j345]Han-Chung Huang, T. C. E. Cheng, Weifan Huang, Ching-I Teng:
Who are likely to build strong online social networks? The perspectives of relational cohesion theory and personality theory. Comput. Hum. Behav. 82: 111-123 (2018) - [j344]Na Zhao, T. C. E. Cheng:
A Periodic Collaboration and Coexistence Management Model with the Oscillation Effect for Complex Mega Infrastructure Project under the Risk of Infection. Complex. 2018: 9846074:1-9846074:12 (2018) - [j343]Kannan Govindan, T. C. E. Cheng:
Advances in stochastic programming and robust optimization for supply chain planning. Comput. Oper. Res. 100: 262-269 (2018) - [j342]Tsan-Ming Choi, Juzhi Zhang, T. C. Edwin Cheng:
Quick Response in Supply Chains with Stochastically Risk Sensitive Retailers. Decis. Sci. 49(5): 932-957 (2018) - [j341]Yingxue Zhao, Tsan-Ming Choi, T. C. E. Cheng, Shouyang Wang:
Supply option contracts with spot market and demand information updating. Eur. J. Oper. Res. 266(3): 1062-1071 (2018) - [j340]Ming Jin, Gang Li, T. C. E. Cheng:
Buy online and pick up in-store: Design of the service area. Eur. J. Oper. Res. 268(2): 613-623 (2018) - [j339]Ming Zhao, Ciwei Dong, T. C. E. Cheng:
Quality disclosure strategies for small business enterprises in a competitive marketplace. Eur. J. Oper. Res. 270(1): 218-229 (2018) - [j338]Mingyang Zhang, Juliang Zhang, T. C. E. Cheng, Guowei Hua:
Why and how do branders sell new products on flash sale platforms? Eur. J. Oper. Res. 270(1): 337-351 (2018) - [j337]Han-Chung Huang, T. C. E. Cheng, Weifan Huang, Ching-I Teng:
Impact of online gamers' personality traits on interdependence, network convergence, and continuance intention: Perspective of social exchange theory. Int. J. Inf. Manag. 38(1): 232-242 (2018) - [j336]Yongli Wang, Juliang Zhang, T. C. Edwin Cheng, Guowei Hua:
Quick response under strategic consumers with risk preference and decreasing valuation. Int. J. Prod. Res. 56(1-2): 72-85 (2018) - [j335]Xiaoyun Xiong, Dujuan Wang, T. C. Edwin Cheng, Chin-Chia Wu, Yunqiang Yin:
Single-machine scheduling and common due date assignment with potential machine disruption. Int. J. Prod. Res. 56(3): 1345-1360 (2018) - [j334]Danqin Yang, Tiaojun Xiao, Tsan-Ming Choi, T. C. E. Cheng:
Optimal reservation pricing strategy for a fashion supply chain with forecast update and asymmetric cost information. Int. J. Prod. Res. 56(5): 1960-1981 (2018) - [j333]Kai Li, Huynh Van Nguyen, T. C. E. Cheng, Ching-I Teng:
How do avatar characteristics affect avatar friendliness and online gamer loyalty? Perspective of the theory of embodied cognition. Internet Res. 28(4): 1103-1121 (2018) - [j332]Qingqin Nong, Tao Sun, T. C. E. Cheng, Qizhi Fang:
Bin packing game with a price of anarchy of 3/2. J. Comb. Optim. 35(2): 632-640 (2018) - [j331]Manman Zhang, Juliang Zhang, T. C. E. Cheng, Jose Maria Sallan, Guowei Hua:
Which Inspection Approach Is Better to Prevent Drug Fraud: Announced or Unannounced? J. Syst. Sci. Complex. 31(6): 1571-1590 (2018) - [j330]Fan-Chen Tseng, Thi Tuan Linh Pham, T. C. E. Cheng, Ching-I Teng:
Enhancing customer loyalty to mobile instant messaging: Perspectives of network effect and self-determination theories. Telematics Informatics 35(5): 1133-1143 (2018) - [j329]Tsan-Ming Choi, Wing-Kwan Yeung, T. C. Edwin Cheng, Xiaohang Yue:
Optimal Scheduling, Coordination, and the Value of RFID Technology in Garment Manufacturing Supply Chains. IEEE Trans. Engineering Management 65(1): 72-84 (2018) - [j328]Tiaojun Xiao, Tsan-Ming Choi, T. C. Edwin Cheng:
Pricing and Benefit of Decentralization for Competing Supply Chains With Fixed Costs. IEEE Trans. Engineering Management 65(1): 99-112 (2018) - [c12]Gen-Yih Liao, T. C. E. Cheng, Ching-I Teng:
Not All Are the Same: Facets of Conscientiousness, Competitive Virtual Team Functions, and Continuance Intention. PACIS 2018: 17 - 2017
- [j327]Yingxue Zhao, Tsan-Ming Choi, T. C. E. Cheng, Shouyang Wang:
Mean-risk analysis of wholesale price contracts with stochastic price-dependent demand. Ann. Oper. Res. 257(1-2): 491-518 (2017) - [j326]Win-Chin Lin, Yunqiang Yin, Shuenn-Ren Cheng, T. C. Edwin Cheng, Chia-Han Wu, Chin-Chia Wu:
Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times. Appl. Soft Comput. 52: 877-884 (2017) - [j325]Junwen Ding, Zhipeng Lü, T. C. E. Cheng, Liping Xu:
A hybrid evolutionary approach for the single-machine total weighted tardiness problem. Comput. Ind. Eng. 108: 70-80 (2017) - [j324]Yunqiang Yin, Wenyi Wang, Dujuan Wang, T. C. E. Cheng:
Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval. Comput. Ind. Eng. 111: 202-215 (2017) - [j323]Chuanli Zhao, Ji Fang, T. C. E. Cheng, Min Ji:
A note on the time complexity of machine scheduling with DeJong's learning effect. Comput. Ind. Eng. 112: 447-449 (2017) - [j322]Xuemei Zhang, Yaojun Chen, T. C. Edwin Cheng:
Polarity graphs and Ramsey numbers for C4 versus stars. Discret. Math. 340(4): 655-660 (2017) - [j321]Hung-Pin Shih, Kee-hung Lai, T. C. E. Cheng:
Constraint-based and dedication-based mechanisms for encouraging online self-disclosure: Is personalization the only thing that matters? Eur. J. Inf. Syst. 26(4): 432-450 (2017) - [j320]Xuemei Zhang, Yaojun Chen, T. C. Edwin Cheng:
Some values of Ramsey numbers for C4 versus stars. Finite Fields Their Appl. 45: 73-85 (2017) - [j319]T. C. E. Cheng, B. M. T. Lin:
Demonstrating Johnson's algorithm via resource-constrained scheduling. Int. J. Prod. Res. 55(11): 3326-3330 (2017) - [j318]Fan-Chen Tseng, T. C. E. Cheng, Kai Li, Ching-I Teng:
How does media richness contribute to customer loyalty to mobile instant messaging? Internet Res. 27(3): 520-537 (2017) - [j317]Wen-Hung Wu, Yunqiang Yin, T. C. E. Cheng, Win-Chin Lin, Juei-Chao Chen, Shin-Yi Luo, Chin-Chia Wu:
A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect. J. Oper. Res. Soc. 68(2): 111-120 (2017) - [j316]Min Ji, Sai Liu, Xiaolin Zhang, Keke Cao, T. C. E. Cheng:
Sequencing Games with Slack Due Windows and Group Technology Considerations. J. Oper. Res. Soc. 68(2): 121-133 (2017) - [j315]Yunqiang Yin, T. C. E. Cheng, Dujuan Wang, Chin-Chia Wu:
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. J. Sched. 20(4): 313-335 (2017) - [c11]T. C. E. Cheng, C. T. Ng, Eugene Levner, Boris Kriheli:
A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots. SMARTCOMP 2017: 1-6 - 2016
- [j314]T. C. E. Cheng, Bo Peng, Zhipeng Lü:
A hybrid evolutionary algorithm to solve the job shop scheduling problem. Ann. Oper. Res. 242(2): 223-237 (2016) - [j313]Min Ji, Xiaoying Tang, Xin Zhang, T. C. Edwin Cheng:
Machine scheduling with deteriorating jobs and DeJong's learning effect. Comput. Ind. Eng. 91: 42-47 (2016) - [j312]Yunqiang Yin, Yan Wang, T. C. E. Cheng, Dujuan Wang, Chin-Chia Wu:
Two-agent single-machine scheduling to minimize the batch delivery cost. Comput. Ind. Eng. 92: 16-30 (2016) - [j311]Junwen Ding, Zhipeng Lü, T. C. E. Cheng, Liping Xu:
Breakout dynasearch for the single-machine total weighted tardiness problem. Comput. Ind. Eng. 98: 1-10 (2016) - [j310]Jin Qin, Xianhao Xu, Qinghua Wu, T. C. E. Cheng:
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem. Comput. Oper. Res. 66: 199-214 (2016) - [j309]T. C. E. Cheng, Yakov M. Shafransky, C. T. Ng:
An alternative approach for proving the NP-hardness of optimization problems. Eur. J. Oper. Res. 248(1): 52-58 (2016) - [j308]Zhou He, Bo Fan, T. C. E. Cheng, Shouyang Wang, Chin-Hon Tan:
A mean-shift algorithm for large-scale planar maximal covering location problems. Eur. J. Oper. Res. 250(1): 65-76 (2016) - [j307]B. Q. Fan, T. C. E. Cheng:
Two-agent scheduling in a flowshop. Eur. J. Oper. Res. 252(2): 376-384 (2016) - [j306]Yunqiang Yin, T. C. E. Cheng, Dujuan Wang:
Rescheduling on identical parallel machines with machine disruptions to minimize total completion time. Eur. J. Oper. Res. 252(3): 737-749 (2016) - [j305]Zhou He, T. C. E. Cheng, Jichang Dong, Shouyang Wang:
Evolutionary location and pricing strategies for service merchants in competitive O2O markets. Eur. J. Oper. Res. 254(2): 595-609 (2016) - [j304]Tal Avinadav, Yael Perlman, T. C. E. Cheng:
Economic design of X̅ control charts for monitoring batch manufacturing processes. Int. J. Comput. Integr. Manuf. 29(2): 212-221 (2016) - [j303]Yunqiang Yin, Dujuan Wang, T. C. E. Cheng, Chin-Chia Wu:
Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times. J. Oper. Res. Soc. 67(9) (2016) - [j302]Huan Fan, T. C. E. Cheng, Gang Li, Peter K. C. Lee:
The Effectiveness of Supply Chain Risk Information Processing Capability: An Information Processing Perspective. IEEE Trans. Engineering Management 63(4): 414-425 (2016) - [j301]Yunqiang Yin, Tai Chiu Edwin Cheng, Dujuan Wang, Chin-Chia Wu:
Improved Algorithms for Single-Machine Serial-Batch Scheduling With Rejection to Minimize Total Completion Time and Total Rejection Cost. IEEE Trans. Syst. Man Cybern. Syst. 46(11): 1578-1588 (2016) - 2015
- [j300]Yunqiang Yin, T. C. Edwin Cheng, Xiaoqin Yang, Chin-Chia Wu:
Two-agent single-machine scheduling with unrestricted due date assignment. Comput. Ind. Eng. 79: 148-155 (2015) - [j299]Wenchang Luo, T. C. Edwin Cheng, Min Ji:
Single-machine scheduling with a variable maintenance activity. Comput. Ind. Eng. 79: 168-174 (2015) - [j298]Min Ji, Danli Yao, Qinyun Yang, T. C. E. Cheng:
Machine scheduling with DeJong's learning effect. Comput. Ind. Eng. 80: 195-200 (2015) - [j297]Yunqiang Yin, T. C. E. Cheng, Long Wan, Chin-Chia Wu, Jun Liu:
Two-agent single-machine scheduling with deteriorating jobs. Comput. Ind. Eng. 81: 177-185 (2015) - [j296]Yau-Ren Shiau, Ming-Shua Tsai, Wen-Chiung Lee, T. C. Edwin Cheng:
Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Comput. Ind. Eng. 87: 580-589 (2015) - [j295]Bo Peng, Zhipeng Lü, T. C. E. Cheng:
A tabu search/path relinking algorithm to solve the job shop scheduling problem. Comput. Oper. Res. 53: 154-164 (2015) - [j294]Kannan Govindan, T. C. E. Cheng:
Sustainable supply chain management: Advances in operations research perspective. Comput. Oper. Res. 54: 177-179 (2015) - [j293]Y. H. Venus Lun, Kee-hung Lai, Christina W. Y. Wong, T. C. Edwin Cheng:
Greening and performance relativity: An application in the shipping industry. Comput. Oper. Res. 54: 295-301 (2015) - [j292]Tao Qin, Bo Peng, Una Benlic, T. C. E. Cheng, Yang Wang, Zhipeng Lü:
Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling. Comput. Oper. Res. 61: 81-88 (2015) - [j291]Qingxi Yang, Qingguo Wang, Xing Zhou, Min Zhao, T. C. Edwin Cheng:
Equivalent circuit of external electromagnetic fields coupling to a transmission line above a lossy ground. IEICE Electron. Express 12(19): 20150474 (2015) - [j290]Yunqiang Yin, Wen-Hung Wu, T. C. E. Cheng, Chin-Chia Wu:
Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. Int. J. Comput. Integr. Manuf. 28(7): 781-790 (2015) - [j289]Yong Wu, T. C. E. Cheng, Min Ji:
Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines. Inf. Process. Lett. 115(11): 838-844 (2015) - [j288]Hung-Pin Shih, Kee-hung Lai, T. C. Edwin Cheng:
Examining structural, perceptual, and attitudinal influences on the quality of information sharing in collaborative technology use. Inf. Syst. Frontiers 17(2): 455-470 (2015) - [j287]Min Ji, Danli Yao, Qinyun Yang, T. C. E. Cheng:
Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity. Int. Trans. Oper. Res. 22(6): 997-1015 (2015) - [j286]Xiuli Wang, Guodong Huang, Xiuwu Hu, T. C. Edwin Cheng:
Order acceptance and scheduling on two identical parallel machines. J. Oper. Res. Soc. 66(10): 1755-1767 (2015) - [j285]Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng:
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. J. Sched. 18(2): 147-153 (2015) - [j284]Min Ji, Qinyun Yang, Danli Yao, T. C. E. Cheng:
Single-machine batch scheduling of linear deteriorating jobs. Theor. Comput. Sci. 580: 36-49 (2015) - [j283]Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Single-machine batch scheduling with job processing time compatibility. Theor. Comput. Sci. 583: 57-66 (2015) - [j282]Gang Li, Feng Feng Huang, T. C. Edwin Cheng, Ping Ji:
Competition Between Manufacturer's Online Customization Channel and Conventional Retailer. IEEE Trans. Engineering Management 62(2): 150-157 (2015) - [j281]Tiaojun Xiao, Tsan-Ming Choi, T. C. E. Cheng:
Optimal Variety and Pricing Decisions of a Supply Chain With Economies of Scope. IEEE Trans. Engineering Management 62(3): 411-420 (2015) - [c10]Hung-Pin Shih, Kee-hung Lai, T. C. E. Cheng:
A Dual-Process Model to Assess User Attitudes and the Likelihood of Electronic Word-Of-Mouth Adoption. PACIS 2015: 226 - 2014
- [j280]Jianyou Xu, Yunqiang Yin, T. C. E. Cheng, Chin-Chia Wu, Shusheng Gu:
A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan. Appl. Soft Comput. 24: 277-283 (2014) - [j279]Min Ji, Ke Chen, Jiaojiao Ge, T. C. E. Cheng:
Group scheduling and job-dependent due window assignment based on a common flow allowance. Comput. Ind. Eng. 68: 35-41 (2014) - [j278]Huajun Tang, Amir Elalouf, Eugene Levner, T. C. E. Cheng:
Efficient computation of evacuation routes on a three-dimensional geometric network. Comput. Ind. Eng. 76: 231-242 (2014) - [j277]T. C. Edwin Cheng, Chih-Yu Liu, Wen-Chiung Lee, Min Ji:
Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions. Comput. Ind. Eng. 78: 66-73 (2014) - [j276]Yaojun Chen, T. C. E. Cheng, Yunqing Zhang, Guofei Zhou:
The planar Ramsey number PR(C4, K8). Discret. Appl. Math. 171: 28-34 (2014) - [j275]Tiaojun Xiao, Tsan-Ming Choi, T. C. E. Cheng:
Product variety and channel structure strategy for a retailer-Stackelberg supply chain. Eur. J. Oper. Res. 233(1): 114-124 (2014) - [j274]Xiutian Shi, Houcai Shen, Ting Wu, T. C. E. Cheng:
Production planning and pricing policy in a make-to-stock system with uncertain demand subject to machine breakdowns. Eur. J. Oper. Res. 238(1): 122-129 (2014) - [j273]Gang Li, Feng Feng Huang, T. C. E. Cheng, Quan Zheng, Ping Ji:
Make-or-buy service capacity decision in a supply chain providing after-sales service. Eur. J. Oper. Res. 239(2): 377-388 (2014) - [j272]Yingxue Zhao, Tsan-Ming Choi, T. C. E. Cheng, Suresh P. Sethi, Shouyang Wang:
Buyback contracts with price-dependent demands: Effects of demand uncertainty. Eur. J. Oper. Res. 239(3): 663-673 (2014) - [j271]Yiwei Jiang, Jueliang Hu, Longcheng Liu, Yuqing Zhu, T. C. E. Cheng:
Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost. Inf. Sci. 269: 128-141 (2014) - [j270]Yunqiang Yin, T. C. Edwin Cheng, Chin-Chia Wu, Shuenn-Ren Cheng:
Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. J. Oper. Res. Soc. 65(1): 1-13 (2014) - [j269]B. Zhang, C. T. Ng, T. C. E. Cheng:
Multi-period empty container repositioning with stochastic demand and lost sales. J. Oper. Res. Soc. 65(2): 302-319 (2014) - [j268]Chi To Ng, Tai Chiu Edwin Cheng, Andrei M. Bandalouski, Mikhail Y. Kovalyov, Sze Sing Lam:
A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines. J. Oper. Res. Soc. 65(10): 1571-1579 (2014) - [j267]T. C. E. Cheng, Wen-Hung Kuo, Dar-Li Yang:
Scheduling with a position-weighted learning effect. Optim. Lett. 8(1): 293-306 (2014) - [j266]L. L. Liu, C. T. Ng, T. C. E. Cheng:
Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan. Optim. Lett. 8(1): 307-318 (2014) - [j265]T. C. E. Cheng, Shih-Chang Tseng, Peng-Jen Lai, Wen-Chiung Lee:
Single-machine scheduling with accelerating deterioration effects. Optim. Lett. 8(2): 543-554 (2014) - [j264]Hongyun Xu, Zhipeng Lü, T. C. E. Cheng:
Iterated Local Search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness. J. Sched. 17(3): 271-287 (2014) - [j263]Yong Wu, T. C. E. Cheng, Min Ji:
Optimal algorithms for semi-online machine covering on two hierarchical machines. Theor. Comput. Sci. 531: 37-46 (2014) - [j262]Jian Li, Tsan-Ming Choi, T. C. Edwin Cheng:
Mean Variance Analysis of Fast Fashion Supply Chains With Returns Policy. IEEE Trans. Syst. Man Cybern. Syst. 44(4): 422-434 (2014) - [j261]Zhou He, T. C. E. Cheng, Jichang Dong, Shouyang Wang:
Evolutionary Location and Pricing Strategies in Competitive Hierarchical Distribution Systems: A Spatial Agent-Based Model. IEEE Trans. Syst. Man Cybern. Syst. 44(7): 822-833 (2014) - [i1]Bo Peng, Zhipeng Lü, T. C. E. Cheng:
A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem. CoRR abs/1402.5613 (2014) - 2013
- [j260]Ling-Huey Su, T. C. E. Cheng, Fuh-Der Chou:
A minimum-cost network flow approach to preemptive parallel-machine scheduling. Comput. Ind. Eng. 64(1): 453-458 (2013) - [j259]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. Comput. Ind. Eng. 65(2): 226-232 (2013) - [j258]Yunqiang Yin, T. C. E. Cheng, Shuenn-Ren Cheng, Chin-Chia Wu:
Single-machine batch delivery scheduling with an assignable common due date and controllable processing times. Comput. Ind. Eng. 65(4): 652-662 (2013) - [j257]Min Ji, Jiaojiao Ge, Ke Chen, T. C. Edwin Cheng:
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity. Comput. Ind. Eng. 66(4): 952-961 (2013) - [j256]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. Comput. Oper. Res. 40(1): 353-361 (2013) - [j255]Yunqiang Yin, T. C. E. Cheng, Jiayin Wang, Chin-Chia Wu:
Single-machine common due window assignment and scheduling to minimize the total cost. Discret. Optim. 10(1): 42-53 (2013) - [j254]Chang Hwan Lee, Byong-Duk Rhee, T. C. E. Cheng:
Quality uncertainty and quality-compensation contract for supply chain coordination. Eur. J. Oper. Res. 228(3): 582-591 (2013) - [j253]Yingxue Zhao, Lijun Ma, Gang Xie, T. C. E. Cheng:
Coordination of supply chains with bidirectional option contracts. Eur. J. Oper. Res. 229(2): 375-381 (2013) - [j252]Hung-Pin Shih, Kee-hung Lai, T. C. E. Cheng:
Informational and Relational Influences on Electronic Word of Mouth: An Empirical Study of an Online Consumer Discussion Forum. Int. J. Electron. Commer. 17(4): 137-166 (2013) - [j251]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. Ind. Manag. Data Syst. 113(4): 573-588 (2013) - [j250]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) - [j249]Yunqiang Yin, Min Liu, T. C. E. Cheng, Chin-Chia Wu, Shuenn-Ren Cheng:
Four single-machine scheduling problems involving due date determination decisions. Inf. Sci. 251: 164-181 (2013) - [j248]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) - [j247]Amir Elalouf, Eugene Levner, T. C. E. Cheng:
Efficient Routing of Mobile Agents in a Stochastic Network. Polibits 47: 61-66 (2013) - [j246]B. Q. Fan, T. C. Edwin Cheng, S. S. Li, Q. Feng:
Bounded parallel-batching scheduling with two competing agents. J. Sched. 16(3): 261-271 (2013) - [j245]S. S. Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, Jinjiang Yuan:
A note on reverse scheduling with maximum lateness objective. J. Sched. 16(4): 417-422 (2013) - [j244]Fuyong Lin, T. C. E. Cheng, Cheng Huang, Xiaoheng Liang, Jianan Zhao:
Developing an Organization Design Framework and Sample Based on the Total Relationship Flow Management Theorems. IEEE Trans. Syst. Man Cybern. Syst. 43(6): 1466-1476 (2013) - 2012
- [j243]Yunqiang Yin, Shuenn-Ren Cheng, T. C. E. Cheng, Chin-Chia Wu, Wen-Hsiang Wu:
Two-agent single-machine scheduling with assignable due dates. Appl. Math. Comput. 219(4): 1674-1685 (2012) - [j242]C. T. Ng, Q. Ding, T. C. E. Cheng, Sze Sing Lam:
Preemptive repayment policy for multiple loans. Ann. Oper. Res. 192(1): 141-150 (2012) - [j241]Xiuli Wang, T. C. E. Cheng:
Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates. Comput. Ind. Eng. 62(2): 451-456 (2012) - [j240]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. Comput. Ind. Eng. 63(1): 223-234 (2012) - [j239]T. C. Edwin Cheng, Bertrand M. T. Lin, H. L. Huang:
Resource-constrained flowshop scheduling with separate resource recycling operations. Comput. Oper. Res. 39(6): 1206-1212 (2012) - [j238]Shih-Hsin Chen, Pei-Chann Chang, T. C. E. Cheng, Qingfu Zhang:
A Self-guided Genetic Algorithm for permutation flowshop scheduling problems. Comput. Oper. Res. 39(7): 1450-1457 (2012) - [j237]Dar-Li Yang, T. C. E. Cheng, Suh-Jenq Yang, Chou-Jung Hsu:
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities. Comput. Oper. Res. 39(7): 1458-1464 (2012) - [j236]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. Discret. Appl. Math. 160(7-8): 1191-1210 (2012) - [j235]Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang:
A theorem on cycle-wheel Ramsey number. Discret. Math. 312(5): 1059-1061 (2012) - [j234]Guowei Hua, Shouyang Wang, T. C. E. Cheng:
Optimal order lot sizing and pricing with free shipping. Eur. J. Oper. Res. 218(2): 435-441 (2012) - [j233]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. Manag. Inf. Syst. 28(3): 161-200 (2012) - [j232]Ji-Bo Wang, Ping Ji, T. C. E. Cheng, Dan Wang:
Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optim. Lett. 6(7): 1393-1409 (2012) - [j231]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) - [j230]Chi To Ng, Dong-Ping Song, T. C. E. Cheng:
Optimal Policy for Inventory Transfer Between Two Depots With Backlogging. IEEE Trans. Autom. Control. 57(12): 3247-3252 (2012) - [j229]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) - [j228]Pui-Sze Chow, Tsan-Ming Choi, T. C. E. Cheng:
Impacts of Minimum Order Quantity on a Quick Response Supply Chain. IEEE Trans. Syst. Man Cybern. Part A 42(4): 868-879 (2012) - 2011
- [j227]T. C. Edwin Cheng, Wen-Hsiang Wu, Shuenn-Ren Cheng, Chin-Chia Wu:
Two-agent scheduling with position-based deteriorating jobs and learning effects. Appl. Math. Comput. 217(21): 8804-8824 (2011) - [j226]Danqin Yang, Tsan-Ming Choi, Tiaojun Xiao, T. C. E. Cheng:
Coordinating a two-supplier and one-retailer supply chain with forecast updating. Autom. 47(7): 1317-1329 (2011) - [j225]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. Comput. Ind. Eng. 60(4): 534-541 (2011) - [j224]T. C. Edwin Cheng, Chou-Jung Hsu, Dar-Li Yang:
Unrelated parallel-machine scheduling with deteriorating maintenance activities. Comput. Ind. Eng. 60(4): 602-605 (2011) - [j223]C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, Sze Sing Lam:
Flowshop scheduling of deteriorating jobs on dominating machines. Comput. Ind. Eng. 61(3): 647-654 (2011) - [j222]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. Comput. Ind. Eng. 61(3): 655-662 (2011) - [j221]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. Comput. Oper. Res. 38(12): 1760-1765 (2011) - [j220]Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng:
Best semi-online algorithms for unbounded parallel batch scheduling. Discret. Appl. Math. 159(8): 838-847 (2011) - [j219]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. Discret. Appl. Math. 159(13): 1367-1376 (2011) - [j218]Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210(3): 482-488 (2011) - [j217]L. Yang, C. T. Ng, T. C. Edwin Cheng:
Optimal production strategy under demand fluctuations: Technology versus capacity. Eur. J. Oper. Res. 214(2): 393-402 (2011) - [j216]Q. Q. Nong, T. C. E. Cheng, C. T. Ng:
Two-agent scheduling to minimize the total cost. Eur. J. Oper. Res. 215(1): 39-44 (2011) - [j215]Yunan Wu, T. C. E. Cheng:
An Erratum on the Multiproduct Network Equilibrium Model. Oper. Res. 59(5): 1309-1310 (2011) - [j214]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) - [j213]Jacek Blazewicz, T. C. Edwin Cheng, Maciej Machowiak, Ceyda Oguz:
Berth and quay crane allocation: a moldable task scheduling model. J. Oper. Res. Soc. 62(7): 1189-1197 (2011) - [j212]Huajun Tang, T. C. Edwin Cheng, C. T. Daniel Ng:
Multi-facility ordered median problems in directed networks. J. Syst. Sci. Complex. 24(1): 61-67 (2011) - [j211]Eugene Levner, Amir Elalouf, T. C. Edwin Cheng:
An Improved FPTAS for Mobile Agent Routing with Time Constraints. J. Univers. Comput. Sci. 17(13): 1854-1862 (2011) - [j210]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. Organ. Sci. 22(6): 1600-1612 (2011) - [j209]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. Sched. 14(4): 361-369 (2011) - [j208]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. Autom. Control. 56(5): 1176-1180 (2011) - [j207]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) - [j206]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) - [c9]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 - [c8]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
- [j205]T. C. Edwin Cheng, Wen-Chiung Lee, Chin-Chia Wu:
Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Comput. Ind. Eng. 58(2): 326-331 (2010) - [j204]L. L. Liu, C. T. Ng, T. C. Edwin Cheng:
On scheduling unbounded batch processing machine(s). Comput. Ind. Eng. 58(4): 814-817 (2010) - [j203]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. Comput. Ind. Eng. 59(2): 352-361 (2010) - [j202]Min Ji, T. C. Edwin Cheng:
Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan. Comput. Ind. Eng. 59(4): 794-798 (2010) - [j201]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. Comput. Oper. Res. 37(1): 83-90 (2010) - [j200]T. C. Edwin Cheng, Xiuli Wang:
Machine scheduling with job class setup and delivery considerations. Comput. Oper. Res. 37(6): 1123-1128 (2010) - [j199]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. Comput. Oper. Res. 37(8): 1510-1514 (2010) - [j198]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) - [j197]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. Eur. J. Oper. Res. 200(2): 621-624 (2010) - [j196]L. Yang, C. T. Ng, T. C. Edwin Cheng:
Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems. Eur. J. Oper. Res. 201(1): 112-122 (2010) - [j195]Min Ji, T. C. Edwin Cheng:
Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan. Eur. J. Oper. Res. 202(1): 90-98 (2010) - [j194]Guowei Hua, Shouyang Wang, T. C. Edwin Cheng:
Price and lead time decisions in dual-channel supply chains. Eur. J. Oper. Res. 205(1): 113-126 (2010) - [j193]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. Eur. J. Oper. Res. 207(2): 601-604 (2010) - [j192]Yingxue Zhao, Shouyang Wang, T. C. Edwin Cheng, Xiaoqi Yang, Zhimin Huang:
Coordination of supply chains by option contracts: A cooperative game theory approach. Eur. J. Oper. Res. 207(2): 668-675 (2010) - [j191]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. Int. J. E Bus. Res. 6(1): 32-51 (2010) - [j190]T. C. E. Cheng, M. W. Chung:
An Empirical Study of Predicting Hong Kong Consumers' Online Shopping Intentions: Personal Hygiene Products. Int. J. E Bus. Res. 6(3): 56-70 (2010) - [j189]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) - [j188]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) - [j187]T. C. E. Cheng, Shengjie Li, X. Q. Yang:
Vector equilibrium flows with nonconvex ordering relations. J. Glob. Optim. 46(4): 537-542 (2010) - [j186]G. Tang, F. Chen, T. C. Edwin Cheng, C. T. Daniel Ng, Zhi-Long Chen:
The loader problem: formulation, complexity and algorithms. J. Oper. Res. Soc. 61(5): 840-848 (2010) - [j185]L. L. Liu, C. T. Ng, T. C. Edwin Cheng:
On the complexity of bi-criteria scheduling on a single batch processing machine. J. Sched. 13(6): 629-638 (2010) - [j184]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. Autom. Control. 55(12): 2767-2777 (2010) - [j183]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) - [j182]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) - [c7]Yick-hin Hung, Leon Y. O. Li, T. C. E. Cheng:
n-newsvendor biform game of trading capacity futures. BQGT 2010: 32:1
2000 – 2009
- 2009
- [j181]C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng:
Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. Asia Pac. J. Oper. Res. 26(6): 715-734 (2009) - [j180]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) - [j179]Huajun Tang, T. C. E. Cheng, C. T. Ng:
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. Comput. Ind. Eng. 57(3): 707-712 (2009) - [j178]Vincent Cho, T. C. Edwin Cheng, Jennifer W. M. Lai:
The role of perceived user-interface design in continued usage intention of self-paced e-learning tools. Comput. Educ. 53(2): 216-227 (2009) - [j177]L. L. Liu, C. T. Ng, T. C. Edwin Cheng:
Bicriterion scheduling with equal processing times on a batch processing machine. Comput. Oper. Res. 36(1): 110-118 (2009) - [j176]T. C. Edwin Cheng, Alexander A. Lazarev, Evgeny R. Gafarov:
A hybrid algorithm for the single-machine total tardiness problem. Comput. Oper. Res. 36(2): 308-315 (2009) - [j175]Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang:
Bounded single-machine parallel-batch scheduling with release dates and rejection. Comput. Oper. Res. 36(10): 2748-2751 (2009) - [j174]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. Comput. Oper. Res. 36(11): 3031-3040 (2009) - [j173]Yaojun Chen, T. C. Edwin Cheng, Ran Xu:
The Ramsey number for a cycle of length six versus a clique of order eight. Discret. Appl. Math. 157(1): 8-12 (2009) - [j172]T. C. Edwin Cheng, Liying Kang, Erfang Shan:
A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discret. Appl. Math. 157(2): 262-271 (2009) - [j171]Erfang Shan, T. C. Edwin Cheng:
Upper bounds on the upper signed total domination number of graphs. Discret. Appl. Math. 157(5): 1098-1103 (2009) - [j170]C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov:
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. Discret. Appl. Math. 157(8): 1806-1824 (2009) - [j169]L. L. Liu, C. T. Ng, T. C. Edwin Cheng:
Scheduling jobs with release dates on parallel batch processing machines. Discret. Appl. Math. 157(8): 1825-1830 (2009) - [j168]T. C. Edwin Cheng, Yaojun Chen, C. T. Ng:
Codiameters of 3-domination critical graphs with toughness more than one. Discret. Math. 309(5): 1067-1078 (2009) - [j167]T. C. Edwin Cheng, Yonglin Guo, Shenggui Zhang, Yongjun Du:
Extreme values of the sum of squares of degrees of bipartite graphs. Discret. Math. 309(6): 1557-1564 (2009) - [j166]Yunqing Zhang, T. C. Edwin Cheng, Yaojun Chen:
The Ramsey numbers for Stars of odd Order versus a Wheel of Order nine. Discret. Math. Algorithms Appl. 1(3): 413-436 (2009) - [j165]T. C. Edwin Cheng, Bertrand M. T. Lin:
Johnson's rule, composite jobs and the relocation problem. Eur. J. Oper. Res. 192(3): 1008-1013 (2009) - [j164]Xiuli Wang, T. C. Edwin Cheng:
Production scheduling with supply and delivery considerations to minimize the makespan. Eur. J. Oper. Res. 194(3): 743-752 (2009) - [j163]Qiu-Hong Zhao, T. C. Edwin Cheng:
An analytical study of the modification ability of distribution centers. Eur. J. Oper. Res. 194(3): 901-910 (2009) - [j162]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) - [j161]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) - [j160]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) - [j159]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) - [j158]Min Ji, T. C. Edwin Cheng:
Parallel-machine scheduling of simple linear deteriorating jobs. Theor. Comput. Sci. 410(38-40): 3761-3768 (2009) - 2008
- [j157]T. C. E. Cheng, Chin-Chia Wu, Wen-Chiung Lee:
Some scheduling problems with deteriorating jobs and learning effects. Comput. Ind. Eng. 54(4): 972-982 (2008) - [j156]Ji-Bo Wang, C. T. Ng, T. C. Edwin Cheng:
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Comput. Oper. Res. 35(8): 2684-2693 (2008) - [j155]Erfang Shan, T. C. Edwin Cheng, Liying Kang:
An application of the Turán theorem to domination in graphs. Discret. Appl. Math. 156(14): 2712-2718 (2008) - [j154]T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, Sze Sing Lam:
Group sequencing around a common due date. Discret. Optim. 5(3): 594-604 (2008) - [j153]Yaojun Chen, T. C. Edwin Cheng, C. T. Ng:
Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. Discret. Math. 308(7): 1296-1307 (2008) - [j152]Erfang Shan, T. C. Edwin Cheng:
Remarks on the minus (signed) total domination in graphs. Discret. Math. 308(15): 3373-3380 (2008) - [j151]Bing Chen, Shenggui Zhang, T. C. Edwin Cheng:
Heavy cycles in k-connected weighted graphs with large weighted degree sums. Discret. Math. 308(20): 4531-4543 (2008) - [j150]Erfang Shan, Zuosong Liang, T. C. Edwin Cheng:
Clique-transversal Number in Cubic Graphs. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - [j149]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) - [j148]Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3): 985-1032 (2008) - [j147]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. Eur. J. Oper. Res. 187(3): 1090-1099 (2008) - [j146]Min Ji, T. C. Edwin Cheng:
Parallel-machine scheduling with simple linear deterioration to minimize total completion time. Eur. J. Oper. Res. 188(2): 342-347 (2008) - [j145]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188(2): 603-609 (2008) - [j144]M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Batch scheduling of deteriorating reworkables. Eur. J. Oper. Res. 189(3): 1317-1326 (2008) - [j143]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. Eur. J. Oper. Res. 191(2): 320-331 (2008) - [j142]Kee-hung Lai, Christina W. Y. Wong, T. C. Edwin Cheng:
A coordination-theoretic investigation of the impact of electronic integration on logistics performance. Inf. Manag. 45(1): 10-20 (2008) - [j141]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. Int. J. E Bus. Res. 4(4): 26-42 (2008) - [j140]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) - [j139]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) - [j138]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) - [j137]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) - [j136]M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov:
Batch scheduling of step deteriorating jobs. J. Sched. 11(1): 17-28 (2008) - 2007
- [j135]Guangjun Xu, Erfang Shan, Liying Kang, T. C. Edwin Cheng:
The algorithmic complexity of the minus clique-transversal problem. Appl. Math. Comput. 189(2): 1410-1418 (2007) - [j134]Ji-Bo Wang, T. C. Edwin Cheng:
Scheduling Problems with the Effects of deterioration and Learning. Asia Pac. J. Oper. Res. 24(2): 245-261 (2007) - [j133]Nitin Singh, Kee-hung Lai, T. C. Edwin Cheng:
Intra-organizational perspectives on IT-enabled supply chains. Commun. ACM 50(1): 59-65 (2007) - [j132]Xiuli Wang, T. C. Edwin Cheng:
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint. Comput. Oper. Res. 34(1): 152-162 (2007) - [j131]Min Ji, Yong He, T. C. Edwin Cheng:
Single-machine scheduling with periodic maintenance to minimize makespan. Comput. Oper. Res. 34(6): 1764-1770 (2007) - [j130]T. C. Edwin Cheng, Liying Kang, C. T. Ng:
An improved algorithm for the p-center problem on interval graphs with unit lengths. Comput. Oper. Res. 34(8): 2215-2222 (2007) - [j129]Min Ji, Yong He, T. C. Edwin Cheng:
A simple linear time algorithm for scheduling with step-improving processing times. Comput. Oper. Res. 34(8): 2396-2402 (2007) - [j128]Xiuli Wang, T. C. Edwin Cheng:
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint. Comput. Oper. Res. 34(10): 2894-2901 (2007) - [j127]T. C. Edwin Cheng, Liying Kang, C. T. Ng:
Paired domination on interval and circular-arc graphs. Discret. Appl. Math. 155(16): 2077-2086 (2007) - [j126]T. C. Edwin Cheng, Natalia V. Shakhlevich:
Two-machine open shop problem with controllable processing times. Discret. Optim. 4(2): 175-184 (2007) - [j125]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. Discret. Math. 307(9-10): 1047-1053 (2007) - [j124]Eric W. T. Ngai, T. C. Edwin Cheng, S. Au, Kee-hung Lai:
Mobile commerce integrated with RFID technology in a container depot. Decis. Support Syst. 43(1): 62-76 (2007) - [j123]Min Ji, Yong He, T. C. Edwin Cheng:
Batch delivery scheduling with batch delivery cost on a single machine. Eur. J. Oper. Res. 176(2): 745-755 (2007) - [j122]Jinjiang Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng:
Approximability of single machine scheduling with fixed jobs to minimize total completion time. Eur. J. Oper. Res. 178(1): 46-56 (2007) - [j121]Xiuli Wang, T. C. Edwin Cheng:
Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur. J. Oper. Res. 178(1): 57-70 (2007) - [j120]Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng:
Fixed interval scheduling: Models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178(2): 331-342 (2007) - [j119]Jinjiang Yuan, T. C. Edwin Cheng, C. T. Ng:
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time. Eur. J. Oper. Res. 178(2): 631-633 (2007) - [j118]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. Eur. J. Oper. Res. 180(2): 845-867 (2007) - [j117]F. Lin, T. C. E. Cheng:
The structural theory of general systems applied in management: the total relationship flow management theorems. Int. J. Gen. Syst. 36(6): 673-681 (2007) - [j116]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) - [j115]Erfang Shan, T. C. Edwin Cheng, Liying Kang:
Absorbant of generalized de Bruijn digraphs. Inf. Process. Lett. 105(1): 6-11 (2007) - [j114]T. C. E. Cheng, L. Y. Kang, C. T. Ng:
Due-date assignment and parallel-machine scheduling with deteriorating jobs. J. Oper. Res. Soc. 58(8): 1103-1108 (2007) - [j113]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
- [j112]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. Appl. Math. Comput. 180(1): 185-193 (2006) - [j111]Kee-hung Lai, Christina W. Y. Wong, T. C. Edwin Cheng:
Institutional isomorphism and the adoption of information technology for supply chain management. Comput. Ind. 57(1): 93-98 (2006) - [j110]Xiuli Wang, T. C. Edwin Cheng:
A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups. Comput. Oper. Res. 33: 1326-1344 (2006) - [j109]T. C. Edwin Cheng, Yaojun Chen, C. T. Ng:
A note on acyclic domination number in graphs of diameter two. Discret. Appl. Math. 154(6): 1019-1022 (2006) - [j108]T. C. Edwin Cheng, David Y. C. Lam, Andy C. L. Yeung:
Adoption of internet banking: An empirical study in Hong Kong. Decis. Support Syst. 42(3): 1558-1572 (2006) - [j107]T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Makespan minimization. Eur. J. Oper. Res. 175(2): 751-768 (2006) - [j106]T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Total completion time minimization. Eur. J. Oper. Res. 175(2): 769-781 (2006) - [j105]T. C. Edwin Cheng, Y. N. Wu:
A Multiproduct, Multicriterion Supply-Demand Network Equilibrium Model. Oper. Res. 54(3): 544-554 (2006) - [j104]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) - [j103]Bertrand M. T. Lin, T. C. Edwin Cheng:
Two-machine flowshop scheduling with conditional deteriorating second operations. Int. Trans. Oper. Res. 13(2): 91-98 (2006) - [j102]C. T. Ng, T. C. Edwin Cheng, Jinjiang 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) - [j101]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 Q. 32(1): 43-66 (2006) - [j100]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) - [j99]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. Sched. 9(4): 343-364 (2006) - [j98]Jinjiang 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. Sched. 9(6): 499-513 (2006) - [j97]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) - [j96]T. C. Edwin Cheng, C. T. Ng, Jinjiang 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
- [j95]Kok Lay Teo, T. C. Edwin Cheng, Xiaoqiang Cai, Xiaoqi Yang:
Preface. Ann. Oper. Res. 133(1-4): 17-20 (2005) - [j94]Bertrand M. T. Lin, T. C. Edwin Cheng:
Two-Machine Flowshop Batching and Scheduling. Ann. Oper. Res. 133(1-4): 149-161 (2005) - [j93]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. Ann. Oper. Res. 133(1-4): 163-174 (2005) - [j92]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) - [j91]T. C. Edwin Cheng, Jinjiang Yuan, A. F. Yang:
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Comput. Oper. Res. 32: 849-859 (2005) - [j90]Xiuli Wang, T. C. Edwin Cheng:
Two-machine flowshop scheduling with job class setups to minimize total flowtime. Comput. Oper. Res. 32: 2751-2770 (2005) - [j89]Xiuli Wang, T. C. Edwin Cheng:
Single machine scheduling with resource dependent release times and processing times. Eur. J. Oper. Res. 162(3): 727-739 (2005) - [j88]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu:
Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165(2): 423-443 (2005) - [j87]T. C. Edwin Cheng, Natalia V. Shakhlevich:
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem. Eur. J. Oper. Res. 165(2): 444-456 (2005) - [j86]Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng:
On the single machine total tardiness problem. Eur. J. Oper. Res. 165(3): 843-846 (2005) - [j85]H. K. Yau, Eric W. T. Ngai, T. C. Edwin Cheng:
Conceptual Framework and Architecture for Agent-Oriented Knowledge Management Supported E-Learning Systems. Int. J. Distance Educ. Technol. 3(2): 48-67 (2005) - [j84]F. K. T. Wat, Eric W. T. Ngai, T. C. Edwin Cheng:
Potential risks to e-commerce development using exploratory factor analysis. Int. J. Serv. Technol. Manag. 6(1): 55-71 (2005) - [j83]T. C. E. Cheng, L. Y. Kang, C. T. Ng:
Single machine due-date scheduling of jobs with decreasing start-time dependent processing times. Int. Trans. Oper. Res. 12(3): 355-366 (2005) - [j82]C. T. Ng, Xiaoqiang Cai, T. C. E. Cheng, Sze Sing Lam:
Minimizing Completion Time Variance with Compressible Processing Times. J. Glob. Optim. 31(2): 333-352 (2005) - [j81]T. C. E. Cheng, Y. N. Wu:
The impact of information sharing in a two-level supply chain with multiple retailers. J. Oper. Res. Soc. 56(10): 1159-1165 (2005) - [j80]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) - [j79]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
- [j78]Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich:
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Ann. Oper. Res. 129(1-4): 81-106 (2004) - [j77]T. C. Edwin Cheng, Qing Ding, Bertrand M. T. Lin:
A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152(1): 1-13 (2004) - [j76]C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single machine batch scheduling with jointly compressible setup and processing times. Eur. J. Oper. Res. 153(1): 211-219 (2004) - [j75]Jinjiang 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. Eur. J. Oper. Res. 158(2): 525-528 (2004) - [j74]T. C. E. Cheng, Liying Kang, C. T. Ng:
Due-date assignment and single machine scheduling with deteriorating jobs. J. Oper. Res. Soc. 55(2): 198-203 (2004) - [j73]Zhaohui Liu, T. C. Edwin Cheng:
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. J. Sched. 7(4): 313-327 (2004) - [j72]Jinjiang 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) - [j71]Liying Kang, Moo Young Sohn, T. C. Edwin Cheng:
Paired-domination in inflated graphs. Theor. Comput. Sci. 320(2-3): 485-494 (2004) - [j70]Andy C. L. Yeung, T. C. E. Cheng, Ling-Yau Chan:
From customer orientation to customer satisfaction: the gap between theory and practice. IEEE Trans. Engineering Management 51(1): 85-97 (2004) - 2003
- [j69]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Scheduling a Single Server in a Two-machine Flow Shop. Computing 70(2): 167-180 (2003) - [j68]T. C. Edwin Cheng, Qing Ding:
Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine. Comput. Oper. Res. 30(1): 51-62 (2003) - [j67]C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, Sze Sing Lam:
Single machine scheduling with a variable common due date and resource-dependent processing times. Comput. Oper. Res. 30(8): 1173-1185 (2003) - [j66]Hong Yan, Zhenxin Yu, T. C. Edwin Cheng:
A strategic model for supply chain design with logical constraints: formulation and solution. Comput. Oper. Res. 30(14): 2135-2155 (2003) - [j65]T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov:
Lower Bounds and Semi On-line Multiprocessor Scheduling. Comput. Sci. J. Moldova 11(2): 209-228 (2003) - [j64]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. Eur. J. Oper. Res. 149(2): 390-403 (2003) - [j63]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) - [j62]T. C. Edwin Cheng, Natalia V. Shakhlevich:
Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates. J. Glob. Optim. 27(2-3): 293-311 (2003) - [j61]C. T. Daniel Ng, T. C. E. Cheng, Mikhail Y. Kovalyov:
Batch scheduling with controllable setup and processing times to minimize total completion time. J. Oper. Res. Soc. 54(5): 499-506 (2003) - [j60]Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng:
On scheduling an unbounded batch machine. Oper. Res. Lett. 31(1): 42-48 (2003) - [j59]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) - [j58]C. T. Ng, T. C. Edwin Cheng, Jinjiang 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) - [j57]C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. J. Sched. 6(4): 405-412 (2003) - [j56]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. J. Sched. 6(5): 483-490 (2003) - [j55]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. J. Sched. 6(6): 551-555 (2003) - 2002
- [j54]T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich:
Common due date assignment and scheduling with ready times. Comput. Oper. Res. 29(14): 1957-1967 (2002) - [j53]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. Comput. Oper. Res. 29(14): 2087-2091 (2002) - [j52]Eric W. T. Ngai, T. C. Edwin Cheng:
Applications of information support technologies for small and medium enterprises: a research agenda. Int. J. Inf. Technol. Manag. 1(2/3): 211-224 (2002) - [j51]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) - [j50]Zhaohui Liu, T. C. Edwin Cheng:
Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett. 82(2): 107-111 (2002) - [j49]C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. Inf. Process. Lett. 82(4): 187-191 (2002) - [j48]Zhenxin Yu, Hong Yan, T. C. Edwin Cheng:
Modelling the benefits of information sharing-based partnerships in a two-level supply chain. J. Oper. Res. Soc. 53(4): 436-446 (2002) - [j47]Aleksander Bachman, T. C. Edwin Cheng, Adam Janiak, C. T. Daniel Ng:
Scheduling start time dependent jobs to minimize the total weighted completion time. J. Oper. Res. Soc. 53(6): 688-693 (2002) - [j46]C. T. Ng, T. C. Edwin Cheng, Jinjiang 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
- [j45]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single Supplier Scheduling for Multiple Deliveries. Ann. Oper. Res. 107(1-4): 51-63 (2001) - [j44]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. Ann. Oper. Res. 108(1-4): 33-54 (2001) - [j43]Wing-Kwan Yeung, Ceyda Oguz, T. C. Edwin Cheng:
Single-machine scheduling with a common due window. Comput. Oper. Res. 28(2): 157-175 (2001) - [j42]Bertrand M. T. Lin, T. C. Edwin Cheng:
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan. Comput. Oper. Res. 28(7): 613-624 (2001) - [j41]T. C. E. Cheng, Q. Ding:
Single machine scheduling with step-deteriorating processing times. Eur. J. Oper. Res. 134(3): 623-630 (2001) - [j40]T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Single machine batch scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 135(1): 177-183 (2001) - [j39]Zhenxin Yu, Hong Yan, T. C. Edwin Cheng:
Benefits of information sharing with supply chain partnerships. Ind. Manag. Data Syst. 101(3): 114-121 (2001) - [j38]Guoqing Wang, T. C. Edwin Cheng:
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint. Inf. Process. Lett. 80(6): 305-309 (2001) - [j37]Guoqing Wang, T. C. Edwin Cheng:
An approximation algorithm for parallel machine scheduling with a common server. J. Oper. Res. Soc. 52(2): 234-237 (2001) - 2000
- [j36]T. C. Edwin Cheng, Qing Ding:
Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times. Acta Informatica 36(9/10): 673-692 (2000) - [j35]T. C. Edwin Cheng, Adam Janiak:
A permutation flow-shop scheduling problem with convex models of operation processing times. Ann. Oper. Res. 96(1-4): 39-60 (2000) - [j34]T. C. Edwin Cheng, Guoqing Wang:
Single Machine Scheduling with Learning Effect Considerations. Ann. Oper. Res. 98(1-4): 273-290 (2000) - [j33]Hong Yan, T. C. Edwin Cheng:
A Reply to Balkhi. J. Oper. Res. Soc. 51(8): 1001-1002 (2000) - [j32]Hong Yan, T. C. Edwin Cheng:
Response to Balkhi's response. J. Oper. Res. Soc. 51(8): 1003 (2000) - [j31]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)
1990 – 1999
- 1999
- [j30]Dirk Biskup, T. C. Edwin Cheng:
Multiple-machine scheduling with earliness, tardiness and completion time penalties. Comput. Oper. Res. 26(1): 45-57 (1999) - [j29]T. C. Edwin Cheng, Guoqing Wang, Chelliah Sriskandarajah:
One-operator-two-machine flowshop scheduling with setup and dismounting times. Comput. Oper. Res. 26(7): 715-730 (1999) - [j28]T. C. Edwin Cheng, Qing Ding:
The time dependent machine makespan problem is strongly NP-complete. Comput. Oper. Res. 26(8): 749-754 (1999) - [j27]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. Eur. J. Oper. Res. 114(2): 403-410 (1999) - [j26]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. Eur. J. Oper. Res. 116(1): 183-193 (1999) - [j25]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) - [j24]T. C. Edwin Cheng, Guoqing Wang:
Two-Machine Flowshop Scheduling with Consecutive Availability Constraints. Inf. Process. Lett. 71(2): 49-54 (1999) - [j23]T. C. Edwin Cheng, Guoqing Wang:
A note on scheduling the two-machine flexible flowshop. IEEE Trans. Robotics Autom. 15(1): 187-190 (1999) - [j22]Eric W. T. Ngai, T. C. Edwin Cheng:
MSS4TQM-a management support system for total quality management. IEEE Trans. Syst. Man Cybern. Part C 29(3): 371-386 (1999) - 1998
- [j21]Xiaoqiang Cai, T. C. Edwin Cheng:
Multi-machine Scheduling with Variance Minimization. Discret. Appl. Math. 84(1-3): 55-70 (1998) - [j20]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) - [j19]T. C. Edwin Cheng, Guoqing Wang:
A note on scheduling alternative operations in two-machine flowshops. J. Oper. Res. Soc. 49(6): 670-673 (1998) - [j18]Hong Yan, T. C. Edwin Cheng:
Optimal production stopping and restarting times for an EOQ model with deteriorating items. J. Oper. Res. Soc. 49(12): 1288-1295 (1998) - [j17]T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. SIAM J. Optim. 8(2): 617-630 (1998) - 1997
- [j16]Ceyda Oguz, Bertrand M. T. Lin, T. C. Edwin Cheng:
Two-stage flowshop scheduling with a common second-stage machine. Comput. Oper. Res. 24(12): 1169-1174 (1997) - [j15]T. C. Edwin Cheng, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties. SIAM J. Optim. 7(2): 547-559 (1997) - 1996
- [j14]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Batch Scheduling and Common Due-date Assignment on a Single Machine. Discret. Appl. Math. 70(3): 231-245 (1996) - [j13]T. C. E. Cheng, Zhi-Long Chen, Chung-Lun Li:
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation. Oper. Res. Lett. 19(5): 237-242 (1996) - 1995
- [j12]Chung-Lun Li, T. C. Edwin Cheng, Zhi-Long Chen:
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs. Comput. Oper. Res. 22(2): 205-219 (1995) - [j11]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single machine batch scheduling with deadlines and resource dependent processing times. Oper. Res. Lett. 17(5): 243-249 (1995) - 1994
- [j10]T. C. Edwin Cheng, Zhi-Long Chen, Ceyda Oguz:
One-machine batching and sequencing of multiple-type items. Comput. Oper. Res. 21(7): 717-721 (1994) - [j9]T. C. E. Cheng, Z.-L. Chen:
Parallel Machine Scheduling with Batch Setup Times. Oper. Res. 42(6): 1171-1174 (1994) - [j8]Tai Chiu Edwin Cheng, Adam Janiak:
Resource optimal control in some single-machine scheduling problems. IEEE Trans. Autom. Control. 39(6): 1243-1246 (1994) - 1993
- [j7]Helmut G. Kahlbacher, T. C. Edwin Cheng:
Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs. Discret. Appl. Math. 47(2): 139-164 (1993) - [j6]Chung-Lun Li, Zhi-Long Chen, T. C. Edwin Cheng:
A note on one-processor scheduling with asymmetric earliness and tardiness penalties. Oper. Res. Lett. 13(1): 45-48 (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. Comput. Oper. Res. 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. Comput. Oper. Res. 17(4): 425-426 (1990)
1980 – 1989
- 1988
- [j3]T. C. Edwin Cheng:
Optimal common due-date with limited completion time deviation. Comput. Oper. Res. 15(2): 91-96 (1988) - 1987
- [j2]T. C. Edwin Cheng:
An algorithm for the con due-date determination and sequencing problem. Comput. Oper. Res. 14(6): 537-542 (1987) - 1986
- [j1]T. C. Edwin Cheng:
EOQ with limited backorder delays. Comput. Oper. Res. 13(4): 477-480 (1986)
Coauthor Index
[j495] [j493] [j482] [j450] [j447] [j445] [j442] [j441] [j417] [j416] [j412] [j411] [j410] [j402] [j392] [j388] [j376] [c14] [j360] [j346] [c11] [j309] [j285] [j283] [j269] [j268] [j266] [j248] [j245] [j242] [j236] [j235] [j230] [j223] [j220] [j219] [j218] [j217] [j216] [j212] [j209] [j207] [j204] [j201] [j197] [j196] [j193] [j189] [j186] [j185] [j183] [j182] [j181] [j180] [j179] [j177] [j170] [j169] [j168] [j162] [j160] [j159] [j156] [j154] [j153] [j148] [j147] [j145] [j143] [j138] [j137] [j136] [j130] [j127] [j125] [j122] [j120] [j119] [j114] [j113] [j112] [j109] [j104] [j102] [j99] [j98] [j96] [j93] [j92] [j88] [j86] [j83] [j82] [c2] [j76] [j74] [j72] [j67] [j61] [j58] [j57] [j56] [j55] [j51] [j49] [j47] [j46]
Shou-Yang Wang
aka: Shouyang Wang
aka: Shouyang Wang
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-16 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
