IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v25y1979i11p1093-1104.html
   My bibliography  Save this article

A Capacitated Bottleneck Facility Location Problem

Author

Listed:
  • P. M. Dearing

    (Clemson University)

  • F. C. Newruck

    (Babcock and Wilcox Research Center, Alliance, Ohio)

Abstract

This paper considers the problem of locating capacitated facilities to meet customer demands. The objective of the problem considers both a bottleneck transportation cost and a total cost of opening facilities. The structure of the problem is similar to that of the total cost capacitated facility location problem. Problems with a bottleneck objective function are solved via a Lagrangean relaxation. An implicit enumeration algorithm is developed to solve the relaxed problem. After a feasible facility configuration is selected, the resulting allocation problem is a bottleneck transportation problem. Special attention is given to the dual of the bottleneck transportation problem to aid the branching and fathoming steps of the solution procedure. Computation results are presented for several test problems.

Suggested Citation

  • P. M. Dearing & F. C. Newruck, 1979. "A Capacitated Bottleneck Facility Location Problem," Management Science, INFORMS, vol. 25(11), pages 1093-1104, November.
    • Handle: RePEc:inm:ormnsc:v:25:y:1979:i:11:p:1093-1104
    DOI: 10.1287/mnsc.25.11.1093
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.25.11.1093
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.25.11.1093?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. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "A bi-objective approach to discrete cost-bottleneck location problems," Annals of Operations Research, Springer, vol. 267(1), pages 179-201, August.

    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:ormnsc:v:25:y:1979:i:11:p:1093-1104. 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.