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 scheduling problem / Tadei, Roberto; A., Grosso; DELLA CROCE DI DOJOLA, Federico. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - STAMPA. - 124:1-3(2002), pp. 117-126. [10.1016/S0166-218X(01)00334-1]

Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem

TADEI, Roberto;DELLA CROCE DI DOJOLA, Federico
2002

Abstract

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.
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0166218X01003341-main.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 110.81 kB
Formato Adobe PDF
110.81 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/1399392
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo