On the solution of a stochastic bottleneck assignment problem and its variations

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199204)39:3<389::AID-NAV3220390308>3.0.CO;2-6" /><389::AID-NAV3220390308>3.0.CO;2-6 10.1002/1520-6750(199204)39:3<389::AID-NAV3220390308>3.0.CO;2-6zbMath0751.90055OpenAlexW2026114366MaRDI QIDQ3989987

Prabuddha De, Charles E. Wells, Jay B. Ghosh

Publication date: 28 June 1992

Full work available at URL: https://doi.org/10.1002/1520-6750(199204)39:3<389::aid-nav3220390308>3.0.co;2-6

zbMATH Keywords

linear assignmentbottleneck assignmentstochastic assumptions

Mathematics Subject Classification ID

Stochastic programming (90C15) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Bilevel time minimizing assignment problem ⋮ A variant of time minimizing assignment problem

Cites Work

• Some Generalisations of the Time Minimising Assignment Problem
• Time‐minimizing transportation problems

This page was built for publication: On the solution of a stochastic bottleneck assignment problem and its variations