Online C-benevolent job scheduling on multiple machines. - Ge Yu 006; Sheldon H. Jacobson (Optim. Lett., 2018)

A bi-criteria multiple-choice secretary problem. - Ge Yu 006; Sheldon H. Jacobson; Negar Kiyavash (IISE Trans., 2019)

Approximation algorithms for scheduling C-benevolent jobs on weighted machines. - Ge Yu 006; Sheldon H. Jacobson (IISE Trans., 2020)

Primal-dual analysis for online interval scheduling problems. - Ge Yu 006; Sheldon H. Jacobson (J. Glob. Optim., 2020)

Approximation algorithms for stochastic online matching with reusable resources. - Meghan Shanks; Ge Yu 006; Sheldon H. Jacobson (Math. Methods Oper. Res., 2023)