The paper deals with the single machine scheduling problem where both total and maximum tardiness must be minimized. The ε-constraint approach is adopted to search for all the Pareto-optima, leading to cope with a total tardiness problem with deadlines. This latter problem is studied, identifying several dominance properties, decomposition rules and polynomially and pseudopolynomially solvable cases. A branch and bound algorithm for finding the Pareto-optima is proposed and computational results are reported for instances up to 70 jobs in size. © 2002 Elsevier Science B.V.
Finding the Pareto-optima for the total and maximum tardiness single machine problem / Tadei, R.; Grosso, A.; Della Croce, F.. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - STAMPA. - 124:1-3(2002), pp. 117-126.
|Titolo:||Finding the Pareto-optima for the total and maximum tardiness single machine problem|
|Data di pubblicazione:||2002|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/S0166-218X(01)00334-1|
|Appare nelle tipologie:||1.1 Articolo in rivista|