Suppose n jobs are to be processed on a single machine. These jobs can not be performed in any order, because a . precedence relation between the jobs is specified. This paper develops an heuristic method to find a schedule which minimizes the total tardiness
© 2008-2024 Fundación Dialnet · Todos los derechos reservados