ACTIVITY ASSIGNMENT ON THE LINE-A MINISUM APPROACH

摘要

A collection of activities (sets), each one of which has a specified space requirement, is to be laid out on a line. Associated with each activity is a non-negative weight, and for a given layout the measure of effectiveness with respect to a given activity is the maximum weighted distance from any point in the activity's assigned location to any point in any of the other activities' assigned locations. The objective is to find a layout which minimizes the sum of all weighted maximal distances. A solution procedure for the problem is obtained.