Stochastically maximizing the number of successes in a sequential assignment problem

DOI10.2307/3214654zbMath0719.90090OpenAlexW2334336249MaRDI QIDQ5752308

Rhonda Righter

Publication date: 1990

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214654

zbMATH Keywords

multiprocessor schedulingstochastic dynamic programmingthreshold policysequential stochastic assignmentindependent random deadlines for job completions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (7)

A dynamic allocation rule for the funding of projects and its long-run properties ⋮ Scheduling jobs on heterogeneous processors ⋮ Probabilistic resource allocation in heterogeneous distributed systems with random failures ⋮ An Integrated Simulation Environment for Parallel and Distributed System Prototying ⋮ Decision-making, risk and corporate governance: new dynamic models/algorithms and optimization for bankruptcy decisions ⋮ A Sequential Assignment Match Process with General Renewal Arrival Times ⋮ Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines

This page was built for publication: Stochastically maximizing the number of successes in a sequential assignment problem