Hailun Zhang

Hailun Zhang

Auto-generated profile, based on publicly available information

Hailun Zhang

School of Data Science, The Chinese University of Hong Kong, Shenzhen, Guangdong, P.R. China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2024 in Operations Research
Verified
Journal Article
Closed access
GWGuangju Wang
Guangju Wang
HZHailun Zhang
Hailun Zhang
JZJiheng Zhang
Jiheng Zhang
Balancing the Abandonment and Cancellation of a Ride-Matching Market. In “On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation,” Wang, Zhang, and Zhang propose a spatial model to approximate pickup times based on the number of waiting passengers and idle drivers. They analyze the dynamics of passengers and drivers in a queueing model in which the platform can control the matching process by setting a threshold on the expected pickup time. Applying fluid approximations, we obtain accurate performance evaluations and an elegant optimality condition based on which they propose a policy that adapts to time-varying demand.

1 July 2020 in Operations Research
Verified
Journal Article
Closed access
ZLZhenghua Long
Zhenghua Long
NSNahum Shimkin
Nahum Shimkin
HZHailun Zhang
Hailun Zhang
JZJiheng Zhang
Jiheng Zhang
In “Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule,” Long, Shimkin, Zhang, and Zhang propose three scheduling policies to cope with any general cost functions and general patience-time distributions. Their first contribution is to introduce the target-allocation policy, which assigns higher priority to customer classes with larger deviation from the desired allocation of the service capacity and prove its optimality for any general queue-length cost functions and patience-time distributions. The Gcμ/h rule, which extends the well-known Gcμ rule by taking abandonment into account, is shown to be optimal for the case of convex queue-length costs and nonincreasing hazard rates of patience. For the case of concave queue-length costs but nondecreasing hazard rates of patience, it is optimal to apply a fixed-priority policy, and a knapsack-like problem is developed to determine the optimal priority order efficiently.

1 October 2020 in Management Science
Verified
Journal Article
Closed access
ZXZhen Xu
Zhen Xu
HZHailun Zhang
Hailun Zhang
JZJiheng Zhang
Jiheng Zhang
RZRachel Q. Zhang
Rachel Q. Zhang
We study online demand fulfillment in a class of networks with limited flexibility and arbitrary numbers of resources and request types. We show analytically that such a network is both necessary and sufficient to guarantee a performance gap independent of the market size compared with networks with full flexibility, extending the previous literature from the long chains to more general sparse networks. Inspired by the performance bound, we develop simple inventory allocation rules and guidelines for designing such network structures. Numerical experiments including one using some real data from Amazon China are conducted to confirm our findings as well as some of the flexibility principles conjectured in the literature. This paper was accepted by Chung Piaw Teo, optimization.

10 August 2023 in International Journal of Production Research
Verified
Journal Article
Closed access
BNBaozhuang Niu
Baozhuang Niu
NZNan Zhang
Nan Zhang
FXFengfeng Xie
Fengfeng Xie
HZHailun Zhang
Hailun Zhang

1 November 2024 in Operations Research
Verified
Journal Article
Closed access
ZLZhenghua Long
Zhenghua Long
HZHailun Zhang
Hailun Zhang
JZJiheng Zhang
Jiheng Zhang
ZZZhe George Zhang
Zhe George Zhang
Dynamic Routing of Queues with Heterogeneous Server Pools In “The Generalized c/μ Rule for Queues with Heterogeneous Server Pools,” Long, Zhang, Zhang, and Zhang study the optimal control of queueing systems with heterogeneous server pools and a single customer class. The goal is to balance the holding cost of the queue with the operating costs of the server pools. They introduce the target-allocation policy, the Gc/μ rule, and the fixed priority policy for systems with general, convex, and concave cost functions, respectively. They also consider an extension to minimize operating costs and maintain a service-level target for customers waiting in the queue. Moreover, they show that their asymptotically optimal routing policies coincide with several classic policies in the literature in special cases.

4 July 2019 in SSRN Electronic Journal
Verified
Preprint
Open access
PDF file
GWGuangju Wang
Guangju Wang
HZHailun Zhang
Hailun Zhang
JZJiheng Zhang
Jiheng Zhang
Ride-hailing platforms such as Uber, Lyft, and DiDi coordinate supply and demand by matching passengers and drivers. The platform has to promptly dispatch drivers when receiving requests, since otherwise passengers may lose patience and abandon the service by switching to alternative transportation methods. However, having less idle drivers results in a possible lengthy pick-up time, which is a waste of system capacity and may cause passengers to cancel the service after they are matched. Due to complex spatial and queueing dynamics, the analysis of the matching decision is challenging. In this paper, we propose a spatial model to approximate the pick-up time based on the number of waiting passengers and idle drivers. We analyze the dynamics of passengers and drivers in a queueing model where the platform can control the matching process by setting a threshold on the expected pick-up time. Applying fluid approximations, we obtain accurate performance evaluations and an elegant optimality condition, based on which we propose a policy that adapts to time-varying demand.