Building Trust in Online E-markets through Dual Deposit under Feedback Aggregated Mechanism. - E. Zhang 001; Feifeng Zheng; Yingluo Wang (PACIS, 2004)

On-line production order scheduling with preemption penalties. - Feifeng Zheng; Yinfeng Xu; E. Zhang 001 (J. Comb. Optim., 2007)

An Optimal Strategy for Online Non-uniform Length Order Scheduling. - Feifeng Zheng; E. Zhang 001; Yinfeng Xu; Xiaoping Wu (AAIM, 2008)

How much can lookahead help in online single machine scheduling. - Feifeng Zheng; Yinfeng Xu; E. Zhang 001 (Inf. Process. Lett., 2008)

Online Splitting Interval Scheduling on m Identical Machines. - Feifeng Zheng; Bo Liu; Yinfeng Xu; E. Zhang 001 (AAIM, 2010)

Pricing and Bidding Strategy in AdWords Auction under Heterogeneous Products Scenario. - E. Zhang 001; Yiqin Zhuo (ICSI (2), 2010)

Online deadline scheduling with preemption penalties. - Feifeng Zheng; Yinfeng Xu; Chung Keung Poon; E. Zhang 001; Xiaoping Wu (Comput. Ind. Eng., 2011)

NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation. - Feifeng Zheng; Li Luo 001; E. Zhang 001 (COCOA, 2013)

Competitive analysis for make-to-order scheduling with reliable lead time quotation. - Feifeng Zheng; E. Zhang 001; Yinfeng Xu; Wei-Chiang Hong (J. Comb. Optim., 2014)

Online scheduling with immediate and reliable lead-time quotation. - Feifeng Zheng; Yinfeng Xu; Weimin Ma; E. Zhang 001 (J. Sched., 2014)

NF-based algorithms for online bin packing with buffer and bounded item size. - Feifeng Zheng; Li Luo 001; E. Zhang 001 (J. Comb. Optim., 2015)

Online (J, K)-search problem and its competitive analysis. - Wenming Zhang; E. Zhang 001; Feifeng Zheng (Theor. Comput. Sci., 2015)

Online Two Stage k-Search Problem and Its Competitive Analysis. - Wenming Zhang; E. Zhang 001; Feifeng Zheng (Int. J. Found. Comput. Sci., 2016)

Stowage Planning in Multiple Ports with Shifting Fee Minimization. - E. Zhang 001; Qihuang Mei; Ming Liu 008; Feifeng Zheng (Sci. Program., 2018)

Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem. - Ming Liu 008; Xin Liu 025; E. Zhang 001; Feng Chu 001; Chengbin Chu (Int. J. Prod. Res., 2019)

Single machine lot scheduling to minimize the total weighted (discounted) completion time. - E. Zhang 001; Ming Liu 008; Feifeng Zheng; Yinfeng Xu (Inf. Process. Lett., 2019)

Analysis of Countries' Scientific Capability in Dual Scientific Roles. - Chaoran Li; E. Zhang 001; Jusheng Liu (IEEE Access, 2020)

Two parallel identical machines scheduling to minimise the maximum inter-completion time. - Feifeng Zheng; Yang Sui; E. Zhang 001; Yinfeng Xu; Ming Liu 008 (Int. J. Prod. Res., 2020)

Adoption of online follow-up service by patients: An empirical study based on the elaboration likelihood model. - Chaoran Li; E. Zhang 001; Jingti Han (Comput. Hum. Behav., 2021)

Service-oriented robust worker scheduling with motivation effects. - Ming Liu 008; Xin Liu 025; Feng Chu 001; E. Zhang 001; Chengbin Chu (Int. J. Prod. Res., 2021)

K-adaptability in robust container vessel sequencing problem with week-dependent demands of a service route. - Feifeng Zheng; Zhaojie Wang; E. Zhang 001; Ming Liu 008 (Int. J. Prod. Res., 2022)

Eco-friendly container transshipment route scheduling problem with repacking operations. - Ming Liu 008; Rongfan Liu; E. Zhang 001; Chengbin Chu (J. Comb. Optim., 2022)

Approximation approach for robust vessel fleet deployment problem with ambiguous demands. - E. Zhang 001; Feng Chu 001; Shijin Wang 002; Ming Liu 008; Yang Sui (J. Comb. Optim., 2022)

Distributionally Robust Joint Chance Constrained Vessel Fleet Deployment Problem. - Feifeng Zheng; Zhaojie Wang; E. Zhang 001; Ming Liu 008 (Asia Pac. J. Oper. Res., 2022)