IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v14y1966i1p52-58.html
   My bibliography  Save this article

Scheduling to Minimize Interaction Cost

Author

Listed:
  • R. C. Carlson

    (The Johns Hopkins University, Baltimore, Maryland)

  • G. L. Nemhauser

    (The Johns Hopkins University, Baltimore, Maryland)

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.

Suggested Citation

  • R. C. Carlson & G. L. Nemhauser, 1966. "Scheduling to Minimize Interaction Cost," Operations Research, INFORMS, vol. 14(1), pages 52-58, February.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:1:p:52-58
    DOI: 10.1287/opre.14.1.52
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.1.52
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.1.52?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Diego Recalde & Ramiro Torres & Polo Vaca, 2020. "An exact approach for the multi-constraint graph partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 289-308, October.
    2. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    3. Hertz, Alain & Robert, Vincent, 1998. "Constructing a course schedule by solving a series of assignment type problems," European Journal of Operational Research, Elsevier, vol. 108(3), pages 585-603, August.
    4. Jamie Fairbrother & Adam N. Letchford & Keith Briggs, 2018. "A two-level graph partitioning problem arising in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 69(3), pages 653-676, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:14:y:1966:i:1:p:52-58. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.