Approximation algorithms for stochastic online matching with reusable resources

We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The objective is to maximize the total expected reward, defined as the sum of the rewards of each matched worker-job pair. Each worker can be matched to mult...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical methods of operations research (Heidelberg, Germany) Ročník 98; číslo 1; s. 43 - 56
Hlavní autoři:	Shanks, Meghan, Yu, Ge, Jacobson, Sheldon H.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2023 Springer Nature B.V
Témata:	Algorithms Approximation Business and Management Calculus of Variations and Optimal Control; Optimization Employment Expected values Markov analysis Matching Mathematical analysis Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Original Article Passenger screening Queuing Random variables Scheduling Success Workers Stochastic matching Online algorithms Approximation algorithms Reusable resources
ISSN:	1432-2994, 1432-5217
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!