摘要: The layout of divisible activities on the line is considered. Each activity is divisible in the sense that it may be a collection of disjoint intervals, with the sum of the lengths of the interval being known. We construct objecti... 展开 The layout of divisible activities on the line is considered. Each activity is divisible in the sense that it may be a collection of disjoint intervals, with the sum of the lengths of the interval being known. We construct objective functions involving measures of cost 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. (Author) 收起