Skip Menu

Return to Skip Menu

Main Content

Faculty

Subhash Sarin

Paul T. Norton Endowed Professor


Education

  • Ph.D., North Carolina State University, 1978
  • M.S., Kansas State University, 1973
  • BSc., Delhi University, 1970

Research Accomplishments

  • Contributions in production scheduling, sequencing, applied mathematical programming, and in analyzing and designing algorithms for the operational control of manufacturing systems.

Recent Course Responsibilities

  • Production Planning and Control
  • Sequencing and Scheduling
  • Dynamic Programming
  • Modeling and Analysis of Semiconductor Manufacturing

Selected Recent Publications

  • Kalir, A. A. and S. C. Sarin, “Optimal Solutions for the Single Batch Flow Shop Lot Streaming Problem with Equal Sublots,” Decision Sciences, Vol. 32, No. 2, pp 387-397, Spring 2001.
  • Kalir, A. A. and S. C. Sarin, “Constructing New Optimal Schedules for the Flow Shop Lot Streaming Problem with Sublot-Attached Setups,” Journal of Combinatorial Optimization, Vol. 7, pp. 23-44, 2003.
  • Sarin, S. C. and D. Prakash, “Single Machine and Parallel Machines, Unit Processing Time, Bicriteria Scheduling Problem,” Journal of Combinatorial Optimization, Vol. 8, pp. 227-240, 2004.
  • Bukchin, J. and S. C. Sarin, “A Cyclic Policy for the Loading of Multiple Products on a Vehicle with Different Compartment Sizes,” Institute of Industrial Engineering Transactions, Vol. 36, No. 7, pp. 641-653, 2004.
  • Sarin, S. C., Y. Wang and D. B. Chang, “A Schedule Algebra-based Approach to Determine the K-Best Solutions of a Knapsack Problem with Single Constraint,” Lecture Notes in Computer Science, Springer-Verlag, 2005
  • Sarin, S. C., M. Greco and E. M. Dar-El, “Job Sequencing and Material Flow Control in a Closed Production System,” European Journal of Operational Research, Vol. 168, No. 3, 2005.
  • Sarin, S. C. and Jan West-Hansen, “Solving the Long-Term Production Scheduling Problem by Mixed Binary Programming,” Institute of Industrial Engineering Transactions, Vol. 37, No. 2, pp. 109-121, 2005.
  • Sarin, S. C., H. D. Sherali and A. Bhootra, “New Tighter Polynomial Length Formulations in the Asymmetric Traveling Salesman Problem with and without Precedence Constraints,” Operations Research Letters, Vol. 33, pp. 62-70, 2005.
  • Sarin, S. C., H. D. Sherali and A. Bhootra, “A Precedence-Constrained Asymmetric Traveling Salesman Model for Disassembly Optimization,” Institute of Industrial Engineering Transactions, Vol. 38, pp. 223-237, 2005.
  • Sherali, H. D., S. C. Sarin and P. Tsai, “A Class of Lifted Path and Flow-based Formulations for the Asymmetric Traveling Salesman Problem with and without Precedence Constraints,” Discrete Optimization, Vol. 3, pp. 20-32, 2006.

Selected Recent Projects

  • Optimal Daily Start Plans (M/A-COM)
  • Joint Production and Shipment Schedules (Virginia Glass)
  • Dynamic Lot Release Production Plans and Scheduling (Center for High Performance Manufacturing (CHPM))
  • Disassembly Optimization (NSF and CHPM)
  • Design of Microelectronics Devices, Processes and Manufacturing Operations (NSF)

Industries Serviced

Manufacturing, Microelectronics, Transportation

Key Professional Service activities

  • Member of the Editorial Board, International Journal of Production Planning and Control
  • Area Editor of Production Planning and Scheduling, Computers and Industrial Engineering

Additional links