Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems

DOI10.1155/2011/605629zbMATH Open1233.90123DBLPjournals/jamds/MoghadasK11OpenAlexW2100743107WikidataQ58653872 ScholiaQ58653872MaRDI QIDQ764792FDOQ764792

Foroogh Moeen Moghadas, Hossein Taghizadeh Kakhki

Publication date: 14 March 2012

Published in: Advances in Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/605629

Recommendations

• A decomposition approach for the probabilistic maximal covering location-allocation problem
• A note on solutions to the maximal expected covering location problem
• The Maximal Expected Covering Location Problem: Revisited
• Allocation of queuing facilities using a minimax criterion
• scientific article

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Computing approximate solutions of the maximum covering problem with GRASP
• A bibliography for some fundamental problem categories in discrete location science
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Title not available (Why is that?)
• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search procedures
• Ambulance location and relocation models.
• Title not available (Why is that?)
• Review, extension and prediction in emergency service siting models
• The queueing maximal availability location problem: A model for the siting of emergency vehicles
• An annotated bibliography of GRASP-Part II: Applications
• Locating emergency services with different priorities: the priority queuing covering location problem
• An annotated bibliography of GRASP – Part I: Algorithms
• A decomposition approach for the probabilistic maximal covering location-allocation problem
• Title not available (Why is that?)
• A new method for solving capacitated location problems based on a set partitioning approach
• A location model for a facility operating as anM/G/k queue
• Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
• A queueing-location model with expected service time dependent queueing disciplines
• Optimal Server Location on a Network Operating as an M/G/1 Queue
• The Stochastic Queue p-Median Problem
• Location-allocation on congested networks
• The stochastic queue center problem

Cited In (3)

• Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
• An \(M/M/c\) queue model for hub covering location problem
• A note on solutions to the maximal expected covering location problem

Uses Software

• GRASP

This page was built for publication: Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems

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