Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Shengxian Xie"'
Publikováno v:
Applied Mathematics and Computation. 218:9353-9371
In this paper, we propose a hybrid shuffled frog-leaping algorithm (HSFLA) for solving the multi-objective flexible job shop scheduling problem. Three minimization objectives – the maximum completion time (makespan), the total workload of all machi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be37a44ab78bc433f7e05b7ed7a09cd1
https://doi.org/10.1016/j.amc.2012.03.018
https://doi.org/10.1016/j.amc.2012.03.018
Publikováno v:
International Journal of Advancements in Computing Technology. 3:62-69
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::238a21753d1209c90dd6c2c31433236e
https://doi.org/10.4156/ijact.vol3.issue5.7
https://doi.org/10.4156/ijact.vol3.issue5.7
Publikováno v:
Computer Science and Information Systems. 7:907-930
In this paper, we propose a novel hybrid variable neighborhood search algorithm combining with the genetic algorithm (VNS+GA) for solving the multi-objective flexible job shop scheduling problems (FJSPs) to minimize the makespan, the total workload o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::583327fb96aeb6991152abc8c112b486
https://doi.org/10.2298/csis090608017l
https://doi.org/10.2298/csis090608017l
Publikováno v:
International Journal of Computer Theory and Engineering. :189-194
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad10fa53dd03cf2f0dfd25ab561f090f
https://doi.org/10.7763/ijcte.2010.v2.139
https://doi.org/10.7763/ijcte.2010.v2.139
Publikováno v:
2012 IEEE 14th International Conference on Communication Technology.
The compression function is wildly used via many kinds of iterations in the construction of the modern hash function intended for use with standard digital signatures following the hash-and-sign mode. Some variants of second-preimage resistance(SPR)[
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1bc16ab71435c7ee1dc43c33b7eea61
https://doi.org/10.1109/icct.2012.6511314
https://doi.org/10.1109/icct.2012.6511314
Publikováno v:
Anti-counterfeiting, Security, and Identification.
Some variants of second-preimage resistance(SPR)[1] assumptions of the keyless compression function, called c-SPR, r-SPR and e-SPR, have been put forth by Halevi and Krawczyk[2], in order to obtain more secure properties for the dedicated-key hash fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53ffeec8d710416995d2971abeee8f55
https://doi.org/10.1109/icasid.2012.6325283
https://doi.org/10.1109/icasid.2012.6325283
Publikováno v:
2012 24th Chinese Control and Decision Conference (CCDC).
In this study, we propose a genetic algorithm for solving the job-shop scheduling problem with fuzzy makespan. The solution in the proposed algorithm is represented by a string of discrete values. The crossover and mutation operators are designed to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3809bd58bfc2f410d5b219cf371096c5
https://doi.org/10.1109/ccdc.2012.6244513
https://doi.org/10.1109/ccdc.2012.6244513
Publikováno v:
2011 International Conference on System science, Engineering design and Manufacturing informatization.
In recent years, there is a growing interest on the research and deployment of MANET(Mobile Ad Hoc Networks) technology for vehicular communication. Routing is crucial to the success of VANET(Vehicular Ad hoc Networks) applications, which is complica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d2618b00f2c5437a728bb7eb522d86e
https://doi.org/10.1109/icssem.2011.6081315
https://doi.org/10.1109/icssem.2011.6081315
Publikováno v:
2011 IEEE 2nd International Conference on Software Engineering and Service Science.
Energy Consumption Interaction Automata (ECIA) is presented to model cyber-physical systems' interaction behavior and energy consumption constraint information. The component-interaction automata is an excellent model for specifying architecture and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92c2afc16276edc64c75495e8b633884
https://doi.org/10.1109/icsess.2011.5982376
https://doi.org/10.1109/icsess.2011.5982376
Publikováno v:
IEEE Congress on Evolutionary Computation
In this paper, an effective artificial bee colony (ABC) algorithm is proposed for solving the flexible job shop scheduling problems. The total flow time criterion was considered. In the proposed algorithm, tabu search (TS) heuristic is introduced to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cae9b4b453abd0e240c891bccf45b2c
https://doi.org/10.1109/cec.2011.5949601
https://doi.org/10.1109/cec.2011.5949601