E. Zhang

Orcid: 0000-0003-2292-8128

Affiliations:
  • Shanghai University of Finance and Economics, School of Information Management and Engineering, China
  • Xi'an Jiaotong University, China (PhD 2005)


According to our database1, E. Zhang authored at least 24 papers between 2004 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Distributionally Robust Joint Chance Constrained Vessel Fleet Deployment Problem.
Asia Pac. J. Oper. Res., December, 2022

Approximation approach for robust vessel fleet deployment problem with ambiguous demands.
J. Comb. Optim., 2022

Eco-friendly container transshipment route scheduling problem with repacking operations.
J. Comb. Optim., 2022

K-adaptability in robust container vessel sequencing problem with week-dependent demands of a service route.
Int. J. Prod. Res., 2022

2021
Service-oriented robust worker scheduling with motivation effects.
Int. J. Prod. Res., 2021

Adoption of online follow-up service by patients: An empirical study based on the elaboration likelihood model.
Comput. Hum. Behav., 2021

2020
Two parallel identical machines scheduling to minimise the maximum inter-completion time.
Int. J. Prod. Res., 2020

Analysis of Countries' Scientific Capability in Dual Scientific Roles.
IEEE Access, 2020

2019
Single machine lot scheduling to minimize the total weighted (discounted) completion time.
Inf. Process. Lett., 2019

Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem.
Int. J. Prod. Res., 2019

2018
Stowage Planning in Multiple Ports with Shifting Fee Minimization.
Sci. Program., 2018

2016
Online Two Stage <i>k</i>-Search Problem and Its Competitive Analysis.
Int. J. Found. Comput. Sci., 2016

2015
Online (J, K)-search problem and its competitive analysis.
Theor. Comput. Sci., 2015

NF-based algorithms for online bin packing with buffer and bounded item size.
J. Comb. Optim., 2015

2014
Online scheduling with immediate and reliable lead-time quotation.
J. Sched., 2014

Competitive analysis for make-to-order scheduling with reliable lead time quotation.
J. Comb. Optim., 2014

2013
NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation.
Proceedings of the Combinatorial Optimization and Applications, 2013

2011
Online deadline scheduling with preemption penalties.
Comput. Ind. Eng., 2011

2010
Pricing and Bidding Strategy in AdWords Auction under Heterogeneous Products Scenario.
Proceedings of the Advances in Swarm Intelligence, First International Conference, 2010

Online Splitting Interval Scheduling on <i>m</i> Identical Machines.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2008
How much can lookahead help in online single machine scheduling.
Inf. Process. Lett., 2008

An Optimal Strategy for Online Non-uniform Length Order Scheduling.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
On-line production order scheduling with preemption penalties.
J. Comb. Optim., 2007

2004
Building Trust in Online E-markets through Dual Deposit under Feedback Aggregated Mechanism.
Proceedings of the Pacific Asia Conference on Information Systems, 2004


  Loading...