Levent Kandiller

Orcid: 0000-0002-7300-5561

According to our database1, Levent Kandiller authored at least 15 papers between 1998 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion.
Comput. Oper. Res., 2022

An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times.
Comput. Oper. Res., 2022

An evolution strategy approach for the distributed blocking flowshop scheduling problem.
Comput. Ind. Eng., 2022

2021
Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach.
Comput. Oper. Res., 2021

2020
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption.
Swarm Evol. Comput., 2020

An energy-efficient permutation flowshop scheduling problem.
Expert Syst. Appl., 2020

An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption.
Comput. Ind. Eng., 2020

Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Differential Evolution Algorithm with Q-Learning for Solving Engineering Design Problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2019

2017
An alternative MILP model for makespan minimization on assembly lines.
Optim. Lett., 2017

2015
A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution.
Proceedings of the Operations Research Proceedings 2015, 2015

2006
Semi-dynamic modelling of heterogeneous land combat.
J. Oper. Res. Soc., 2006

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


  Loading...