Minimizing regular criteria in the Flexible Job-shop Scheduling Problem

Abstract: Algorithms for minimizing other regular criteria than the makespan in the Flexible Job-shop Scheduling Problem (FJSP) are rather scarce. In this paper, we propose a local search algorithm to optimize any regular criterion in the FJSP, which makes use of the disjunctive graph model to repre...

Descripción completa

Detalles Bibliográficos
Autor Principal: García León, Andrés Alberto; Dauzère-Pérès, Sthépane; Mati, Yazid
Formato: Artículo (Article)
Lenguaje:Desconocido (Unknown)
Publicado: 2015
Materias:
Acceso en línea:http://babel.banrepcultural.org/cdm/ref/collection/p17054coll23/id/503