Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times

Instances used in the computational experiment of the paper: Heuristic and metaheuristic procedures for the buffer sizing problem in Parallel Assembly Lines Balancing Problem with multi-line workstations and different cycle times. This research paper focuses on the buffer sizing problem in the paral...

Descripción completa

Detalles Bibliográficos
Autores: Aguilar Gamarra, Harry Nick, Pastor Moreno, Rafael, García Villoria, Alberto
Tipo de recurso: conjunto de datos
Fecha de publicación:2023
País:España
Institución:Consorci de Serveis Universitaris de Catalunya (CSUC)
Repositorio:CORA.Repositori de Dades de Recerca
OAI Identifier:oai:dnet:cora.rdr____::d7e34d2396897d2d8a2f131deb0de148
Acceso en línea:https://doi.org/10.34810/DATA672
Access Level:acceso abierto
Palabra clave:Engineering
Instances
Parallel assembly lines balancing problem
Buffer sizing problem
id ES_c874889ee7cf5efcd5be83e0cd8ef0b9
oai_identifier_str oai:dnet:cora.rdr____::d7e34d2396897d2d8a2f131deb0de148
network_acronym_str ES
network_name_str España
repository_id_str
spelling Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle timesAguilar Gamarra, Harry NickPastor Moreno, RafaelGarcía Villoria, AlbertoEngineeringInstancesParallel assembly lines balancing problemBuffer sizing problemInstances used in the computational experiment of the paper: Heuristic and metaheuristic procedures for the buffer sizing problem in Parallel Assembly Lines Balancing Problem with multi-line workstations and different cycle times. This research paper focuses on the buffer sizing problem in the parallel assembly lines balancing problem with multiline workstations (PALBP) and lines with different cycle times. This paper presents different non-exact procedures to solve the buffer sizing problem in the PALBP with lines with different cycle times in a viable computation time. A computational experiment was carried out to evaluate the performance of the proposed procedures. Due to the novelty of the problem to be solved, to carry out the computational experiment, 120 instances have been generated from 8 precedence graphs. The files attached here contain all the instances used in the computational experiment. Each instance contains the necessary data to be executed.CORA.Repositori de Dades de RecercaAguilar Gamarra, Harry - NickCurator 240(MR)2023info:eu-repo/semantics/datasethttps://doi.org/10.34810/DATA672reponame:CORA.Repositori de Dades de Recercainstname:Consorci de Serveis Universitaris de Catalunya (CSUC)Inglésinfo:eu-repo/semantics/openAccessCC0 1.0oai:dnet:cora.rdr____::d7e34d2396897d2d8a2f131deb0de1482026-06-17T12:20:17Z
dc.title.none.fl_str_mv Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
title Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
spellingShingle Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
Aguilar Gamarra, Harry Nick
Engineering
Instances
Parallel assembly lines balancing problem
Buffer sizing problem
title_short Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
title_full Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
title_fullStr Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
title_full_unstemmed Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
title_sort Replication Data for: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
dc.creator.none.fl_str_mv Aguilar Gamarra, Harry Nick
Pastor Moreno, Rafael
García Villoria, Alberto
author Aguilar Gamarra, Harry Nick
author_facet Aguilar Gamarra, Harry Nick
Pastor Moreno, Rafael
García Villoria, Alberto
author_role author
author2 Pastor Moreno, Rafael
García Villoria, Alberto
author2_role author
author
dc.contributor.none.fl_str_mv Aguilar Gamarra, Harry - Nick
Curator 240(MR)
dc.subject.none.fl_str_mv Engineering
Instances
Parallel assembly lines balancing problem
Buffer sizing problem
topic Engineering
Instances
Parallel assembly lines balancing problem
Buffer sizing problem
description Instances used in the computational experiment of the paper: Heuristic and metaheuristic procedures for the buffer sizing problem in Parallel Assembly Lines Balancing Problem with multi-line workstations and different cycle times. This research paper focuses on the buffer sizing problem in the parallel assembly lines balancing problem with multiline workstations (PALBP) and lines with different cycle times. This paper presents different non-exact procedures to solve the buffer sizing problem in the PALBP with lines with different cycle times in a viable computation time. A computational experiment was carried out to evaluate the performance of the proposed procedures. Due to the novelty of the problem to be solved, to carry out the computational experiment, 120 instances have been generated from 8 precedence graphs. The files attached here contain all the instances used in the computational experiment. Each instance contains the necessary data to be executed.
publishDate 2023
dc.date.none.fl_str_mv 2023
dc.type.none.fl_str_mv info:eu-repo/semantics/dataset
format dataset
dc.identifier.none.fl_str_mv https://doi.org/10.34810/DATA672
url https://doi.org/10.34810/DATA672
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
CC0 1.0
eu_rights_str_mv openAccess
rights_invalid_str_mv CC0 1.0
dc.publisher.none.fl_str_mv CORA.Repositori de Dades de Recerca
publisher.none.fl_str_mv CORA.Repositori de Dades de Recerca
dc.source.none.fl_str_mv reponame:CORA.Repositori de Dades de Recerca
instname:Consorci de Serveis Universitaris de Catalunya (CSUC)
instname_str Consorci de Serveis Universitaris de Catalunya (CSUC)
reponame_str CORA.Repositori de Dades de Recerca
collection CORA.Repositori de Dades de Recerca
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419286803513344
score 15,81155

Similares en LA Referencia