Hande Öztop

15 papers A 1B 2Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
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
2022 J jnl
Two-sided disassembly line balancing problem with sequence-dependent setup time: A constraint programming model and artificial bee colony algorithm.
Expert Syst. Appl.
Zeynel Abidin Çil, Damla Kizilay, Zixiang Li, Hande Öztop
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 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
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
2019 — conf
A Variable Block Insertion Heuristic for Single Machine with Release Dates and Sequence Dependent Setup Times for Makespan Minimization.
SSCI
Jiaxin Fan, Damla Kizilay, Hande Öztop, Mehmet Fatih Tasgetiren, Liang Gao
2019 J jnl
Metaheuristic algorithms for the hybrid flowshop scheduling problem.
Comput. Oper. Res.
Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan
2018 — conf
An energy-efficient single machine scheduling with release dates and sequence-dependent setup times.
GECCO (Companion)
Mehmet Fatih Tasgetiren, Ugur Eliiyi, Hande Öztop, Damla Kizilay, Quan-Ke Pan
2018 — conf
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times.
ICIC (1)
Mehmet Fatih Tasgetiren, Hande Öztop, Ugur Eliiyi, Deniz Türsel Eliiyi, Quan-Ke Pan
2018 — conf
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time.
ICIC (3)
Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan
2018 A conf
Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization.
GECCO
Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan