TLTaibo Luo
Taibo Luo
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Taibo Luo has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Guohui Lin
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
1 shared publicationHao Li
Department of Chemistry, University of Alberta, Edmonton, Alberta, Canada
1 shared publication- Liang Li
The Metabolomics Innovation Centre, Department of Chemistry, University of Alberta, Edmonton, AB T6G 2G2, Canada
1 shared publication - Yinfeng Xu
Business School, Sichuan University, Chengdu, China
1 shared publication Yunong Li
Department of Chemistry, University of Alberta, Edmonton, Alberta, Canada
1 shared publication
Latest Publications
- 1 June 2023
- Published by Elsevier in Analytica Chimica Acta
- Vol. 1272, 341467
Intensity-dependent mass search for improving metabolite database matches in chemical isotope labeling LC-QTOF-MS-based metabolomics
- 1 June 2023
- Published by Elsevier in Analytica Chimica Acta
- Vol. 1272, 341467
Intensity-dependent mass search for improving metabolite database matches in chemical isotope labeling LC-QTOF-MS-based metabolomics
- Open Access
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-6
Semi-Online Scheduling on Two Machines withGoSLevels and Partial Information of Processing Time
This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higherGoSlevel, knowing the total processing time of the jobs with lowerGoSlevel, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of,, andwhich are shown to be optimal.- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-6
Open AccessSemi-Online Scheduling on Two Machines withGoSLevels and Partial Information of Processing Time
This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higherGoSlevel, knowing the total processing time of the jobs with lowerGoSlevel, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of,, andwhich are shown to be optimal.