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

An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks

Author

Listed:
  • V. Balachandran

    (Northwestern University, Evanston, Illinois)

Abstract

This paper investigates the assignment of tasks in a network of functionally similar computers. We formulate the problem by a periodic review model with Boolean variables. A computationally efficient, integer-generalized transportation model is applicable because of the existence of relative efficiencies of computers for jobs. Since a job is to be processed exclusively by one computer, we show that an optimal solution to this problem is a basic feasible solution to a slightly modified generalized transportation problem. A branch-and-bound solution procedure prevents possible splitting of a job among computers. We provide an algorithm and computational results.

Suggested Citation

  • V. Balachandran, 1976. "An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks," Operations Research, INFORMS, vol. 24(4), pages 742-759, August.
    • Handle: RePEc:inm:oropre:v:24:y:1976:i:4:p:742-759
    DOI: 10.1287/opre.24.4.742
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.24.4.742
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.24.4.742?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. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    2. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
    3. Haddadi, Salim & Ouzia, Hacene, 2004. "Effective algorithm and heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 184-190, February.
    4. H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.
    5. V. Balachandran, 1977. "A Survey of the Applications of the Operator Theory of Parametric Programming for the Transportation and Generalized Transportation Problems," Discussion Papers 300, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
    7. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:24:y:1976:i:4:p:742-759. 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.