An assignment problem with queueing time cost

Saligrama R. Agnihothri, Sridhar Narasimhan and Hasan Pirkul

Naval Research Logistics (NRL), 1990, vol. 37, issue 2, 231-244

Abstract: In this article we study the problem of assigning customers to service facilities with the objective of minimizing the total expected cost of accessing facilities and waiting for service at these facilities. We provide an integer programming formulation of the problem with a nonlinear objective function. A Lagrangian relaxation of the problem is described and a heuristic solution procedure is developed which utilizes the solution generated from the relaxed problem. Experimental results over a range of problems indicate that the solution method is both efficient and effective. A free standing heuristic developed for comparative purposes establishes the relative merit of the relaxation‐based heuristic.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199004)37:23.0.CO;2-N

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:wly:navres:v:37:y:1990:i:2:p:231-244

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().