Skip Navigation
Oklahoma State University

IEM Seminar Series

Industrial Engineering & Management in conjunction with the OSU INFORMS Student Chapter will be sponsoring a Seminar Series in the fall and spring semester. Various topics will be covered by faculty from the department. The series will be held on Wednesdays 2:30pm-4:00pm. Seminar topics, location and a short abstract and bio about the presenters will be available here as it becomes available.

 

Date

Speaker

Title

Institution

Aug. 24th

 Kalyani Nagaraj

Stochastically-Constrained Simulation Optimization On Integer Lattices

OSU, IEM

Aug. 31st

Sujeevraja Sanjeevi

Disruption Control with Crew Recovery

Sabre Airline Solutions

Sept. 16th *

Jan Shi*

Manufacturing Analytics: Synergies between Engineering and Statistics

Georgia Tech*

Sept. 21st

Shivakumar Raman

Shape Engineering for Advanced Manufacturing (SEAM)

University of Oklahoma

Sept. 28th

Cole Smith

Exact Algorithms and Bounds for the Dynamic Assignment Interdiction Problem

Clemson

Oct. 12th

David Coit

Electric Power Generation Expansion Planning: Robust Optimization Considering Uncertainty and Climate Change

Rutgers

Oct. 19th

William Paiva

 

OSU, CHSI

Oct. 21st*

Jack ReVelle*

The Goldsboro Broken Arrow – When the U.S. Nuked North Carolina

ReVelle Solutions, LLC*

Oct. 26th

Mark Nejad

Network Optimization and Electric Vehicle Routing

University of Oklahoma

Nov. 2nd

Homarjun Agrahari

Perspectives on Building Successful Career as Analytics and Operations Research Practitioner

FleetPride, Inc.

 

*These Seminars occur on Friday at 3:00 pm

 

Exact Algorithms and Bounds for the Dynamic Assignment Interdiction Problem
Speaker: Dr. J. Cole Smith
Clemson University

Date: Wednesday, September 28th
Time: Seminar: 2:30-3:30pm; Q&A: 3:30-4:00pm
Location: Engineering North 450

Abstract: We study a dynamic assignment interdiction game involving two agents, a userand an attacker. The user wishes to assign a set of tasks at the minimum cost, and theattacker seeks to interdict a subset of arcs to maximize the user's objective. The completion time for each task is one period and, because of resource constraints, only one task can start at any time. The assignment costs and interdiction impacts vary over time. At any time in the game, the attacker can interdict arcs subject to a budget (cardinality) constraint and any interdicted arc can still be used by the user at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP-hard, even when the attacker can interdict only one arc. We propose an exact exponential-state dynamic-programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. One class of these bounds is based on classical interdiction and robust optimization models, and the other on exact solutions to variations of the dynamic assignment interdiction game. This is joint work with Dr. Jorge Sefair, Assistant Professor at Arizona State University.

Speaker Bio: Dr. J. Cole Smith is Professor and Chair of the Industrial Engineering department at Clemson University. His research has been supported by the NSF, DARPA, AFOSR, DTRA, and the ONR, and he has spent one summer as a distinguished visiting professor in the National Security Agency¹s summer program in operations research technology. His research regards mathematical optimization models and algorithms, especially those arising in combinatorial optimization. Dr. Smith has had the pleasure of collaborating with colleagues across many different disciplines, including Mathematics, Ecology, Psychology, Computer Science, and Biomedical Engineering. His awards include the Young Investigator Award from the ONR, the Hamid K. Elden Outstanding Young Industrial Engineer in Education award, the Operations Research Division Teaching Award, the 2014 Glover-Klingman prize for best paper in Networks, and the best paper award from IIE Transactions in 2007.