Two Uniform Machines Scheduling with an Availability Constraint

Two Uniform Machines Scheduling with an Availability Constraint[J]. Journal of East China University of Science and Technology, 2005, (4): 512-516.

Citation:

Two Uniform Machines Scheduling with an Availability Constraint[J]. Journal of East China University of Science and Technology, 2005, (4): 512-516.

Citation:

Two Uniform Machines Scheduling with an Availability Constraint[J]. Journal of East China University of Science and Technology, 2005, (4): 512-516.

Abstract

In this paper the two uniform machines scheduling problem is studied, in which one ~machine has an availability constraint and the objective function is makespan. The worst-case ratio of LPT algorithm is proved to be max32,1s_2, and the ratio is tight.

FullText(HTML)

Export File