The Layout of Divisible Activities on the Line

We consider the layout of divisible activities on the line. Each activity is divisible in the sense that it may be a collection of disjoint intervals, with the sum of the lengths of the intervals being known. We construct objective functions involving measures of costs proportional to distances between activities, establish that to find optimal layouts it is enough to consider only symmetric layouts, and present algorithms for choosing best symmetric layouts.