Activity Assignment on the Line. A Minisum Approach.

Abstract

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.

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1974
Accession Number
ADA001723

Entities

People

  • Timothy J. Lowe

Organizations

  • University of Florida

Tags

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research

Technology Areas

  • Space