martes, 26 de septiembre de 2017

Ficha del recurso:

Fuente:

Vínculo original en EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 219 (1):27-33; 10.1016/j.ejor.2011.11.023 MAY 16 2012
Lushchakova, IN

Última actualización:

jueves, 12 de abril de 2012

Entrada en el observatorio:

jueves, 12 de abril de 2012

Idioma:

Inglés

Archivado en:


Preemptive scheduling of two uniform parallel machines to minimize total tardiness

We consider the problem of preemptive scheduling n jobs on two uniform parallel machines. All jobs have equal processing requirements. For each job we are given its due date. The objective is to find a schedule minimizing total tardiness Sigma T-i. We suggest an O(n log n) algorithm to solve this problem. (C) 2011 Elsevier B.V. All rights reserved.