Levent Kandiller

18 papers B 3Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Production planning in turkey breeding supply chains: A new model with simultaneous consideration of harvest plan and inventory decisions.
Eng. Appl. Artif. Intell.
Nazli Karatas Aygün, Levent Kandiller, Önder Bulut
2024 J jnl
A constraint programming approach to a real-world workforce scheduling problem for multi-manned assembly lines with sequence-dependent setup times.
Int. J. Prod. Res.
Funda Güner, Abdül Kadir Görür, Benhür Satir, Levent Kandiller, John H. Drake
2024 J jnl
Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops.
Swarm Evol. Comput.
Damla Yüksel, Levent Kandiller, Mehmet Fatih Tasgetiren
2022 J jnl
An evolution strategy approach for the distributed blocking flowshop scheduling problem.
Comput. Ind. Eng.
Korhan Karabulut, Damla Kizilay, Mehmet Fatih Tasgetiren, Liang Gao, Levent Kandiller
2022 J jnl
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times.
Comput. Oper. Res.
Korhan Karabulut, Hande Öztop, Damla Kizilay, Mehmet Fatih Tasgetiren, Levent Kandiller
2022 J jnl
Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion.
Comput. Oper. Res.
Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan
2021 J jnl
Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach.
Comput. Oper. Res.
Korhan Karabulut, Hande Öztop, Levent Kandiller, Mehmet Fatih Tasgetiren
2020 B conf
A Differential Evolution Algorithm with Q-Learning for Solving Engineering Design Problems.
CEC
Damla Kizilay, Mehmet Fatih Tasgetiren, Hande Öztop, Levent Kandiller, Ponnuthurai N. Suganthan
2020 B conf
A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling.
CEC
Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan
2020 J jnl
An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption.
Comput. Ind. Eng.
Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Liang Gao
2020 J jnl
An energy-efficient permutation flowshop scheduling problem.
Expert Syst. Appl.
Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan, Levent Kandiller
2020 J jnl
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption.
Swarm Evol. Comput.
Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Deniz Türsel Eliiyi, Liang Gao
2020 B conf
Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption.
CEC
Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan
2019 — conf
A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion.
SSCI
Liangshan Shen, Mehmet Fatih Tasgetiren, Hande Öztop, Levent Kandiller, Liang Gao
2017 J jnl
An alternative MILP model for makespan minimization on assembly lines.
Optim. Lett.
Sel Özcan, Deniz Türsel Eliiyi, Levent Kandiller
2015 — conf
A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution.
OR
Levent Kandiller, Deniz Türsel Eliiyi, Bahar Tasar
2006 J jnl
Semi-dynamic modelling of heterogeneous land combat.
J. Oper. Res. Soc.
Nur Evin Özdemirel, Levent Kandiller
1998 J jnl
A cell formation algorithm: Hypergraph approximation - Cut tree.
Eur. J. Oper. Res.
Levent Kandiller