A cell formation algorithm: Hypergraph approximation - Cut tree. - Levent Kandiller (Eur. J. Oper. Res., 1998)

Semi-dynamic modelling of heterogeneous land combat. - Nur Evin Özdemirel; Levent Kandiller (J. Oper. Res. Soc., 2006)

A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution. - Levent Kandiller; Deniz Türsel Eliiyi; Bahar Tasar (OR, 2015)

An alternative MILP model for makespan minimization on assembly lines. - Sel Özcan; Deniz Türsel Eliiyi; Levent Kandiller (Optim. Lett., 2017)

A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion. - Liangshan Shen; Mehmet Fatih Tasgetiren; Hande Öztop; Levent Kandiller; Liang Gao 001 (SSCI, 2019)

A Differential Evolution Algorithm with Q-Learning for Solving Engineering Design Problems. - Damla Kizilay; Mehmet Fatih Tasgetiren; Hande Öztop; Levent Kandiller; Ponnuthurai N. Suganthan (CEC, 2020)

A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling. - Hande Öztop; Mehmet Fatih Tasgetiren; Levent Kandiller; Quan-Ke Pan (CEC, 2020)

Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption. - Damla Yüksel; Mehmet Fatih Tasgetiren; Levent Kandiller; Quan-Ke Pan (CEC, 2020)

An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption. - Damla Yüksel; Mehmet Fatih Tasgetiren; Levent Kandiller; Liang Gao 001 (Comput. Ind. Eng., 2020)

An energy-efficient permutation flowshop scheduling problem. - Hande Öztop; Mehmet Fatih Tasgetiren; Deniz Türsel Eliiyi; Quan-Ke Pan; Levent Kandiller (Expert Syst. Appl., 2020)

Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption. - Hande Öztop; Mehmet Fatih Tasgetiren; Levent Kandiller; Deniz Türsel Eliiyi; Liang Gao 001 (Swarm Evol. Comput., 2020)

Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach. - Korhan Karabulut; Hande Öztop; Levent Kandiller; Mehmet Fatih Tasgetiren (Comput. Oper. Res., 2021)

An evolution strategy approach for the distributed blocking flowshop scheduling problem. - Korhan Karabulut; Damla Kizilay; Mehmet Fatih Tasgetiren; Liang Gao 001; Levent Kandiller (Comput. Ind. Eng., 2022)

An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. - Korhan Karabulut; Hande Öztop; Damla Kizilay; Mehmet Fatih Tasgetiren; Levent Kandiller (Comput. Oper. Res., 2022)

Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. - Hande Öztop; Mehmet Fatih Tasgetiren; Levent Kandiller; Quan-Ke Pan (Comput. Oper. Res., 2022)

A constraint programming approach to a real-world workforce scheduling problem for multi-manned assembly lines with sequence-dependent setup times. - Funda Güner; Abdül Kadir Görür; Benhür Satir; Levent Kandiller; John H. Drake (Int. J. Prod. Res., 2024)

Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops. - Damla Yüksel; Levent Kandiller; Mehmet Fatih Tasgetiren (Swarm Evol. Comput., 2024)