all AI news
Scheduling Jobs with Stochastic Holding Costs. (arXiv:2105.13655v3 [cs.LG] UPDATED)
Sept. 22, 2022, 1:13 a.m. | Dabeen Lee, Milan Vojnovic
stat.ML updates on arXiv.org arxiv.org
We study a single-server scheduling problem for the objective of minimizing
the expected cumulative holding cost incurred by jobs, where parameters
defining stochastic job holding costs are unknown to the scheduler. We consider
a general setting allowing for different job classes, where jobs of the same
class have statistically identical holding costs and service times, with an
arbitrary number of jobs across classes. In each time step, the server can
process a job and observes random holding costs of the …
More from arxiv.org / stat.ML updates on arXiv.org
Estimation Sample Complexity of a Class of Nonlinear Continuous-time Systems
2 days, 21 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Program Control Data Analyst
@ Ford Motor Company | Mexico
Vice President, Business Intelligence / Data & Analytics
@ AlphaSense | Remote - United States