You are not currently logged in.
Access JSTOR through your library or other institution:
Scheduling to Minimize Interaction Cost
R. C. Carlson and G. L. Nemhauser
Vol. 14, No. 1 (Jan. - Feb., 1966), pp. 52-58
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/167976
Page Count: 7
You can always find the topics here!Topics: Local minimum, Mathematical problems, Mathematical minima, Integers, Minimization of cost, Scheduling, Algorithms, Objective functions
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
A model is developed for a scheduling problem in which several activities are competing for a limited number of facilities. It is assumed that any number of activities may be scheduled on any single facility; however there is an interaction cost corresponding to every combination of two activities scheduled on the same facility. This problem is a quadratic program with a rather special structure. An efficient algorithm is developed for determining feasible schedules that are local minima. The nonconvexity of the objective function prevents the identification of a global minimum.
Operations Research © 1966 INFORMS