Sequential Assignment Match Processes with Arrivals of Candidates and Offers

DOI10.1017/S0269964800001728MaRDI QIDQ3415981zbMATH OpenOpenAlexFDO

Authors Israel David, Uri Yechiali

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800001728

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• A sequential assignment match process with general renewal arrival times
• One-Attribute Sequential Assignment Match Processes in Discrete Time
• Optimal Sequential Assignment
• scientific article; zbMATH DE number 3947985
• A Generalized Problem of Optimal Selection and Assignment

Cited in

(10)

• Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation
• Triply stochastic sequential assignment problem with the uncertainty in worker survival
• Benchmark policies for utility-carrying queues with impatience
• A double-ended queueing model for dynamic allocation of live organs based on a best-fit criterion
• Optimal policies to obtain the most join results
• A sequential assignment match process with general renewal arrival times
• Stochastic sequential assignment problem with arrivals
• A new look at organ transplantation models and double matching queues
• A generalized coupon collecting model as a parsimonious optimal stochastic assignment model
• One-Attribute Sequential Assignment Match Processes in Discrete Time

This page was built for publication: Sequential Assignment Match Processes with Arrivals of Candidates and Offers

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