Department: Information, Risk & Operations Management
Additional Titles: Kenneth M. and Susan T. Jastrow, II Chair in Business Associate Dean for Research
Industry Areas: Decision Support Systems, Logistics, Manufacturing, Retail, Telecommunication
Research Areas: Distribution Channels, Information Systems, Large Scale Optimization, Network Design, Operations Management, Supply Chain Management, Telecommunications
Anant Balakrishnan is the Associate Dean for Research and holds the Kenneth M. and Susan T. Jastrow, II Chair at the McCombs School of Business. He has previously held faculty appointments in the business schools at MIT, Penn State, and Purdue. He holds a Ph.D. from MIT, and B. Tech (Electronics) and MBA degrees from IIT and IIM. Dr. Balakrishnan’s research and teaching interests include operations and supply chain management, management science, and telecommunications. His research focuses on developing effective optimization models and methods to support planning and managerial decision-making for operations, logistics, and telecommunications. Dr. Balakrishnan has worked closely with manymanufacturing and service firms, and has published in leading journals such as Management Science, Networks, Operations Research, Transportation Science, Manufacturing & Service Operations Management, and Mathematical Programming. Professor Balakrishnan serves on several editorial boards. His professional awards include the Zannetos Prize for research, and the Salgo-Noren award for teaching. He was Vice-President of Subdivisions for INFORMS (Institute for Operations Research and the Management Sciences), and has organized and participated actively in many professional activities of this association.
ACADEMIC LEADERSHIP & AWARDS
Best Paper Award, Telecommunications Section, INFORMS National Meeting
Transportation Science Best Dissertation Prize, Operations Research Society of America
Zannetos Thesis Prize, MIT
Salgo Noren Outstanding MBA Teaching Award, Krannert Graduate School of Management, Purdue University
Anantaram Balakrishnan, Prakash Mirchandani, and Sifeng Lin. March-April 2022. Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models. Operations Research 70(2): 690-714.
Brian Roth, Anantaram Balakrishnan, Pooja Dewan, and April Kuo. 2018. Crew Decision Assist: System for Optimizing Crew Assignments at BNSF Railway. Interfaces 48(5), 436-448.
Anantaram Balakrishnan, Gang Li, and Prakash Mirchandani. 2017. Optimal Network Design with End-to-End Service Requirements. Operations Research 65(3), 729-750.
Anantaram Balakrishnan and Christian Vad Karsten. 2017. Container Shiping Service Selection and Cargo Routing with Transshipment Limits. European Journal of Operational Research 263(2), 652-663.
Gang Li and Anantaram Balakrishnan. 2016. Models and Algorithms for Network Reduction. European Journal of Operational Research 248(3), 930-942.
Anantaram Balakrishnan, Shankar Sundaresan, and Bo Zhang. 2014. Browse-and-Switch: Retail-Online Competition under Value Uncertainty. Production and Operations Management 23(7), 1129-1145.
Anantaram Balakrishnan and Harihara Prasad Natarajan. 2014. Designing Fee Tables for Retail Delivery Services by Third-Party Logistics Providers. IIE Transactions 46(12), 1261-1278.
Anantaram Balakrishnan and Harihara Prasad Natarajan. 2014. Integrated Procurement Planning in Multi-Division Firms. Production and Operations Management 23(10), 1795-1810.
Anantaram Balakrishnan, Mihai Banciu, Karolina Glowacka, and Prakash Mirchandani. 2013. Hierarchical Approach For Survivable Network Design. European Journal of Operational Research 225(2), 223-235.
Yalcin Akcay, Anantaram Balakrishnan, and Susan H. Xu. 2010. Dynamic Assignment of Flexible Service Resources. Production and Operations Management 19(3), 279-304.
Anantaram Balakrishnan, Prakash Mirchandani, and Harihara Prasad Natarajan. 2009. Connectivity Upgrade Models for Survivable Network Design. Operations Research 57, 170-186.
Anantaram Balakrishnan, Pangburn, Michael S., and Stavrulaki, Euthemia. 2008. Integrating the Promotional and Service Roles of Retail Inventories. Manufacturing & Service Operations Management 10, 218-235.
Xiajun Pan and Anantaram Balakrishnan. 2007. Optimal Material Sourcing and Delivery Operations, in Proceedings of International Network Optimization Conference, Spa, Belgium.
Anantaram Balakrishnan, Michael S. Pangburn, and Euthemia Stavrulaki. 2004. ''Stack Them High, Let 'em Fly'': Lot-Sizing Policies When Inventories Stimulate Demand. Management Science 50, 630-644.
Anantaram Balakrishnan and Joseph Geunes. 2004. Collaboration and Coordination in Supply Chain Management and E-Commerce. Production and Operations Management 13, 1-2.
Anantaram Balakrishnan, Thomas L. Magnanti, and Prakash Mirchandani. 2004. Connectivity-Splitting Models for Survivable Network Design. Networks 43, 10-27.
Anantaram Balakrishnan, Joseph Geunes, and Michael S. Pangburn. 2004. Coordinating Supply Chains by Controlling Upstream Variability Propagation. Manufacturing and Service Operations Management 6, 163-183.
Akcay, Y., Anantaram Balakrishnan, and S. Xu.. 2004. Scheduling of Flexible Resources in Professional Services Firms, in Handbook on Scheduling: Algorithms, Models, and Performance Analysis, J. Y-T. Leung, ed. CRC Press.
Anantaram Balakrishnan and Prakash Mirchandani. 2003. A New Approach for Designing Robust Networks, in NSF Grantees Conference Proceedings, Birmingham, AL, 617-646.
Anantaram Balakrishnan and Joseph Geunes. 2003. Production Planning With Flexible Product Specifications: An Application To Specialty Steel Manufacturing. Operations Research 51, 94-112.
Anantaram Balakrishnan, Joseph Geunes, and Michael S. Pangburn. 2002. Coordinating the Distribution Chain: New Models for New Challenges, in Supply Chain Management: Models, Applications, and Research Directions, J. Geunes, P.M. Pardalos, and H.E. Romeijn, eds. Dordrecht, Netherlands: Kluwer Academic Publishers, 199-242.
Anantaram Balakrishnan, T.L. Magnanti, J. Sokol, and Y. Wang. 2002. Spare Capacity Assignment for Line Restoration Using a Single Facility Type. Operations Research 50, 617-635.
Anantaram Balakrishnan, T.L. Magnanti, and P. Mirchandani. 2001. Intuitive Solution-Doubling Techniques for Worst-case Analysis of Some Survivable Network Design Problems. Operations Research Letters 29, 99-106.
Anantaram Balakrishnan, T.L. Magnanti, J. Sokol, and Y. Wang. 2001. Telecommunication Link Restoration Planning with Multiple Facility Types. Annuals of Operations Research 106, 127-154.
Anantaram Balakrishnan, M.S. Pangburn, and E. Stavrulaki. 2000. Lot Sizing with Demand Stimulating Inventories, in Manufacturing and Service Operations Management Conference Proceedings, Ann Arbor, MI.
Anantaram Balakrishnan, H.P. Natarajan, and M.S. Pangburn. 2000. Optimizing Delivery Fees for a Network of Distributors. Manufacturing and Service Operations Management 2, 297-316.
Anantaram Balakrishnan and J. Geunes. 2000. Requirements Planning with Substitutions: Exploiting Bill-of-Materials Flexibility in Production Planning. Manufacturing and Service Operations Management 2, 166-185.
Anantaram Balakrishnan and F. Vaderbeck. 1999. A Tactical Planning Model for Mixed-Model Electronics Assembly Operations. Operations Research 47, 395-409.
Anantaram Balakrishnan and T. Semmelbauer. 1999. Circuit Diagnosis Support System for Electronics Assembly Operations. Decision Support Systems 25, 251-269.
Anantaram Balakrishnan, S.R.T. Kumara, and S. Sundaresan. 1999. Manufacturing in the Digital Age: Exploiting Information Technologies for Product Realization. Information Systems Frontiers 1, 25-50.
Anantaram Balakrishnan, T.L. Magnanti, and P. Mirchandani. 1998. Designing Hierarchical Survivable Networks. Operations Research 46, 116-136.
Anantaram Balakrishnan, T.L. Magnanti, and P. Mirchandani. 1997. Network Design, in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffiolli, and S. Martello, eds. Chichester, England: John Wiley, 311-334.
A. Aman, Anantaram Balakrishnan, and V. Chandru. 1997. On-line Maintenance of Optimal Machine Schedules. Sadhana 22, 257-279.
Anantaram Balakrishnan, R.L. Francis, and J. Grotzinger. 1996. Bottleneck Resource Allocation in Manufacturing. Management Science 42, 1611-1625.
Anantaram Balakrishnan, T.L. Magnanti, and P. Mirchandani. 1996. Heuristics, LPs, and Trees on Trees: Network Design Analyses. Operations Research 44, 478-496.
Anantaram Balakrishnan and S. Brown. 1996. Process Planning for Alumnium Tubes: An Engineering-Operations Perspective. Operations Research 44, 7-20.
Anantaram Balakrishnan and S. Gopalakrishnan. 1996. Selecting Ingot Sizes for Joint Production of Sheet Products. INFORMS Journal on Computing 8, 260-273.
Anantaram Balakrishnan, T.L. Magnanti, and R.T. Wong. 1995. A Decomposition Algorithm for Local Access Telecommunications Network Expansion. Operations Research 43, 58-76.
Anantaram Balakrishnan, R. Kalakota, P.S. Ow, and Andrew B. Whinston. 1995. Document-Centered Information Systems to Support Reactive Problem-Solving in Manufacturing. International Journal of Production Economics 38, 31-58.
Anantaram Balakrishnan, S. Brown, D. Dunlap, and R. Pahl. 1995. Interdisciplinary Industry-University Collaboration: Lessons from an Operations Improvement Project. Interfaces 25, 12-41.
Anantaram Balakrishnan, T.L. Magnanti, and P. Mirchandani. 1994. A Dual-Based Algorithm for Multi-Level Network Design. Management Science 40, 567-581.
Andrew B. Whinston, Anantaram Balakrishnan, and R. Kalakota. 1994. Designing Collaborative Systems to Support Reactive Problem-Solving in Manufacturing, in Information and Collaboration Models of Integration, Shimon Y. Nof, ed. Norwell, MA: Kluwer Academic Press, 105-133.
Anantaram Balakrishnan, T.L. Magnanti, and P. Mirchandani. 1994. Modeling and Heurstic Worst-Case Performance Analysis of the Two-Level Network Design Problem. Management Science 40, 846-867.
Anantaram Balakrishnan, T.L. Magnanti, and P. Mirchandani. 1993. Heuristic and LP Analysis of the Overlay Optimization Problem, in NETFLOW 93 Conference,
A. Aman, Anantaram Balakrishnan, and V. Chandru. 1992. Dynamic Task Assignment in Distributed Manufacturing Systems, in New Directions for Operations Research in Manufacturing, G. Fandel, T.Gulledge, and A. Jones, eds. New York, NY: Springer-Verlag, 249-263.
Anantaram Balakrishnan and Andrew B. Whinston. 1992. Information Issues in Model Specification. Information Systems Research 3, 263-286.
Anantaram Balakrishnan and K. Altinkemer. 1992. Using a Hop-Constrained Model to Generate Alternative Communication Network Designs. ORSA Journal on Computing 4, 192-205.
Andrew B. Whinston and Anantaram Balakrishnan. 1991. Information Issues in Model Specification. Information Systems Research 2, 263-286.
Andrew B. Whinston, Anantaram Balakrishnan, J.C. Moore, and R. Pakath. 1991. Information Tradeoffs in Model Building: A Network Routing Application. Computer Science in Economics and Management 4, 201-227.
Anantaram Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong. 1991. Models for Planning Capacity Expansion in Local Access Telecommunication Networks. Annuals of Operations Research 33, 239-284.
Anantaram Balakrishnan, T.W. Chien, and R.T. Wong. 1990. Selecting Aircraft Routes for Long-Haul Operations: A Formulation and Solution Method. Transportation Research 24B, 57-72.
Anantaram Balakrishnan and S.C. Graves. 1989. A Composite Algorithm for a Concave-Cost Network Flow Problem. Networks 19, 175-202.
Anantaram Balakrishnan, T.L. Magnanti, and R.T. Wong. 1989. A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design. Operations Research 37, 716-740.
T.W. Chien, Anantaram Balakrishnan, and R.T. Wong. 1989. An Integrated Inventory Allocation and Vehicle Routing Problem. Transportation Science 23, 67-76.
Anantaram Balakrishnan. 1989. Preemptive Scheduling of Hybrid Parallel Machines. Operations Research 37, 301-313.
Anantaram Balakrishnan, R.D. Plante, and R.T. Wong. 1988. The Nozzle Guide Vane Problem: Partitioning a Heterogeneous Inventory. European Journal of Operational Research 35, 328-338.
Anantaram Balakrishnan. 1987. LP Extreme Points and Cuts for the Fixed-Charge Network Design Problem. Mathematical Programming 39, 263-284.