default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManzhan Gu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Peihai Liu
, Manzhan Gu, Xiwen Lu:
Two-agent scheduling in a two-machine open shop. Ann. Oper. Res. 333(1): 275-301 (2024)- [j14]Manzhan Gu, Weitao Yang, Peihai Liu:
Stochastic single-machine scheduling with workload-dependent maintenance activities. Optim. Lett. 18(8): 1925-1947 (2024) - [j13]Manzhan Gu, Peihai Liu, Xiwen Lu:
Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines. Theor. Comput. Sci. 1012: 114729 (2024) - 2022
- [j12]Xiwen Lu, Kejun Zhao, Manzhan Gu:
Online single-machine scheduling to minimize the linear combination of makespans of two agents. Inf. Process. Lett. 173: 106163 (2022)
2010 – 2019
- 2019
- [j11]Peihai Liu, Manzhan Gu, Ganggang Li:
Two-agent scheduling on a single machine with release dates. Comput. Oper. Res. 111: 35-42 (2019) - [j10]Manzhan Gu, Xiwen Lu, Jinwei Gu:
An approximation algorithm for multi-agent scheduling on two uniform parallel machines. Optim. Lett. 13(4): 907-933 (2019) - 2018
- [j9]Jinwei Gu, Manzhan Gu, Xiwen Lu, Ying Zhang:
Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan. J. Comb. Optim. 36(1): 142-161 (2018) - [j8]Manzhan Gu, Jinwei Gu, Xiwen Lu:
An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines. J. Sched. 21(5): 483-492 (2018) - 2017
- [j7]Manzhan Gu, Xiwen Lu, Jinwei Gu:
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan. J. Comb. Optim. 33(2): 473-495 (2017) - 2016
- [j6]Kejun Zhao, Xiwen Lu, Manzhan Gu:
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines. J. Sched. 19(1): 21-31 (2016) - 2014
- [j5]Guantao Chen, Manzhan Gu, Nana Li:
On Maximum Edge Cuts of Connected Digraphs. J. Graph Theory 76(1): 1-19 (2014) - 2013
- [j4]Manzhan Gu, Xiwen Lu:
The expected asymptotical ratio for preemptive stochastic online problem. Theor. Comput. Sci. 495: 96-112 (2013) - 2011
- [j3]Manzhan Gu, Xiwen Lu:
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines. Ann. Oper. Res. 191(1): 97-113 (2011) - 2010
- [j2]Jinwei Gu, Manzhan Gu, Cuiwen Cao, Xingsheng Gu:
A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem. Comput. Oper. Res. 37(5): 927-937 (2010)
2000 – 2009
- 2009
- [j1]Manzhan Gu, Xiwen Lu:
Preemptive stochastic online scheduling on two uniform machines. Inf. Process. Lett. 109(7): 369-375 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
