Hassan Rashidi

Hassan Rashidi is a computer scientist working in the field of scheduling. His PhD research was in that field, with focus on port automation, supervised by Edward Tsang. His dynamic scheduling system extends the network simplex method and is capable of solving problems to optimality with ten million variables within two minutes (see his major publication). Meanwhile, he is a member of Reactive Search Group over the World, the professional people to solving hard optimization problems, both in the discrete and continuous domain.
He is also the founder of NSA+ (the Extended Network Simplex Algorithm), DNSA (Dynamic Network Simplex Algorithm) and DNSA+ (Dynamic Network Simplex Plus Algorithm) - The state-of-the-art algorithms to solve the Minimum Cost Flow Problem in both static and dynamic aspects.
He obtained both his B.Sc. in Computer Engineering, 1986, and M.Sc. in Systems Engineering and Planning, 1989, from Isfahan University of Technology with the highest honours. From 1990 to 1991, he was a Lecturer and Director of Computer Centre, Shahed University, Tehran, Iran. He was a Lecturer in Institute for Research and Planning, Tehran, Iran, from 1992 to 2002. He joined the Department of Computer Science, University of Essex, UK, as a PhD student from October 2002. He worked on the Autoport project. He submitted his thesis in September 2005 and obtained his PhD on 26 April 2006.
He is now a Visiting Academic, a member of the Constraint Satisfaction and Robotics Research Groups at University of Essex, UK, and Associate Professor at , Iran.
Affiliations
* Department of Mathematics and Computer Science, Allameh Tabataba'i University, Tehran, Iran
* Department of Computer Engineering, Islamic Azad University, Qazvin Branch, Iran
* Visiting Academic in School of Computer Science and Electronic System Engineering, University of Essex,UK

Main Menu

See Also

Main Menu