A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem 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 conferencia

Resumen

The Job-shop Scheduling problem Multi-resource Resource flexibility with linear routes is an extension of the classical Job-shop Scheduling problem “JSMRFLR” where an operation needs several resources (machines) simultaneously to be processed and each machine is selected from a given set. Linear route indicates that an operation is exclusively performed for a job. Publications related to this problem are really scarce and they are dedicated to minimize makespan criterion, which aims to minimize the use of the machines. In the modern scenery of the Operations Management, the exclusive minimization of the makespan does not allow to analyze aspects of the customer service to ensure high levels of competitiveness such as the consideration of due-date and the importance between jobs. In this paper, we propose a general Pareto approach to solve the JSMRFLR with regular criteria, which operates by an efficient local search at using a fast estimation function for the criteria considering the conjunctive graph. During the search, the set of non-dominated solutions is updated. The efficiency of our approach is illustrated on instances of literature at performing three sets of criteria. The first set considers makespan and maximum tardiness. In the second total flow time is added and in the third the total tardiness. As a product of our approach, a reference of results is proposed by future research.

Idioma originalInglés
Título de la publicación alojadaApplied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings
EditoresJuan Carlos Figueroa-García, Mario Duarte-González, Sebastián Jaramillo-Isaza, Alvaro David Orjuela-Cañon, Yesid Díaz-Gutierrez
EditorialSpringer Healthcare
Páginas764-775
Número de páginas12
ISBN (versión impresa)9783030310189
DOI
EstadoPublicada - 1 ene 2019
Evento6th Workshop on Engineering Applications, WEA 2019 - Santa Marta, Colombia
Duración: 16 oct 201918 oct 2019

Serie de la publicación

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

Conferencia

Conferencia6th Workshop on Engineering Applications, WEA 2019
PaísColombia
CiudadSanta Marta
Período16/10/1918/10/19

Huella dactilar

Job Shop Scheduling Problem
Pareto
Local Search
Flexibility
Resources
Total Tardiness
Minimise
Operations Management
Nondominated Solutions
Function Estimation
Tardiness
Due Dates
Flow Time
Competitiveness
Customers
Job shop scheduling
Graph in graph theory

Citar esto

García-León, A. A., & Torres Tapia, W. F. (2019). A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes. En J. C. Figueroa-García, M. Duarte-González, S. Jaramillo-Isaza, A. D. Orjuela-Cañon, & Y. Díaz-Gutierrez (Eds.), Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings (pp. 764-775). (Communications in Computer and Information Science; Vol. 1052). Springer Healthcare. https://doi.org/10.1007/978-3-030-31019-6_64
García-León, Andrés Alberto ; Torres Tapia, William Fernando. / A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes. Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings. editor / Juan Carlos Figueroa-García ; Mario Duarte-González ; Sebastián Jaramillo-Isaza ; Alvaro David Orjuela-Cañon ; Yesid Díaz-Gutierrez. Springer Healthcare, 2019. pp. 764-775 (Communications in Computer and Information Science).
@inproceedings{522823023c764315b4442294c7d18065,
title = "A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes",
abstract = "The Job-shop Scheduling problem Multi-resource Resource flexibility with linear routes is an extension of the classical Job-shop Scheduling problem “JSMRFLR” where an operation needs several resources (machines) simultaneously to be processed and each machine is selected from a given set. Linear route indicates that an operation is exclusively performed for a job. Publications related to this problem are really scarce and they are dedicated to minimize makespan criterion, which aims to minimize the use of the machines. In the modern scenery of the Operations Management, the exclusive minimization of the makespan does not allow to analyze aspects of the customer service to ensure high levels of competitiveness such as the consideration of due-date and the importance between jobs. In this paper, we propose a general Pareto approach to solve the JSMRFLR with regular criteria, which operates by an efficient local search at using a fast estimation function for the criteria considering the conjunctive graph. During the search, the set of non-dominated solutions is updated. The efficiency of our approach is illustrated on instances of literature at performing three sets of criteria. The first set considers makespan and maximum tardiness. In the second total flow time is added and in the third the total tardiness. As a product of our approach, a reference of results is proposed by future research.",
keywords = "Extension of the Job-shop scheduling problem, Local search, Pareto optimization, Regular criteria, Scheduling theory",
author = "Garc{\'i}a-Le{\'o}n, {Andr{\'e}s Alberto} and {Torres Tapia}, {William Fernando}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-31019-6_64",
language = "Ingl{\'e}s",
isbn = "9783030310189",
series = "Communications in Computer and Information Science",
publisher = "Springer Healthcare",
pages = "764--775",
editor = "Figueroa-Garc{\'i}a, {Juan Carlos} and Mario Duarte-Gonz{\'a}lez and Sebasti{\'a}n Jaramillo-Isaza and Orjuela-Ca{\~n}on, {Alvaro David} and Yesid D{\'i}az-Gutierrez",
booktitle = "Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings",
address = "Estados Unidos",

}

García-León, AA & Torres Tapia, WF 2019, A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes. En JC Figueroa-García, M Duarte-González, S Jaramillo-Isaza, AD Orjuela-Cañon & Y Díaz-Gutierrez (eds.), Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings. Communications in Computer and Information Science, vol. 1052, Springer Healthcare, pp. 764-775, 6th Workshop on Engineering Applications, WEA 2019, Santa Marta, Colombia, 16/10/19. https://doi.org/10.1007/978-3-030-31019-6_64

A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes. / García-León, Andrés Alberto; Torres Tapia, William Fernando.

Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings. ed. / Juan Carlos Figueroa-García; Mario Duarte-González; Sebastián Jaramillo-Isaza; Alvaro David Orjuela-Cañon; Yesid Díaz-Gutierrez. Springer Healthcare, 2019. p. 764-775 (Communications in Computer and Information Science; Vol. 1052).

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

TY - GEN

T1 - A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes

AU - García-León, Andrés Alberto

AU - Torres Tapia, William Fernando

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The Job-shop Scheduling problem Multi-resource Resource flexibility with linear routes is an extension of the classical Job-shop Scheduling problem “JSMRFLR” where an operation needs several resources (machines) simultaneously to be processed and each machine is selected from a given set. Linear route indicates that an operation is exclusively performed for a job. Publications related to this problem are really scarce and they are dedicated to minimize makespan criterion, which aims to minimize the use of the machines. In the modern scenery of the Operations Management, the exclusive minimization of the makespan does not allow to analyze aspects of the customer service to ensure high levels of competitiveness such as the consideration of due-date and the importance between jobs. In this paper, we propose a general Pareto approach to solve the JSMRFLR with regular criteria, which operates by an efficient local search at using a fast estimation function for the criteria considering the conjunctive graph. During the search, the set of non-dominated solutions is updated. The efficiency of our approach is illustrated on instances of literature at performing three sets of criteria. The first set considers makespan and maximum tardiness. In the second total flow time is added and in the third the total tardiness. As a product of our approach, a reference of results is proposed by future research.

AB - The Job-shop Scheduling problem Multi-resource Resource flexibility with linear routes is an extension of the classical Job-shop Scheduling problem “JSMRFLR” where an operation needs several resources (machines) simultaneously to be processed and each machine is selected from a given set. Linear route indicates that an operation is exclusively performed for a job. Publications related to this problem are really scarce and they are dedicated to minimize makespan criterion, which aims to minimize the use of the machines. In the modern scenery of the Operations Management, the exclusive minimization of the makespan does not allow to analyze aspects of the customer service to ensure high levels of competitiveness such as the consideration of due-date and the importance between jobs. In this paper, we propose a general Pareto approach to solve the JSMRFLR with regular criteria, which operates by an efficient local search at using a fast estimation function for the criteria considering the conjunctive graph. During the search, the set of non-dominated solutions is updated. The efficiency of our approach is illustrated on instances of literature at performing three sets of criteria. The first set considers makespan and maximum tardiness. In the second total flow time is added and in the third the total tardiness. As a product of our approach, a reference of results is proposed by future research.

KW - Extension of the Job-shop scheduling problem

KW - Local search

KW - Pareto optimization

KW - Regular criteria

KW - Scheduling theory

UR - http://www.scopus.com/inward/record.url?scp=85075654822&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-31019-6_64

DO - 10.1007/978-3-030-31019-6_64

M3 - Contribución a la conferencia

AN - SCOPUS:85075654822

SN - 9783030310189

T3 - Communications in Computer and Information Science

SP - 764

EP - 775

BT - Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings

A2 - Figueroa-García, Juan Carlos

A2 - Duarte-González, Mario

A2 - Jaramillo-Isaza, Sebastián

A2 - Orjuela-Cañon, Alvaro David

A2 - Díaz-Gutierrez, Yesid

PB - Springer Healthcare

ER -

García-León AA, Torres Tapia WF. A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes. En Figueroa-García JC, Duarte-González M, Jaramillo-Isaza S, Orjuela-Cañon AD, Díaz-Gutierrez Y, editores, Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings. Springer Healthcare. 2019. p. 764-775. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-030-31019-6_64