Industrial and Systems Engineering
University of Florida

EIN 6918: Graduate Seminar
Spring 2008

February 14, 2008

3PM, MAEB 211

Cutting Plane Algorithms for Solving a Robust Edge-Partition Problem

Chase Rainwater

Department of Industrial and Systems Engineering

University of Florida

Abstract

We consider a profit-maximizing production planning problem with flexible customer demands. That is, a customer will accept delivery quantities within a specified range of values, and revenue is accrued per unit of production output. Each customer demand must be allocated to production on one of a number of capacity constrained resources, and additional capacity constraints may exist for certain subsets of resources. In addition, we consider a variant of the problem for which resource procurement decisions are required. This general class of assignment problems lends itself to a host of planning scenarios, including steel plate manufacturing and personnel scheduling. In this talk we will explore several optimization-based methodologies for solving these problems, including an exact branch and price approach, as well as both constructive and large-scale neighborhood search heuristics.