Scheduling to Minimize Interaction Cost

R. C. Carlson and G. L. Nemhauser
Additional contact information
R. C. Carlson: The Johns Hopkins University, Baltimore, Maryland
G. L. Nemhauser: The Johns Hopkins University, Baltimore, Maryland

Operations Research, 1966, vol. 14, issue 1, 52-58

Abstract: 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.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.1.52 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:14:y:1966:i:1:p:52-58

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().