default search action
Taibo Luo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j11]Taibo Luo, Hongmei Li, Shaofeng Ru, Weitian Tong, Yinfeng Xu:
Multiple sink location problem in path networks with a combinational objective. Optim. Lett. 15(2): 733-755 (2021) - 2020
- [j10]Jianming Dong, Ruyan Jin, Taibo Luo, Weitian Tong
:
A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops. Eur. J. Oper. Res. 281(1): 16-24 (2020) - [j9]Yong Chen, Guohui Lin
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020)
2010 – 2019
- 2018
- [j8]Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin
Rescheduling due to machine disruption to minimize the total weighted completion time. J. Sched. 21(5): 565-578 (2018) - 2017
- [j7]Taibo Luo, Yuqing Zhu, Weili Wu, Yin-Feng Xu, Ding-Zhu Du:
Online makespan minimization in MapReduce-like systems with complex reduce tasks. Optim. Lett. 11(2): 271-277 (2017) - [j6]Jianming Dong, Weitian Tong
An FPTAS for the parallel two-stage flowshop problem. Theor. Comput. Sci. 657: 64-72 (2017) - [j5]Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. Theor. Comput. Sci. 687: 93-94 (2017) - [c3]Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang:
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. ISAAC 2017: 66:1-66:12 - [i3]Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin:
On rescheduling due to machine disruption while to minimize the total weighted completion time. CoRR abs/1701.07498 (2017) - [i2]Yao Xu, Yong Chen, Taibo Luo, Guohui Lin:
A local search 2.917-approximation algorithm for duo-preservation string mapping. CoRR abs/1702.01877 (2017) - [i1]Yao Xu, Yong Chen, Taibo Luo, Guohui Lin:
A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem. CoRR abs/1702.06256 (2017) - 2016
- [j4]Taibo Luo, Yin-Feng Xu:
Optimal algorithm for semi-online scheduling on two machines under GoS levels. Optim. Lett. 10(1): 207-213 (2016) - [j3]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong
Machine scheduling with a maintenance interval and job delivery coordination. Optim. Lett. 10(8): 1645-1656 (2016) - 2015
- [j2]Taibo Luo, Yin-Feng Xu:
Semi-online hierarchical load balancing problem with bounded processing times. Theor. Comput. Sci. 607: 75-82 (2015) - [c2]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. FAW 2015: 104-114 - 2014
- [j1]Taibo Luo, Yinfeng Xu, Li Luo, Changzheng He:
Semi-online scheduling with two GoS levels and unit processing time. Theor. Comput. Sci. 521: 62-72 (2014) - [c1]Taibo Luo, Yinfeng Xu:
Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times. AAIM 2014: 231-240
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-07 22:09 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: