The following pages link to Can Akkan (Q320996):
Displaying 12 items.
- Finding robust timetables for project presentations of student teams (Q320999) (← links)
- Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
- Finite-capacity scheduling-based planning for revenue-based capacity management (Q1278082) (← links)
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem (Q1652501) (← links)
- Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (Q1730745) (← links)
- Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795) (← links)
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839) (← links)
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm (Q1876196) (← links)
- Robust university course timetabling problem subject to single and multiple disruptions (Q2286982) (← links)
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions (Q2668751) (← links)
- Overtime Scheduling: An Application in Finite-capacity Real-time Scheduling (Q5285354) (← links)
- Minimizing sum of completion times on a single machine with sequence-dependent family setup times (Q5469663) (← links)
