OPTIMAL ASSIGNMENT FOR A RANDOM SEQUENCE WITH AN UNKNOWN NUMBER OF JOBS

DOI10.15807/JORSJ.28.179MaRDI QIDQ3701183zbMATH OpenOpenAlexFDO

Authors Tōru Nakai

Publication date 1985

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.28.179

zbMATH Keywords

infinite horizonoptimal policyrecursive equationstotal expected rewardsequential stochastic assignmentunknown number of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 640292
• Sequential stochastic assignment problem with time-dependent random success rates
• scientific article; zbMATH DE number 3854830
• Optimal Sequential Assignment
• Stochastic sequential decision-making with a random number of jobs

Cited in

(6)

• scientific article; zbMATH DE number 4091212 (Why is no real title available?)
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• Stochastic sequential decision-making with a random number of jobs
• scientific article; zbMATH DE number 3854830 (Why is no real title available?)
• Comparing job allocation schemes where service demand is unknown
• Optimal Sequential Assignment

This page was built for publication: OPTIMAL ASSIGNMENT FOR A RANDOM SEQUENCE WITH AN UNKNOWN NUMBER OF JOBS

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