Abstract
This paper addresses a class of problems in which available resources need to be optimally allocated to a random number of jobs with stochastic parameters. Optimal policies are presented for variations of the sequential stochastic assignment problem and the dynamic stochastic knapsack problem, in which the number of arriving jobs is unknown until after the final arrival, and the job parameters are assumed to be independent but not identically distributed random variables.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
