An assignment problem with queueing time cost

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199004)37:2<231::AID-NAV3220370204>3.0.CO;2-N" /><231::AID-NAV3220370204>3.0.CO;2-N 10.1002/1520-6750(199004)37:2<231::AID-NAV3220370204>3.0.CO;2-NzbMath0711.90024OpenAlexW2068887290MaRDI QIDQ3496128

Saligrama R. Agnihothri, Sridhar Narasimhan, Hasan Pirkul

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199004)37:2<231::aid-nav3220370204>3.0.co;2-n

zbMATH Keywords

heuristic solution procedureassignment problemLagrangian relaxation methodtotal expected costcustomersservice facilitiesqueueing time

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Nonlinear programming (90C30) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Solution procedures for the service system design problem ⋮ The multi-hour service system design problem ⋮ Planning and coordination of production and distribution facilities for multiple commodities ⋮ Location and capacity design of congested intermediate facilities in networks ⋮ The design of service systems with queueing time cost, workload capacities and backup service

Cites Work

• Unnamed Item
• An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region

This page was built for publication: An assignment problem with queueing time cost