A comparison of two V-shaped schedule-builder EAs for the common due date problem

The restricted single-machine common due date problem can be stated as follows: A set of <i>n</i> jobs with deterministic processing times <i>p</i><SUB>i</SUB> and a common due date <i>d</i> are given. The jobs have to be processed on one machine. For...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Pandolfi, Daniel, Vilanova, Gabriela, San Pedro, María Eugenia de, Villagra, Andrea, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2001
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21648
Aporte de:

Ejemplares similares