Dehua Xu

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
Combinatorial optimization is one of the most active branches of operations research. The essence of a combina-torial optimization problem is to find optimal solutions or near optimal solutions from a finite set of feasible solutions. In such problems, the size of feasible solution space usually increases exponentially with regard to the increase in the(More)
We consider a single machine scheduling problem with multiple maintenance activities, where the maintenance duration function is of the linear form f(t) = a+bt with a ≥ 0 and b > 1. We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem. We also show that there is no polynomial time approximation algorithm with a(More)
  • 1