A queueing-location model with expected service time dependent queueing disciplines

DOI10.1016/0377-2217(89)90192-6zbMath0674.90031OpenAlexW1978763870MaRDI QIDQ1121764

Rajan Batta

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90192-6

zbMATH Keywords

M/G/1 queuecongested environmentHakimi medianlocating a single server on a networkLongest Expected Job Firstnon-preemptive priority queueing modelShortest Expected Job Firsttwo-node networkWork Conserving Single Priority

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (8)

Optimizing the size and locations of facilities in competitive multi-site service systems ⋮ Approximation algorithms for facility location problems with a special class of subadditive cost functions ⋮ Uncertain models for single facility location problems on networks ⋮ An approximation algorithm for a facility location problem with stochastic demands and inventories ⋮ Location analysis: a synthesis and survey ⋮ Hierarchical location-allocation models for congested systems ⋮ Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems ⋮ Locating repair shops in a stochastic environment

Cites Work

• Unnamed Item
• Unnamed Item
• Location-allocation on congested networks
• The Stochastic Queue p-Median Problem
• A Multiple Dispatch Queueing Model of Police Patrol Operations
• Optimal Server Location on a Network Operating as an M/G/1 Queue
• Locating a facility on a congested network with random lengths
• Optimal 2-Facility Network Districting in the Presence of Queuing
• Locating a Mobile Server Queueing Facility on a Tree Network
• A single-server priority queueing-location model
• Single Server Queueing-Location Models with Rejection
• Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
• A location model for a facility operating as anM/G/k queue
• Approximating the Performance of Urban Emergency Service Systems
• A Patrol Car Allocation Model: Capabilities and Algorithms
• Approximations in finite-capacity multi-server queues by Poisson arrivals
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: A queueing-location model with expected service time dependent queueing disciplines