Stochastically maximizing the number of successes in a sequential assignment problem

DOI10.2307/3214654MaRDI QIDQ5752308zbMATH OpenOpenAlexFDO

Authors 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

independent random deadlines for job completionsmultiprocessor schedulingsequential stochastic assignmentstochastic dynamic programmingthreshold policy

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)

Recommendations

• scientific article; zbMATH DE number 3854830
• scientific article; zbMATH DE number 4091212
• Extensions of the sequential stochastic assignment problem
• Sequential stochastic assignment problem with time-dependent random success rates
• scientific article; zbMATH DE number 640292

Cited in

(13)

• A dynamic allocation rule for the funding of projects and its long-run properties
• Asymptotics of the optimum in discrete sequential assignment
• Decision-making, risk and corporate governance: new dynamic models/algorithms and optimization for bankruptcy decisions
• Scheduling jobs on heterogeneous processors
• A sequential assignment match process with general renewal arrival times
• Stochastic sequential assignment problem with arrivals
• The Stochastic Sequential Assignment Problem With Random Deadlines
• Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
• scientific article; zbMATH DE number 3947985 (Why is no real title available?)
• Optimal Sequential Assignment
• scientific article; zbMATH DE number 640292 (Why is no real title available?)
• An Integrated Simulation Environment for Parallel and Distributed System Prototying
• Probabilistic resource allocation in heterogeneous distributed systems with random failures

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

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