Hande Öztop

According to our database, Hande Öztop authored at least 15 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Two-sided disassembly line balancing problem with sequence-dependent setup time: A constraint programming model and artificial bee colony algorithm.

Zeynel Abidin Çil, Damla Kizilay, Zixiang Li, Hande Öztop

Expert Syst. Appl., 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

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

2021

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

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

Swarm Evol. Comput., 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

A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling.

Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan

Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Differential Evolution Algorithm with Q-Learning for Solving Engineering Design Problems.

Damla Kizilay, Mehmet Fatih Tasgetiren, Hande Öztop, Levent Kandiller, Ponnuthurai N. Suganthan

Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019

Metaheuristic algorithms for the hybrid flowshop scheduling problem.

Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan

Comput. Oper. Res., 2019

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

Proceedings of the IEEE Symposium Series on Computational Intelligence, 2019

A Variable Block Insertion Heuristic for Single Machine with Release Dates and Sequence Dependent Setup Times for Makespan Minimization.

Jiaxin Fan, Damla Kizilay, Hande Öztop, Mehmet Fatih Tasgetiren, Liang Gao

Proceedings of the IEEE Symposium Series on Computational Intelligence, 2019

2018

Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times.

Mehmet Fatih Tasgetiren, Hande Öztop, Ugur Eliiyi, Deniz Türsel Eliiyi, Quan-Ke Pan

Proceedings of the Intelligent Computing Theories and Application, 2018

Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time.

Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan

Proceedings of the Intelligent Computing Methodologies - 14th International Conference, 2018

An energy-efficient single machine scheduling with release dates and sequence-dependent setup times.

Mehmet Fatih Tasgetiren, Ugur Eliiyi, Hande Öztop, Damla Kizilay, Quan-Ke Pan

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization.

Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan

Proceedings of the Genetic and Evolutionary Computation Conference, 2018