Mostrar el registro sencillo del ítem

dc.contributor.authorViloria, Amelecspa
dc.contributor.authorVarela, Noelspa
dc.contributor.authorHerazo-Beltran, Carlosspa
dc.contributor.authorPineda Lezama, Omar Bonergespa
dc.contributor.authorMercado, Albertospa
dc.contributor.authorMartinez Ventura, Jairospa
dc.contributor.authorHernandez Palma, Hugospa
dc.date.accessioned2021-01-15T21:46:36Z
dc.date.available2021-01-15T21:46:36Z
dc.date.issued2021
dc.identifier.urihttps://hdl.handle.net/11323/7704spa
dc.description.abstractOne of the main problems faced by manufacturing companies in the production sequencing, also called scheduling, which consists of identifying the best way to order the production program on the machines for improving efficiency. This paper presents the integration of a simulation model with an optimization method to solve the problem of dynamic programming with stochastic demand.spa
dc.format.mimetypeapplication/pdfspa
dc.language.isoeng
dc.publisherCorporación Universidad de la Costaspa
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internationalspa
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/spa
dc.sourceAdvances in Intelligent Systems and Computingspa
dc.subjectSimulationspa
dc.subjectProgrammingspa
dc.subjectDynamic sequencingspa
dc.subjectJob shopspa
dc.subjectStochastic demandspa
dc.titleGenetic system for project support with the sequencing problemspa
dc.typeArtículo de revistaspa
dc.source.urlhttps://link.springer.com/chapter/10.1007/978-981-15-7234-0_93spa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.identifier.doihttps://doi.org/10.1007/978-981-15-7234-0_93spa
dc.identifier.instnameCorporación Universidad de la Costaspa
dc.identifier.reponameREDICUC - Repositorio CUCspa
dc.identifier.repourlhttps://repositorio.cuc.edu.co/spa
dc.relation.references1. Iassinovski S, Artiba A, Bachelet V (2003) Integration of simulation and optimization for solving complex decision-making problems. Int J Prod Econ 85(1): 3–10.spa
dc.relation.references2. Hamid M, Hamid M, Musavi M, Azadeh A (2019) Scheduling elective patients based on sequence-dependent setup times in an open-heart surgical department using an optimization and simulation approach. Simulation 95(12):1141–1164spa
dc.relation.references3. Zhang B, Yi L-X, Xiao S (2005) Study of stochastic job shop dynamic scheduling. In: Proceedings of the fourth international conference on machine learning and cybernetics, Guangzhou, China, pp 18–21spa
dc.relation.references4. Zhang B, Xu L, Zhang J (2020) A multi-objective cellular genetic algorithm for energy-oriented balancing and sequencing problem of mixed-model assembly line. J Clean Prod 244:118845spa
dc.relation.references5. Banks J (2000) Introduction to simulation. In: Proceedings of the winter simulation conference, Orlando, FL, USAspa
dc.relation.references6. Mohammadi A, Asadi H, Mohamed S, Nelson K, Nahavandi S (2018) Optimizing model predictive control horizons using genetic algorithm for motion cueing algorithm. Expert Syst Appl 92:73–81spa
dc.relation.references7. Keshanchi B, Souri A, Navimipour NJ (2017) An improved genetic algorithm for task scheduling in the cloud environments using the priority queues: formal verification, simulation, and statistical testing. J Syst Softw 124:1–21spa
dc.relation.references8. Silva EB, Costa MG, Silva MFS (2014) Simulation study of dispatching rules in stochastic job shop dynamic scheduling. World J Modell Simul 10(3):231–240.spa
dc.relation.references9. Mosadegh H, Ghomi SF, Süer GA (2020) Stochastic mixed-model assembly line sequencing problem: Mathematical modeling and Q-learning based simulated annealing hyper-heuristics. Eur J Oper Res 282(2):530–544spa
dc.relation.references10. Leal F, Costa RFS, Montevechi JAB (2011) A practical guide for operational validation of discrete simulation models. Pesquisa Operacional 31(1):57–77.spa
dc.relation.references11. Kelton WD, Sadowski RP, Sadowski DA (2000) Simulation with ARENA, 2nd edn. McGraw Hill, Boston, USA, pp 385–396. ISBN: 978-0071122399spa
dc.relation.references12. Mitchell TM (1997) Machine learning, 1st edn. McGraw-Hill, New York, USA, pp 249–273.spa
dc.relation.references13. Wall M (1996) GALIB: A C++ library of genetic algorithm components. Mechanical Engineering Departament, Massachussetts Institute of Technology.spa
dc.relation.references14. Seghir F, Khababa A (2018) A hybrid approach using genetic and fruit fly optimization algorithms for QoS-aware cloud service composition. J Intell Manuf 29(8):1773–1792spa
dc.relation.references15. Rauf M, Guan Z, Sarfraz S, Mumtaz J, Shehab E, Jahanzaib M, Hanif M (2020) A smart algorithm for multi-criteria optimization of model sequencing problem in assembly lines. Robot Comput Integr Manuf 61:101844spa
dc.relation.references16. Kumar M, Khatak P (2020) Development of a discretization methodology for 2.5 D milling toolpath optimization using genetic algorithm. In: Advances in computing and intelligent systems. Springer, Singapore, pp 93–104spa
dc.relation.references17. Rajagopalan A, Modale DR, Senthilkumar R (2020) Optimal scheduling of tasks in cloud computing using hybrid firefly-genetic algorithm. In: Advances in decision sciences, image processing, security and computer vision. Springer, Cham, pp 678–687spa
dc.relation.references18. Rekha PM, Dakshayini M (2019) Efficient task allocation approach using genetic algorithm for cloud environment. Cluster Comput 22(4):1241–1251spa
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
dc.type.versioninfo:eu-repo/semantics/acceptedVersionspa
dc.type.coarversionhttp://purl.org/coar/version/c_ab4af688f83e57aaspa
dc.rights.coarhttp://purl.org/coar/access_right/c_abf2spa


Ficheros en el ítem

Thumbnail
Thumbnail

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

  • Artículos científicos [3156]
    Artículos de investigación publicados por miembros de la comunidad universitaria.

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 International
Excepto si se señala otra cosa, la licencia del ítem se describe como Attribution-NonCommercial-NoDerivatives 4.0 International