default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuochun Tang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j20]Liwei Zhong, Guochun Tang:
Preface: Combinatorial optimization drives the future of Health Care. J. Comb. Optim. 42(4): 675-676 (2021)- 2020
- [c6]Bin Li, Tengfei Li, Xinye Zhou, Chen Huang, Guochun Tang:
Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer. AAIM 2020: 593-603
2010 – 2019
- 2019
- [j19]Ying Yang
, Shoucheng Luo, Jing Fan, Xinye Zhou, Chunyu Fu, Guochun Tang:
Study on specialist outpatient matching appointment and the balance matching model. J. Comb. Optim. 37(1): 20-39 (2019) - 2015
- [j18]Liwei Zhong, Guochun Tang:
Preface. J. Comb. Optim. 30(4): 839-840 (2015) - [j17]Lili Liu, Guochun Tang, Baoqiang Fan, Xingpeng Wang:
Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process. J. Comb. Optim. 30(4): 938-948 (2015) - 2014
- [j16]Liwei Zhong, Shoucheng Luo, Lidong Wu, Lin Xu, Jinghui Yang, Guochun Tang:
A two-stage approach for surgery scheduling. J. Comb. Optim. 27(3): 545-556 (2014) - 2013
- [j15]Yanhong Gu, Jing Fan, Guochun Tang, Jiaofei Zhong:
Maximum latency scheduling problem on two-person cooperative games. J. Comb. Optim. 26(1): 71-81 (2013) - 2012
- [j14]Xingong Zhang, Guangle Yan, Wanzhen Huang, Guochun Tang:
A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects. Inf. Sci. 187: 298-304 (2012) - [j13]Baoqiang Fan, Yeping Sun, Rongjun Chen, Guochun Tang:
A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm. Optim. Lett. 6(8): 1951-1955 (2012) - [j12]Rongjun Chen, Wanzhen Huang, Zhongxian Men, Guochun Tang:
Open-shop dense schedules: properties and worst-case performance ratio. J. Sched. 15(1): 3-11 (2012) - [j11]Shanling Li, Zhi-Long Chen, Guochun Tang:
Optimality proof of the Kise-Ibaraki-Mine algorithm. J. Sched. 15(3): 289-294 (2012) - 2011
- [j10]Xingong Zhang, Guangle Yan, Wanzhen Huang, Guochun Tang:
Single-machine scheduling problems with time and position dependent processing times. Ann. Oper. Res. 186(1): 345-356 (2011) - [j9]Caixia Jing, Wanzhen Huang, Guochun Tang:
Minimizing total completion time for re-entrant flow shop scheduling problems. Theor. Comput. Sci. 412(48): 6712-6719 (2011) - [c5]Ziqiang Luo, Peng Cao, Guochun Tang, Lihua Wu:
A Modification to the Jelinski-Moranda Software Reliability Growth Model Based on Cloud Model Theory. CIS 2011: 195-198 - 2010
- [j8]Shanling Li, Zhi-Long Chen, Guochun Tang:
A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm. Oper. Res. 58(2): 508-509 (2010)
2000 – 2009
- 2009
- [j7]Baoqiang Fan, Rongjun Chen, Guochun Tang:
Bicriteria Scheduling on Single-Machine with inventory Operations. Discret. Math. Algorithms Appl. 1(2): 227-234 (2009) - [c4]Baoqiang Fan, Rongjun Chen, Guochun Tang:
Bicriteria Scheduling on Single-Machine with Inventory Operations. COCOA 2009: 395-402 - [c3]Rongjun Chen, Baoqiang Fan, Guochun Tang:
Scheduling Problems in Cross Docking. COCOA 2009: 421-429 - 2008
- [j6]Caixia Jing, Guochun Tang, Xingsan Qian:
Heuristic algorithms for two machine re-entrant flow shop. Theor. Comput. Sci. 400(1-3): 137-143 (2008) - [j5]Rongjun Chen, Wanzhen Huang, Guochun Tang:
Dense open-shop schedules with release times. Theor. Comput. Sci. 407(1-3): 389-399 (2008) - 2007
- [c2]Baoqiang Fan, Jianzhong Gu, Guochun Tang:
Scheduling a Flexible Batching Machine. AAIM 2007: 91-99 - 2006
- [c1]Baoqiang Fan, Guochun Tang:
Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms. TAMC 2006: 118-127 - 2001
- [j4]Feng Zhang, Guochun Tang, Zhi-Long Chen:
A 3/2-approximation algorithm for parallel machine scheduling with controllable processing times. Oper. Res. Lett. 29(1): 41-47 (2001) - 2000
- [j3]Chung-Yee Lee, Yong He, Guochun Tang:
A note on "parallel machine scheduling with non-simultaneous machine available time". Discret. Appl. Math. 100(1-2): 133-135 (2000)
1990 – 1999
- 1997
- [j2]Zhi-Long Chen, Qing Lu, Guochun Tang:
Single machine scheduling with discretely controllable processing times. Oper. Res. Lett. 21(2): 69-76 (1997) - 1995
- [j1]S. Chang, Qing Lu, Guochun Tang, W. Yu:
On decomposition of the total tardiness problem. Oper. Res. Lett. 17(5): 221-229 (1995)
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-05-29 21:33 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:
