Artículo
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation
Autor/es | Talens Fayos, Carla
Pérez González, Paz Fernández-Viagas Escudero, Víctor Framiñán Torres, José Manuel |
Departamento | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Fecha de publicación | 2021-08 |
Fecha de depósito | 2021-05-25 |
Publicado en |
|
Resumen | The assembly scheduling problem is a common layout with many applications in real manufacturing scenarios. Despite the high number of studies dealing with this problem, no benchmark has been proposed up-to-now in the ... The assembly scheduling problem is a common layout with many applications in real manufacturing scenarios. Despite the high number of studies dealing with this problem, no benchmark has been proposed up-to-now in the literature generating neither hard nor balanced instances. In this paper we present two extensive sets of instances for two variants of the 2-stage assembly scheduling problem. The first set is composed of 240 instances for the variant with one assembly machine in the second stage, while in the second set 960 instances are proposed for the variant with several assembly machines. An exhaustive experimental procedure, generating several preliminary testbeds with different processing times and number of jobs and machines, is carried out in order to identify the most representative instances of the problem under study. A total of 120,000 instances are generated and, among them, 1,200 are selected ensuring that the new benchmarks satisfy the desired characteristics of any benchmark: adequacy, empirical hardness, exhaustiveness, and amenity for statistical analysis. Finally, two computational evaluations are performed comparing and evaluating the existing heuristics in the literature, thus establishing the set of efficient heuristics for this assembly problem. |
Agencias financiadoras | Ministerio de Ciencia e Innovación (MICIN). España Junta de Andalucía |
Identificador del proyecto | DPI2016-80750-P
US-1264511 |
Cita | Talens Fayos, C., Pérez González, P., Fernández-Viagas Escudero, V. y Framiñán Torres, J.M. (2021). New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation. Computers & Industrial Engineering, 158, Document number 107364. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Manuscript Unmarked Text.pdf | 766.1Kb | [PDF] | Ver/ | Version Aceptada Artículo |
Este registro aparece en las siguientes colecciones
Este documento está protegido por los derechos de propiedad intelectual e industrial. Sin perjuicio de las exenciones legales existentes, queda prohibida su reproducción, distribución, comunicación pública o transformación sin la autorización del titular de los derechos, a menos que se indique lo contrario.