Mostrar el registro sencillo del ítem

dc.contributor.authorHERNANDEZ SUAREZ, CESAR AUGUSTO
dc.contributor.authorPrada Nuñez, Raul
dc.contributor.authorPrada, R
dc.date.accessioned2021-11-14T23:43:10Z
dc.date.available2021-11-14T23:43:10Z
dc.date.issued2019-02-13
dc.identifier.urihttp://repositorio.ufps.edu.co/handle/ufps/982
dc.description.abstractProduction programming consists of assigning, sequencing and timing tasks leading to the acquisition of physical assets in productive resources. Normally, we talk about "jobs" to be sequenced in "machines" so that the result of the production programming is shown in the form of a Gantt chart where each job is divided into as many tasks as necessary and each task is executed in the machines of the factory as technologically necessary. In the productive reality several machines are observed in each stage of the production process, which suggests a problem of hybrid flow workshop type (HFS). However, in some companies a machine of each stage is joined by conveyor belts. All these machines would behave like a single virtual machine since the works enter in order in the first machine and that order is maintained until the last machine, without allowing neither stops nor changes in the sequence. Then in a modelling approach, it is suggested to reduce the problem of (HFS) to a problem with several production lines in parallel where each line would behave would be basically like a virtual machine. The problem is that since the line is so long, once the last element of a job leaves the first stage, it can start the processing of a new job while the first sequenced work moves through the production line. Effectively, the "parallel machine" modelling the line would be processing more than one job at the same time, that is, overlaps between the processed jobs are evident. The model is evaluated with the help of two of the commercial solvers and to be able to evaluate it, it was necessary to create a set of instances that would represent the situation under study.eng
dc.format.extent7 páginasspa
dc.format.mimetypeapplication/pdfspa
dc.language.isoengspa
dc.publisherJournal of Physics: Conference Seriesspa
dc.relation.ispartofJournal of Physics: Conference Series ISSN: 1742-6596, 2019 vol:1160 fasc: 1 págs: 1 - 7
dc.rightsContent from this work may be used under the terms of theCreative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI. Published under licence by IOP Publishing Ltdeng
dc.sourcehttps://iopscience.iop.org/article/10.1088/1742-6596/1160/1/012017spa
dc.titleProblems of production lines in parallel machines with lapses: Mathematical modellingeng
dc.typeArtículo de revistaspa
dcterms.referencesFraminan JM, Leisten R and García RR 2014 Manufacturing scheduling systems: An Integrated view on models, methods and tools (London: Springer-Verlag) Chapter 3 pp 51-63spa
dcterms.referencesJohnson LA and Montgomery DC 1974 Operations research in production planning, scheduling, and inventory control (New York: Wiley)spa
dcterms.referencesPinedo M L 2009 Planning and scheduling in manufacturing and services second edition (New York: Springer-Verlag)spa
dcterms.referencesNúñez RP 2016 Problemas de líneas de producción como secuenciación en máquinas paralelas con solapes. Revisión del estado del arte y modelado matemático (Valencia: Universidad Politécnica de Valencia)spa
dcterms.referencesGraham RL, Lawler EL, Lenstra JK and Kan AR 1979 Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 287-326spa
dcterms.referencesFanjul-Peyro L and Ruiz R 2010 Iterated greedy local search methods for unrelated parallel machine scheduling European Journal of Operational Research 207 55-69spa
dcterms.referencesUnlu Y and Mason SJ 2010 Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems Computers & Industrial Engineering 58 785-800spa
dcterms.referencesVallada E and Ruiz R 2011 A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times European Journal of Operational Research 211 612-22spa
dcterms.referencesJiménez AP 2012 Solución del problema de programación de flow-shop flexible empleando el algoritmo genético de Chu-Beasley (Pereira: Universidad Tecnológica de Pereira)spa
dcterms.referencesRuiz R 2003 Metaheuristic techniques for flexible production scheduling (Valencia: Universidad Politécnica de Valencia)spa
dcterms.referencesUrlings T 2010 Heuristics and metaheuristics for heavily constrained hybrid flowshop problems (Valencia: Polytechnic University of Valencia)spa
dcterms.referencesVallada E 2007 Sequencing in flow workshops with delivery dates. New metaheuristic methods and parallel computing (Valencia: Polytechnic University of Valencia)spa
dcterms.referencesMontgomery DC 2012 Design and analysis of experiments eighth edition (New Jersey: John Wiley & Sons)spa
dc.identifier.doi10.1088/1742-6596/1160/1/012017
dc.relation.citationeditionVol. 1160, (2019) 012017spa
dc.relation.citationendpage7spa
dc.relation.citationstartpage1spa
dc.relation.citationvolume1160spa
dc.relation.citesR Prada et al 2019 J. Phys.: Conf. Ser. 1160 012017
dc.relation.ispartofjournalJournal of Physics: Conference Seriesspa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.rights.creativecommonsAtribución 4.0 Internacional (CC BY 4.0)spa
dc.type.coarhttp://purl.org/coar/resource_type/c_6501spa
dc.type.contentTextspa
dc.type.driverinfo:eu-repo/semantics/articlespa
dc.type.redcolhttp://purl.org/redcol/resource_type/ARTspa
oaire.accessrightshttp://purl.org/coar/access_right/c_abf2spa
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85spa
dc.type.versioninfo:eu-repo/semantics/publishedVersionspa


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem