Optimal Sequential Assignments with Random Arrival Times

From MaRDI portal
Revision as of 05:28, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4060702


DOI10.1287/mnsc.21.1.60zbMath0304.90054MaRDI QIDQ4060702

S. Christian Albright

Publication date: 1974

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.21.1.60


91B06: Decision theory

90B35: Deterministic scheduling theory in operations research


Related Items

THE SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM WITH POSTPONEMENT OPTIONS, Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities, Asset Selling Under Debt Obligations, Asymptotic analysis for multi-objective sequential stochastic assignment problems, Generalized Sequential Stochastic Assignment Problem, Optimal partitioning of groups in selecting the best choice, Approximation algorithms for stochastic online matching with reusable resources, Construction of Nash equilibrium in a game version of Elfving's multiple stopping problem, A generalized coupon collecting model as a parsimonious optimal stochastic assignment model, Optimal assignment of durable objects to successive agents, Probabilistic resource allocation in heterogeneous distributed systems with random failures, Limiting properties of the discounted house-selling problem, Efficient sequential assignment with incomplete information, Extensions of the sequential stochastic assignment problem, Selecting the best choice in the weighted secretary problem, Dynamic programming formulation of the group interview problem with a general utility function, A new algorithm for the multi-item exponentially discounted optimal selection problem., Triply stochastic sequential assignment problem with the uncertainty in worker survival, An optimal double stopping rule for a buying-selling problem, A Sequential Assignment Match Process with General Renewal Arrival Times, Multiple-stopping problems with random horizon, STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH THRESHOLD CRITERIA, STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH ARRIVALS