An on-line assignment problem with random effectiveness and costly information

DOI10.1016/0167-6377(87)90014-9MaRDI QIDQ581216zbMATH OpenOpenAlexFDO

Authors Nicholas G. Hall, Rakesh V. Vohra

Publication date 1987

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(87)90014-9

zbMATH Keywords

on-line assignmentoptimal information searchoptimal testing policy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Review text

We study the on-line assignment problem, where the testing of effectiveness incurs a cost. An optimal testing policy to maximize expected net effectiveness is derived.

Recommendations

• Randomized approximation and online algorithms for assignment problems
• The online stochastic generalized assignment problem
• A note on on-line scheduling with partial information
• On the expected optimal value of random assignment problems: Experimental results and open questions
• Online generalized assignment problem with historical information
• scientific article; zbMATH DE number 4043612
• A stochastic algorithm for online bipartite resource allocation problems
• Optimal discounts for the online assignment problem
• Efficient approximations for the online dispersion problem
• Efficient Approximations for the Online Dispersion Problem

Cites work

• A Problem of Optimal Choice and Assignment
• scientific article; zbMATH DE number 3512426 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3356432 (Why is no real title available?)

Cited in

(1)

• Personnel placement in a fuzzy environment

This page was built for publication: An on-line assignment problem with random effectiveness and costly information

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