Locating a facility on a congested network with random lengths

DOI10.1002/NET.3230150302MaRDI QIDQ3703607zbMATH OpenOpenAlexFDO

Authors Oded Berman

Publication date 1985

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230150302

zbMATH Keywords

location problem on networksrandom service demandsrandom travel timestwo types of uncertainties

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Inventory, storage, reservoirs (90B05)

Recommendations

• scientific article; zbMATH DE number 4055345
• A center location problem with congestion
• 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
• scientific article; zbMATH DE number 1803764

Cites work

• Locating a Mobile Server Queueing Facility on a Tree Network

Cited in

(8)

• Uncertain models for single facility location problems on networks
• Optimal facility location with random throughput costs
• scientific article; zbMATH DE number 4055345 (Why is no real title available?)
• A queueing-location model with expected service time dependent queueing disciplines
• Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
• Strategic facility location: A review
• A center location problem with congestion
• Connected facility location via random facility sampling and core detouring

This page was built for publication: Locating a facility on a congested network with random lengths

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