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
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