Can Akkan

16 papers B 1Journal 15
YearRankTypeTitle / Venue / Authors
2023 J jnl
Novel Surrogate Measures Based on a Similarity Network for Neural Architecture Search.
IEEE Access
Zeki Kus, Can Akkan, Ayla Gülcü
2022 J jnl
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation.
J. Sched.
Can Akkan, Ayla Gülcü, Zeki Kus
2021 J jnl
Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions.
Comput. Oper. Res.
Can Akkan, Ayla Gülcü, Zeki Kus
2020 J jnl
Robust university course timetabling problem subject to single and multiple disruptions.
Eur. J. Oper. Res.
Ayla Gülcü, Can Akkan
2020 B conf
Search Space Sampling by Simulated Annealing for Identifying Robust Solutions in Course Timetabling.
CEC
Can Akkan, Ayla Gülcü, Zeki Kus
2019 J jnl
Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure.
Ann. Oper. Res.
Gülcin Ermis, Can Akkan
2018 J jnl
A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem.
Comput. Oper. Res.
Can Akkan, Ayla Gülcü
2016 J jnl
A system for pricing the sales distribution from blockbusters to the long tail.
Decis. Support Syst.
Cenk Koças, Can Akkan
2016 J jnl
Finding robust timetables for project presentations of student teams.
Eur. J. Oper. Res.
Can Akkan, M. Erdem Külünk, Cenk Koças
2016 J jnl
How Trending Status and Online Ratings Affect Prices of Homogeneous Products.
Int. J. Electron. Commer.
Cenk Kocas, Can Akkan
2015 J jnl
Improving schedule stability in single-machine rescheduling for new operation insertion.
Comput. Oper. Res.
Can Akkan
2006 J jnl
Minimizing sum of completion times on a single machine with sequence-dependent family setup times.
J. Oper. Res. Soc.
Selçuk Karabati, Can Akkan
2005 J jnl
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming.
J. Log. Algebraic Methods Program.
Can Akkan, Andreas Drexl, Alf Kimms
2005 J jnl
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem.
Eur. J. Oper. Res.
Can Akkan, Andreas Drexl, Alf Kimms
2004 J jnl
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm.
Eur. J. Oper. Res.
Can Akkan, Selçuk Karabati
1997 J jnl
Finite-capacity scheduling-based planning for revenue-based capacity management.
Eur. J. Oper. Res.
Can Akkan