An Efficient Algorithm for Minimizing Regular Criteria in the Job-Shop Scheduling Multi-resource Resource Flexibility with Linear Routes

Andrés Alberto García-León, William Fernando Torres Tapia

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

The level of publications of extensions derived from the Job-shop scheduling problem is really low. The Flexible Job-shop scheduling problem is the most studied and the minimization of the makespan is the dominant approach in the literature. The level of the customer service cannot be measured efficiently minimizing makespan, since it does not consider relevant aspects like the due date of jobs and the importance between customers. In this paper, we propose an efficient and fast local search general algorithm to minimize regular criteria in the Job-shop Scheduling Multi-resource Resource Flexibility with Linear Routes Problem “JSMRFLR”. JSMRFLR models situations in which an operation to be processed needs simultaneously several resources or machines, where each resource is selected from a given set of candidate resources. Our approach makes use of the disjunctive graph model to represent schedules or solutions and guide the search for an optimal solution by a fast estimation function. The transformation in the conjunctive graph is evaluated at swapping a critical arc that affects the criterion and the reassignment of and separately. The efficiency of our approach is evidenced in instances of literature for the case of makespan criterion and a reference of results is proposed by the case of the total flow time, the maximum and total tardiness.

Idioma originalInglés
Título de la publicación alojadaApplied Computer Sciences in Engineering - 7th Workshop on Engineering Applications, WEA 2020, Proceedings
EditoresJuan Carlos Figueroa-García, Fabián Steven Garay-Rairán, Germán Jairo Hernández-Pérez, Yesid Díaz-Gutierrez
EditorialSpringer Science and Business Media Deutschland GmbH
Páginas165-180
Número de páginas16
ISBN (versión impresa)9783030618339
DOI
EstadoPublicada - 2020
Evento7th Workshop on Engineering Applications, WEA 2020 - Bogota, Colombia
Duración: 7 oct 20209 oct 2020

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen1274 CCIS
ISSN (versión impresa)1865-0929
ISSN (versión digital)1865-0937

Conferencia

Conferencia7th Workshop on Engineering Applications, WEA 2020
PaísColombia
CiudadBogota
Período7/10/209/10/20

Huella Profundice en los temas de investigación de 'An Efficient Algorithm for Minimizing Regular Criteria in the Job-Shop Scheduling Multi-resource Resource Flexibility with Linear Routes'. En conjunto forman una huella única.

Citar esto