Artículos con órdenes de acceso público - Mehmet Fatih TasgetirenMás información
No disponible en ningún lugar: 1
A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
Y Li, X Li, L Gao, B Zhang, QK Pan, MF Tasgetiren, L Meng
International Journal of Production Research 59 (13), 3880-3899, 2021
Órdenes: National Natural Science Foundation of China
Rechazados: 17
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion
KZ Gao, PN Suganthan, QK Pan, MF Tasgetiren, A Sadollah
Knowledge-based systems 109, 1-16, 2016
Órdenes: National Natural Science Foundation of China
Autores responsables: KZ Gao, QK Pan, A Sadollah, PN Suganthan
Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm
G Wang, L Gao, X Li, P Li, MF Tasgetiren
Swarm and Evolutionary Computation 57, 100716, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: L Gao, G Wang
Metaheuristic algorithms for the hybrid flowshop scheduling problem
H Öztop, MF Tasgetiren, DT Eliiyi, QK Pan
Computers & Operations Research 111, 177-196, 2019
Órdenes: National Natural Science Foundation of China
Autores responsables: QK Pan
An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop
WQ Zou, QK Pan, MF Tasgetiren
Applied Soft Computing 99, 106945, 2021
Órdenes: National Natural Science Foundation of China
Autores responsables: QK Pan, WQ Zou
An energy-efficient permutation flowshop scheduling problem
H Öztop, MF Tasgetiren, DT Eliiyi, QK Pan, L Kandiller
Expert systems with applications 150, 113279, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: QK Pan
An adaptive iterated greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
YZ Li, QK Pan, JQ Li, L Gao, MF Tasgetiren
Swarm and Evolutionary Computation 63, 100874, 2021
Órdenes: National Natural Science Foundation of China
Autores responsables: L Gao, JQ Li, YZ Li, QK Pan
An evolution strategy approach to the team orienteering problem with time windows
K Karabulut, MF Tasgetiren
Computers & Industrial Engineering 139, 106109, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: K Karabulut
Multi-performance based computational model for the cuboid open traveling salesman problem in a smart floating city
A Kirimtat, O Krejcar, MF Tasgetiren, E Herrera-Viedma
Building and Environment 196, 107721, 2021
Órdenes: Gobierno de España
Autores responsables: E Herrera-Viedma
An improved discrete artificial bee colony algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance
J Mao, XL Hu, Q Pan, Z Miao, C He, MF Tasgetiren
2020 39th Chinese Control Conference (CCC), 1679-1684, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: C He, XL Hu, J Mao, Z Miao, Q Pan
An iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime
J Mao, XL Hu, Q Pan, Z Miao, C He, MF Tasgetiren
2020 39th Chinese Control Conference (CCC), 1507-1512, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: C He, XL Hu, J Mao, Z Miao, Q Pan
An iterated greedy algorithm for distributed blocking flowshop problems with makespan minimization
S Chen, Q Pan, XL Hu, MF Tasgetiren
2020 39th Chinese Control Conference (CCC), 1536-1541, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: S Chen, XL Hu, Q Pan
A general variable neighborhood search for the noIdle flowshop scheduling problem with makespan criterion
L Shen, MF Tasgetiren, H Öztop, L Kandiller, L Gao
2019 IEEE Symposium Series on Computational Intelligence (SSCI), 1684-1691, 2019
Órdenes: National Natural Science Foundation of China
Autores responsables: L Gao, L Shen
Differential evolution through variable neighborhood search for constrained real-parameter optimization problems
S Wang, J Kang, MF Tasgetiren, L Gao, D Kizilay
2019 IEEE Symposium Series on Computational Intelligence (SSCI), 2252-2260, 2019
Órdenes: National Natural Science Foundation of China
Autores responsables: L Gao, J Kang, D Kizilay, S Wang
A variable block insertion heuristic for single machine with release dates and sequence dependent setup times for makespan minimization
J Fan, D Kizilay, H Öztop, MF Tasgetiren, L Gao
2019 IEEE Symposium Series on Computational Intelligence (SSCI), 1676-1683, 2019
Órdenes: National Natural Science Foundation of China
Autores responsables: J Fan, L Gao
NEH-Based heuristics for the distributed blocking flowshop with makespan criterion
S Chen, Q Pan, XL Hu, MF Tasgetiren
2020 39th Chinese Control Conference (CCC), 1710-1715, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: S Chen, XL Hu, Q Pan
An iterated local search algorithm for distributed assembly permutation flowshop problem
YY Huang, Q Pan, XL Hu, MF Tasgetiren, J Huang
2020 39th Chinese Control Conference (CCC), 1548-1552, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: XL Hu, J Huang, YY Huang, Q Pan
A New Heuristic for PCBs Grouping Problem with Setup Times
JP Huang, QK Pan, MF Tasgetiren, YY Huang
2020 39th Chinese Control Conference (CCC), 1495-1500, 2020
Órdenes: National Natural Science Foundation of China
Autores responsables: JP Huang, YY Huang, QK Pan
Disponibles en algún lugar: 13
Future trends and current state of smart city concepts: A survey
A Kirimtat, O Krejcar, A Kertesz, MF Tasgetiren
IEEE access 8, 86448-86467, 2020
Órdenes: Hungarian Scientific Research Fund, European Commission
An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
KZ Gao, PN Suganthan, QK Pan, MF Tasgetiren
International Journal of Production Research 53 (19), 5896-5911, 2015
Órdenes: National Natural Science Foundation of China, A*Star, Singapore
La información de publicación y financiación se determina de forma automática mediante un programa informático