Venkat Venkataramanan

Areas of Expertise

Technology Management, Decision Support Systems, Supply Chain management, Computer Simulation, Enterprise Resource Planning

Academic Degrees

• PhD - Business Analysis, Texas A&M University , 1987
• MS - Business Computing Science, Texas A&M University , 1984
• BE - Mechanical Engineering, University of Madras , 1980

Professional Experience

• Executive Education Program at SRC Center , Slovenia, Visiting Lecturer
• University of Ljubljana , Slovenia, Visitor

Awards, Honors & Certificates

• Undergraduate Program Innovative Teaching Award (e-Enterprise Institute), 2001
• Undergraduate Program Innovative Teaching Award (SAP Curriculum), 1999
• Harry C. Sauvain Undergraduate Business Teaching Excellence Award, 1992
• Inspiration and Guidance Award, Doctoral Program, 1991 and 1997
• MBA Association Distinguished Professor, 1991
• Guest Editor, Special Issue Mathematical and Computer Modeling, 2000
• Alpha Kappa Psi Alumni Award for Teaching Excellence in D&IS, 1991

Selected Publications

• Venkataramanan, M. A. and D. Conway (1992), "Genetic Search and the Dynamic Facility Layout Problem," Computers and Operations Research, Vol. 21, pp. 955-960.
• Venkataramanan, M. A. and K. Wilson (1991), "A Branch and Bound Algorithm for Flow Path Design of Automated Guided Vehicle Systems," Naval Research Logistics, Vol. 38, pp. 431-445.

Abstract An algorithm for determining the optimal, unidirectional flow path for an automated guided vehicle system with a given facility layout is presented. The problem is formulated as an integer program. The objective is to minimize the total distance traveled by vehicles subject to the constraint that the resulting network consists of a single strongly connected component. A specialized branch-and-bound solution procedure is discussed in detail.

• Venkataramanan, M. A., J. J. Dinkel, and J. Mote (1989), "An Efficient Decision Support System for Academic Course Scheduling," Operations Research, Vol. 37, Nov.-Dec., pp. 853-864. 

Abstract This paper describes a network-based decision support system approach to the most general form of the academic course scheduling problem. The dimensions of faculty, subject, time, and room are considered by incorporating a penalty function into a network optimization approach. The approach, based on a network algorithm, is capable of solving very large problems. This methodology can be applied to other scheduling situations where there are competing objectives and multiple resources. Such situations include: scheduling of exams, times, and rooms in an academic setting, and scheduling of clients, times, and facilities for physicians, hospitals, dentists, counselors, and clinics. Common problems in such settings include the utilization of available space, and dissatisfaction with assigned times and locations. The proposed system results in more effective room utilization patterns, improved instructor satisfaction levels, and streamlines the tedious scheduling process. We describe the use of the model to schedule all graduate and undergraduate courses in the College of Business Administration at Texas A&M University. This involves 175 faculty, over 300 sections, 20 rooms, and 16 time slots for each semester''s scheduling problem.