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

DOI10.1016/0377-2217(89)90192-6MaRDI QIDQ1121764zbMATH OpenOpenAlexFDO

Authors 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) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Inventory, storage, reservoirs (90B05)

Recommendations

• A single-server priority queueing-location model
• Optimal Server Location on a Network Operating as an M/G/1 Queue
• Optimal M/G/1 server location on a tree network with continuous link demands
• Optimal M/G/1 Server Location on a Network Having a Fixed Facility
• Single Server Queueing-Location Models with Rejection

Cites work

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

Cited in

(12)

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

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

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