Can Akkan

Publication Activity (10 Years)

Years Active: 1997-2023
Publications (10 Years): 10

Top Topics

Timetabling Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Decis. Support Syst.

Ann. Oper. Res.

Publications

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