Minglong Zhou

Minglong Zhou

Auto-generated profile, based on publicly available information

Minglong Zhou

Department of Management Science, School of Management, Fudan University, Shanghai 200433, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
1 January 2023 in Operations Research
Verified
Journal Article
Closed access
DLDaniel Zhuoyu Long
Daniel Zhuoyu Long
MSMelvyn Sim
Melvyn Sim
MZMinglong Zhou
Minglong Zhou
We present a general framework for robust satisficing that favors solutions for which a risk-aware objective function would best attain an acceptable target even when the actual probability distribution deviates from the empirical distribution. The satisficing decision maker specifies an acceptable target, or loss of optimality compared with the empirical optimization model, as a trade-off for the model’s ability to withstand greater uncertainty. We axiomatize the decision criterion associated with robust satisficing, termed as the fragility measure, and present its representation theorem. Focusing on Wasserstein distance measure, we present tractable robust satisficing models for risk-based linear optimization, combinatorial optimization, and linear optimization problems with recourse. Serendipitously, the insights to the approximation of the linear optimization problems with recourse also provide a recipe for approximating solutions for hard stochastic optimization problems without relatively complete recourse. We perform numerical studies on a portfolio optimization problem and a network lot-sizing problem. We show that the solutions to the robust satisficing models are more effective in improving the out-of-sample performance evaluated on a variety of metrics, hence alleviating the optimizer’s curse. Funding: D. Z. Long is supported by the Hong Kong Research Grants Council [Grant 14207819]. M. Sim and M. Zhou are supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 [Grant MOE-2019-T3-1-010]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/opre.2021.2238 .

1 June 2023 in Production and Operations Management
Verified
Journal Article
Closed access
YWYu Wang
Yu Wang
YZYu Zhang
Yu Zhang
MZMinglong Zhou
Minglong Zhou
JTJiafu Tang
Jiafu Tang

1 September 2025 in Operations Research
Verified
Journal Article
Closed access
MSMelvyn Sim
Melvyn Sim
QTQinshen Tang
Qinshen Tang
MZMinglong Zhou
Minglong Zhou
TZTaozeng Zhu
Taozeng Zhu
In the paper, “The Analytics of Robust Satisficing: Predict, Optimize, Satisfice, Then Fortify,” published in Operations Research, authors Sim, Tang, Zhou, and Zhu introduce a novel approach to decision making under uncertainty. Their method, termed “estimation-fortified robust satisficing,” leverages advanced predictive and prescriptive analytics to optimize decisions where traditional models falter due to risk ambiguity and estimation uncertainties. This approach not only enhances the resilience of decisions against unforeseen variations but also consistently outperforms conventional predictive methods in scenarios characterized by sparse data. This significant advancement promises to fortify decision-making processes in critical sectors such as finance and operations management, offering a new paradigm in handling the inherent uncertainties of real-world systems.

1 January 2022 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
MZMinglong Zhou
Minglong Zhou
GLGar Goei Loke
Gar Goei Loke
CBChaithanya Bandi
Chaithanya Bandi
ZLZi Qiang Glen Liau
Zi Qiang Glen Liau
WWWilson Wang
Wilson Wang
Problem definition: We consider the intraday scheduling problem in a group of orthopaedic clinics where the planner schedules appointment times, given a sequence of appointments. We consider patient re-entry—where patients may be required to go for an x-ray examination, returning to the same doctor they have seen—and variability in patient behaviours such as walk-ins, earliness, and no-shows, which leads to inefficiency such as long patient waiting time and physician overtime. Academic/practical relevance: In our data set, 25% of the patients are required to go for x-ray examination. We also found significant variability in patient behaviours. Hence, patient re-entry and variability in behaviours are common, but we found little in the literature that could handle them. Methodology: We formulate the problem as a two-stage optimization problem, where scheduling decisions are made in the first stage. Queue dynamics in the second stage are modeled under a P-Queue paradigm, which minimizes a risk index representing the chance of violating performance targets, such as patient waiting times. The model reduces to a sequence of mixed-integer linear-optimization problems. Results: Our model achieves significant reductions, in comparative studies against a sample average approximation (SAA) model, on patient waiting times, while keeping server overtime constant. Our simulations further characterize the types of uncertainties under which SAA performs poorly. Managerial insights: We present an optimization model that is easy to implement in practice and tractable to compute. Our simulations indicate that not accounting for patient re-entry or variability in patient behaviours will lead to suboptimal policies, especially when they have specific structure that should be considered.

1 November 2022 in Production and Operations Management
Verified
Journal Article
Closed access
MZMinglong Zhou
Minglong Zhou
MSMelvyn Sim
Melvyn Sim
SLShao‐Wei Lam
Shao‐Wei Lam

1 July 2025 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
ZWZhiyuan Wang
Zhiyuan Wang
LRLun Ran
Lun Ran
MZMinglong Zhou
Minglong Zhou
LHLong He
Long He
Problem definition: Distributionally robust optimization (DRO) is ubiquitous to address uncertainties inherent in operations management (OM) problems. Recently, an alternative goal-driven framework, robust satisficing (RS), is proposed. RS aims to attain a prescribed target, such as avoiding overshooting the cost budget, as much as possible under uncertainty. The goal-driven modeling philosophy fits many OM problems, yet there is a lack of direct comparisons between DRO and RS. In this paper, we uncover connections between DRO and RS. Methodology/results: Suppose both models are based on the Wasserstein metric and consider a risk-aware convex objective function affected by uncertain parameters. We demonstrate that they share the same solution family. We establish the correspondence between the radius parameter in DRO and the target parameter in RS such that the optimal solutions to the two models coincide. Inspired by the globalized distributionally robust counterpart (GDRC), we extend the analysis to GDRC and the globalized robust satisficing (GRS). We reveal that GDRC and GRS have the same solution families as DRO and RS, respectively. More importantly, we establish novel results on the equivalence of DRO, GDRC, RS, and GRS models under previously stated conditions. Managerial implications: The equivalence results help unify performance bounds of DRO and RS models. Specifically, each model now has an additional set of theoretical guarantees from the other model, and any bounds derived for one model automatically apply to other equivalent models via some parameter mapping. Despite the theoretical equivalence result, the performance of the DRO and RS models can vary depending on how the model parameters are selected. The experimental findings show how these differences emerge when transitioning from theory to practice. Additionally, the experiments provide insights for practitioners, such as how the use of cross-validation can help reflect the true model preferences, particularly when only a few validation points are set. Funding: The research of Z. Wang and L. Ran was supported by the National Natural Science Foundation of China [Grants 72272014, 91746210, and 72061127001]. Z. Wang’s research was also supported by the National Natural Science Foundation of China [Grant 72242106]. The research of M. Zhou was supported by the National Natural Science Foundation of China [Grants 72301075, and 72293564/72293560]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2023.0531 .