Finite-capacity scheduling-based planning for revenue-based capacity management. - Can Akkan (Eur. J. Oper. Res., 1997)

The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. - Can Akkan; Selçuk Karabati (Eur. J. Oper. Res., 2004)

Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. - Can Akkan; Andreas Drexl; Alf Kimms (Eur. J. Oper. Res., 2005)

Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming. - Can Akkan; Andreas Drexl; Alf Kimms (J. Log. Algebraic Methods Program., 2005)

Minimizing sum of completion times on a single machine with sequence-dependent family setup times. - Selçuk Karabati; Can Akkan (J. Oper. Res. Soc., 2006)

Improving schedule stability in single-machine rescheduling for new operation insertion. - Can Akkan (Comput. Oper. Res., 2015)

A system for pricing the sales distribution from blockbusters to the long tail. - Cenk Koças; Can Akkan (Decis. Support Syst., 2016)

Finding robust timetables for project presentations of student teams. - Can Akkan; M. Erdem Külünk; Cenk Koças (Eur. J. Oper. Res., 2016)

How Trending Status and Online Ratings Affect Prices of Homogeneous Products. - Cenk Kocas; Can Akkan (Int. J. Electron. Commer., 2016)

A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. - Can Akkan; Ayla Gülcü (Comput. Oper. Res., 2018)

Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure. - Gülcin Ermis; Can Akkan (Ann. Oper. Res., 2019)

Search Space Sampling by Simulated Annealing for Identifying Robust Solutions in Course Timetabling. - Can Akkan; Ayla Gülcü; Zeki Kus (CEC, 2020)

Robust university course timetabling problem subject to single and multiple disruptions. - Ayla Gülcü; Can Akkan (Eur. J. Oper. Res., 2020)

Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions. - Can Akkan; Ayla Gülcü; Zeki Kus (Comput. Oper. Res., 2021)

Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation. - Can Akkan; Ayla Gülcü; Zeki Kus (J. Sched., 2022)

Novel Surrogate Measures Based on a Similarity Network for Neural Architecture Search. - Zeki Kus; Can Akkan; Ayla Gülcü (IEEE Access, 2023)