Search
Now showing items 1-2 of 2
Scheduling in flexible robotic manufacturing cells
(Bilkent University, 2006)
The focus of this thesis is the scheduling problems arising in robotic
cells which consist of a number of machines and a material handling robot.
The machines used in such systems for metal cutting industries are ...
Quadratic assignment problem : linearizations and polynomial time solvable cases
(Bilkent University, 2006)
The Quadratic Assignment Problem (QAP) is one of the hardest
combinatorial optimization problems known. Exact solution attempts proposed
for instances of size larger than 15 have been generally unsuccessful even ...