Can Akkan

Available identifiers

Publication	Date of Publication	Type
Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions	2022-03-07	Paper
Robust university course timetabling problem subject to single and multiple disruptions	2020-01-23	Paper
Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure	2019-03-06	Paper
A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem	2018-07-11	Paper
Improving schedule stability in single-machine rescheduling for new operation insertion	2016-11-17	Paper
Finding robust timetables for project presentations of student teams	2016-10-07	Paper
Minimizing sum of completion times on a single machine with sequence-dependent family setup times	2006-05-26	Paper
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem	2005-04-21	Paper
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming	2005-02-22	Paper
The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm	2004-08-16	Paper
Finite-capacity scheduling-based planning for revenue-based capacity management	1999-02-22	Paper
Overtime Scheduling: An Application in Finite-capacity Real-time Scheduling	1997-02-04	Paper

This page was built for person: Can Akkan