Search

An optimal approach is applied to even numbered athletic conferences to minimize the total distance traveled by the conference teams when playing conference games. A representative set of constraints is imposed on the problem that is typical of conferences. Only college basketball conferences are actually considered but application could be made to any athletic conference with similar restrictions. Two possible solutions are investigated. The first is a zero-one programming model and the second is an iterative approach leading to the development of a scheduling algorithm. Two examples are provided to show practical application of the algorithm by applying it to the Big Eight and Southeastern basketball conferences. Significant reductions in miles traveled are found for both examples.

A technique is presented which can be used to design, or assist in the design of, an integrated materials handling system for a manufacturing facility or a major department of the facility. The developed procedure selects the materials handling equipment to be used to perform a given set of moves in order to miriimize the system's costs associated with the handling, assuming the plant arrangement remains fixed. To demonstrate the selection procedure, an example problem is presented. Since the method is heuristic, no claim of optimality is made.