Search

In this paper, we present a general methodology for designing polynomial-time algorithms for bicriteria scheduling problems on parallel machines with controllable processing times. For each considered problem, the two criteria are the makespan and the total compression cost, and the solution is delivered in the form of the break points of the efficient frontier. We reformulate the scheduling problems in terms of optimization over submodular polyhedra and give efficient procedures for computing the corresponding rank functions. As a result, for two of the considered problems we obtain the first polynomial-time algorithms, while for the third problem we considerably improve the known running time. [ABSTRACT FROM AUTHOR]