A logistics problem: a non-markovian queueing network model and algorithm

DOI10.1080/02331939308843874MaRDI QIDQ3835657zbMATH OpenOpenAlexFDO

Authors Behnam Pourbabai

Publication date 30 June 1995

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939308843874

zbMATH Keywords

approximationheuristic algorithminfinite capacitylogisticsstochastic optimizationtransportation network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Recommendations

• A Markovian queueing transportation network problem
• A heuristic algorithm for a stochastic transportation network
• Optimizing flow rates in a queueing network with side constraints
• Dynamic fleet management as a logistics queueing network
• scientific article; zbMATH DE number 3920177

Cites work

• A class of chance constrained network optimization problems
• A Markovian queueing transportation network problem
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)

Cited in

(4)

• Stochastic models of transport flow interaction at transshipment points
• Queuing models used to investigate technical logistics
• A heuristic algorithm for a stochastic transportation network
• A Markovian queueing transportation network problem

This page was built for publication: A logistics problem: a non-markovian queueing network model and algorithm

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