Jill R. Hardin

Vehicle minimization for periodic deliveries

We consider the problem of minimizing the number of vehicles required to make strictly periodic, single destination deliveries to a set of customers, under the initial assumption that each delivery requires the use of a vehicle for a full day. This problem is motivated by inventory routing problems in which customers consume goods at a steady rate. We evaluate the complexity of the problem and discuss its general properties, including problem decomposition. We also present an algorithm that we show is optimal for special cases. Finally, we extend these results to a general version of the problem.

Managerial Communication of Analytical Work

When business and management science students graduate and have a job, they give many managerial communications about analytical work, but typically they are not taught how to give presentations in their undergraduate courses. We describe the characteristics of the “managerial presentation” and contrast them with characteristics of the “narrative presentation” that is given to technical peers and focuses on process. We then use the business analysis lifecycle to describe and contrast the real world and the model world. Implications for instruction build upon empirical data gathered at Georgia Tech for the presentation skills identified through interviews with engineers, managers, and senior executives in the workforce. We conclude by reviewing processes already used effectively for teaching the relevant presentation skills at Georgia Tech.

Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

We consider the resource-constrained scheduling problem when each jobs resource requirements remain constant over its processing time. We study a time-indexed formulation of the problem, providing facet-defining inequalities for a projection of the resulting polyhedron that exploit the resource limitations inherent in the problem. Lifting procedures are then provided for obtaining strong valid inequalities for the original polyhedron. Computational results are presented to demonstrate the strength of these inequalities.

Analysis of bounds for a capacitated single-item lot-sizing problem

Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a range of fast algorithms. Special attention is given to LP-based rounding algorithms.

Partnerships in Training

Capital One Financial Corporation supplies credit products in the US. Since 1995, it has followed an information-based strategy, collecting and analyzing data to improve its business decisions. To continue this successful strategy, it must train its analysts in analytical techniques. In a partnership between Capital One and the Department of Statistical Sciences and Operations Research at Virginia Commonwealth University, we developed three training courses in forecasting, optimization, and simulation. These courses have been well received by the analysts and have led to considerable early return on investment with one class project forecasted to reduce costs at the firms Richmond, Virginia mail center by more than

Recommendations for an Undergraduate Curriculum at the Interface of Operations Research and Computer Science

2 million annually.

Integrating workforce communication into senior design

In March 2007, the INFORMS Computing Society formed the ICS Education Committee, charged with outlining an undergraduate curriculum that would prepare students for graduate study and/or industrial work at the interface of operations research and computer science. The result is a set of essential and recommended skills that undergraduate students should seek to acquire in order to be successful in such endeavors. This article presents the findings of the committee.