Taibo Luo

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We study the maximum duo-preservation string mapping (Max-Duo) problem, which is the complement of the well studied minimum common string partition (MCSP) problem. Both problems have applications in many fields including text compression and bioinformatics. Motivated by an earlier local search algorithm, we present an improved approximation and show that(More)
We investigate a single machine rescheduling problem that arises from an unexpected machine un-availability, after the given set of jobs has already been scheduled to minimize the total weighted completion time. Such a disruption is represented as an unavailable time interval and is revealed to the production planner before any job is processed; the(More)
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 higher GoS level, knowing the total processing time of the jobs with lower GoS level, or knowing(More)
  • 1