Manzhan Gu

Orcid: 0000-0001-7332-2201

According to our database1, Manzhan Gu authored at least 16 papers between 2009 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Analyzing the price of fairness in scheduling problems with two agents.
Eur. J. Oper. Res., 2025

2024
Stochastic single-machine scheduling with workload-dependent maintenance activities.
Optim. Lett., November, 2024

Two-agent scheduling in a two-machine open shop.
Ann. Oper. Res., February, 2024

Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines.
Theor. Comput. Sci., 2024

2022
Online single-machine scheduling to minimize the linear combination of makespans of two agents.
Inf. Process. Lett., 2022

2019
An approximation algorithm for multi-agent scheduling on two uniform parallel machines.
Optim. Lett., 2019

Two-agent scheduling on a single machine with release dates.
Comput. Oper. Res., 2019

2018
An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines.
J. Sched., 2018

Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan.
J. Comb. Optim., 2018

2017
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan.
J. Comb. Optim., 2017

2016
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines.
J. Sched., 2016

2014
On Maximum Edge Cuts of Connected Digraphs.
J. Graph Theory, 2014

2013
The expected asymptotical ratio for preemptive stochastic online problem.
Theor. Comput. Sci., 2013

2011
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines.
Ann. Oper. Res., 2011

2010
A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem.
Comput. Oper. Res., 2010

2009
Preemptive stochastic online scheduling on two uniform machines.
Inf. Process. Lett., 2009


  Loading...