Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem

Assignation-sequencing models have played a critical role in the competitiveness of manufacturing companies since the mid-1950s. The historic and constant evolution of these models, from simple assignations to complex constrained formulations, shows the need for, and increased interest in, more robu...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jesús Isaac Vázquez-Serrano, Leopoldo Eduardo Cárdenas-Barrón, Rodrigo E. Peimbert-García
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	agent scheduling unrelated parallel machines makespan dependent setup times Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/1fa5a3de1fe642d383484abf91d8f7ae
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:1fa5a3de1fe642d383484abf91d8f7ae
record_format	dspace
spelling	oai:doaj.org-article:1fa5a3de1fe642d383484abf91d8f7ae2021-11-25T18:17:32ZAgent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem10.3390/math92229552227-7390https://doaj.org/article/1fa5a3de1fe642d383484abf91d8f7ae2021-11-01T00:00:00Zhttps://www.mdpi.com/2227-7390/9/22/2955https://doaj.org/toc/2227-7390Assignation-sequencing models have played a critical role in the competitiveness of manufacturing companies since the mid-1950s. The historic and constant evolution of these models, from simple assignations to complex constrained formulations, shows the need for, and increased interest in, more robust models. Thus, this paper presents a model to schedule agents in unrelated parallel machines that includes sequence and agent–machine-dependent setup times (ASUPM), considers an agent-to-machine relationship, and seeks to minimize the maximum makespan criteria. By depicting a more realistic scenario and to address this <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="script">NP</mi></semantics></math></inline-formula>-hard problem, six mixed-integer linear formulations are proposed, and due to its ease of diversification and construct solutions, two multi-start heuristics, composed of seven algorithms, are divided into two categories: Construction of initial solution (designed algorithm) and improvement by intra (tabu search) and inter perturbation (insertions and interchanges). Three different solvers are used and compared, and heuristics algorithms are tested using randomly generated instances. It was found that models that linearizing the objective function by both job completion time and machine time is faster and related to the heuristics, and presents an outstanding level of performance in a small number of instances, since it can find the optimal value for almost every instance, has very good behavior in a medium level of instances, and decent performance in a large number of instances, where the relative deviations tend to increase concerning the small and medium instances. Additionally, two real-world applications of the problem are presented: scheduling in the automotive industry and healthcare.Jesús Isaac Vázquez-SerranoLeopoldo Eduardo Cárdenas-BarrónRodrigo E. Peimbert-GarcíaMDPI AGarticleagent schedulingunrelated parallel machinesmakespandependent setup timesMathematicsQA1-939ENMathematics, Vol 9, Iss 2955, p 2955 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	agent scheduling unrelated parallel machines makespan dependent setup times Mathematics QA1-939
spellingShingle	agent scheduling unrelated parallel machines makespan dependent setup times Mathematics QA1-939 Jesús Isaac Vázquez-Serrano Leopoldo Eduardo Cárdenas-Barrón Rodrigo E. Peimbert-García Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
description	Assignation-sequencing models have played a critical role in the competitiveness of manufacturing companies since the mid-1950s. The historic and constant evolution of these models, from simple assignations to complex constrained formulations, shows the need for, and increased interest in, more robust models. Thus, this paper presents a model to schedule agents in unrelated parallel machines that includes sequence and agent–machine-dependent setup times (ASUPM), considers an agent-to-machine relationship, and seeks to minimize the maximum makespan criteria. By depicting a more realistic scenario and to address this <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="script">NP</mi></semantics></math></inline-formula>-hard problem, six mixed-integer linear formulations are proposed, and due to its ease of diversification and construct solutions, two multi-start heuristics, composed of seven algorithms, are divided into two categories: Construction of initial solution (designed algorithm) and improvement by intra (tabu search) and inter perturbation (insertions and interchanges). Three different solvers are used and compared, and heuristics algorithms are tested using randomly generated instances. It was found that models that linearizing the objective function by both job completion time and machine time is faster and related to the heuristics, and presents an outstanding level of performance in a small number of instances, since it can find the optimal value for almost every instance, has very good behavior in a medium level of instances, and decent performance in a large number of instances, where the relative deviations tend to increase concerning the small and medium instances. Additionally, two real-world applications of the problem are presented: scheduling in the automotive industry and healthcare.
format	article
author	Jesús Isaac Vázquez-Serrano Leopoldo Eduardo Cárdenas-Barrón Rodrigo E. Peimbert-García
author_facet	Jesús Isaac Vázquez-Serrano Leopoldo Eduardo Cárdenas-Barrón Rodrigo E. Peimbert-García
author_sort	Jesús Isaac Vázquez-Serrano
title	Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
title_short	Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
title_full	Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
title_fullStr	Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
title_full_unstemmed	Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
title_sort	agent scheduling in unrelated parallel machines with sequence- and agent–machine–dependent setup time problem
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/1fa5a3de1fe642d383484abf91d8f7ae
work_keys_str_mv	AT jesusisaacvazquezserrano agentschedulinginunrelatedparallelmachineswithsequenceandagentmachinedependentsetuptimeproblem AT leopoldoeduardocardenasbarron agentschedulinginunrelatedparallelmachineswithsequenceandagentmachinedependentsetuptimeproblem AT rodrigoepeimbertgarcia agentschedulinginunrelatedparallelmachineswithsequenceandagentmachinedependentsetuptimeproblem
_version_	1718411367862501376

Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem

Ejemplares similares