E. Zhang

24 papers C 3Journal 19Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Approximation approach for robust vessel fleet deployment problem with ambiguous demands.
J. Comb. Optim.
E. Zhang, Feng Chu, Shijin Wang, Ming Liu, Yang Sui
2022 J jnl
Distributionally Robust Joint Chance Constrained Vessel Fleet Deployment Problem.
Asia Pac. J. Oper. Res.
Feifeng Zheng, Zhaojie Wang, E. Zhang, Ming Liu
2022 J jnl
Eco-friendly container transshipment route scheduling problem with repacking operations.
J. Comb. Optim.
Ming Liu, Rongfan Liu, E. Zhang, Chengbin Chu
2022 J jnl
K-adaptability in robust container vessel sequencing problem with week-dependent demands of a service route.
Int. J. Prod. Res.
Feifeng Zheng, Zhaojie Wang, E. Zhang, Ming Liu
2021 J jnl
Adoption of online follow-up service by patients: An empirical study based on the elaboration likelihood model.
Comput. Hum. Behav.
Chaoran Li, E. Zhang, Jingti Han
2021 J jnl
Service-oriented robust worker scheduling with motivation effects.
Int. J. Prod. Res.
Ming Liu, Xin Liu, Feng Chu, E. Zhang, Chengbin Chu
2020 J jnl
Analysis of Countries' Scientific Capability in Dual Scientific Roles.
IEEE Access
Chaoran Li, E. Zhang, Jusheng Liu
2020 J jnl
Two parallel identical machines scheduling to minimise the maximum inter-completion time.
Int. J. Prod. Res.
Feifeng Zheng, Yang Sui, E. Zhang, Yinfeng Xu, Ming Liu
2019 J jnl
Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem.
Int. J. Prod. Res.
Ming Liu, Xin Liu, E. Zhang, Feng Chu, Chengbin Chu
2019 J jnl
Single machine lot scheduling to minimize the total weighted (discounted) completion time.
Inf. Process. Lett.
E. Zhang, Ming Liu, Feifeng Zheng, Yinfeng Xu
2018 J jnl
Stowage Planning in Multiple Ports with Shifting Fee Minimization.
Sci. Program.
E. Zhang, Qihuang Mei, Ming Liu, Feifeng Zheng
2016 J jnl
Online Two Stage
Int. J. Found. Comput. Sci.
Wenming Zhang, E. Zhang, Feifeng Zheng
2015 J jnl
NF-based algorithms for online bin packing with buffer and bounded item size.
J. Comb. Optim.
Feifeng Zheng, Li Luo, E. Zhang
2015 J jnl
Online (J, K)-search problem and its competitive analysis.
Theor. Comput. Sci.
Wenming Zhang, E. Zhang, Feifeng Zheng
2014 J jnl
Competitive analysis for make-to-order scheduling with reliable lead time quotation.
J. Comb. Optim.
Feifeng Zheng, E. Zhang, Yinfeng Xu, Wei-Chiang Hong
2014 J jnl
Online scheduling with immediate and reliable lead-time quotation.
J. Sched.
Feifeng Zheng, Yinfeng Xu, Weimin Ma, E. Zhang
2013 C conf
NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation.
COCOA
Feifeng Zheng, Li Luo, E. Zhang
2011 J jnl
Online deadline scheduling with preemption penalties.
Comput. Ind. Eng.
Feifeng Zheng, Yinfeng Xu, Chung Keung Poon, E. Zhang, Xiaoping Wu
2010 C conf
Online Splitting Interval Scheduling on
AAIM
Feifeng Zheng, Bo Liu, Yinfeng Xu, E. Zhang
2010 — conf
Pricing and Bidding Strategy in AdWords Auction under Heterogeneous Products Scenario.
ICSI (2)
E. Zhang, Yiqin Zhuo
2008 C conf
An Optimal Strategy for Online Non-uniform Length Order Scheduling.
AAIM
Feifeng Zheng, E. Zhang, Yinfeng Xu, Xiaoping Wu
2008 J jnl
How much can lookahead help in online single machine scheduling.
Inf. Process. Lett.
Feifeng Zheng, Yinfeng Xu, E. Zhang
2007 J jnl
On-line production order scheduling with preemption penalties.
J. Comb. Optim.
Feifeng Zheng, Yinfeng Xu, E. Zhang
2004 — conf
Building Trust in Online E-markets through Dual Deposit under Feedback Aggregated Mechanism.
PACIS
E. Zhang, Feifeng Zheng, Yingluo Wang