Akkan Can

Can Akkan

Information about the author Can Akkan will soon be added to the site.
Found 5 papers in total
Finding robust timetables for project presentations of student teams
Finding robust timetables for project presentations of student teams
2016
This article describes a methodology developed to find robust solutions to a novel...
Network decomposition-based benchmark results for the discrete time–cost tradeoff problem
Network decomposition-based benchmark results for the discrete time–cost tradeoff problem
2005
In project management, the project duration can often be compressed by accelerating...
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
2004
This paper presents a branch-and-bound algorithm for the two-machine flowshop...
Finite-capacity scheduling-based planning for revenue-based capacity management
Finite-capacity scheduling-based planning for revenue-based capacity management
1997
Finite-capacity scheduling can be argued to be a crucial component of revenue-based...
Overtime scheduling: An application in finite-capacity real-time scheduling
Overtime scheduling: An application in finite-capacity real-time scheduling
1996
Negotiating and meeting due-times for work-orders is often the most important concern...
Papers per page: