An assignment problem with queueing time cost

DOI10.1002/1520-6750(199004)37:2%3C231::AID-NAV3220370204%3E3.0.CO;2-NMaRDI QIDQ3496128zbMATH OpenOpenAlexFDO

Authors 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%3C231::aid-nav3220370204%3E3.0.co;2-n

zbMATH Keywords

assignment problemcustomersheuristic solution procedureLagrangian relaxation methodqueueing timeservice facilitiestotal expected cost

Mathematics Subject Classification ID

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

Recommendations

• Solution procedures for the service system design problem
• Allocation of queuing facilities using a minimax criterion
• A note on the allocation of queuing facilities using a minisum criterion
• The design of service systems with queueing time cost, workload capacities and backup service
• A variation of the assignment problem

Cites work

• An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(9)

• The design of service systems with queueing time cost, workload capacities and backup service
• Solution procedures for the service system design problem
• Assignment problems with changeover cost
• Priority Assignment in Waiting Line Problems
• Model, analysis and application of employee assignment for quick service restaurant
• The multi-hour service system design problem
• Planning and coordination of production and distribution facilities for multiple commodities
• Fast heuristics for the time-constrained immobile server problem
• Location and capacity design of congested intermediate facilities in networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496128)