ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Tasks arrive as a rate-one Poisson process and have types in [0,1][0,1]; batch processing time SS is monotone and strictly subadditive and type aa incurs waiting cost rate c(a)c(a). Is there an explicit online algorithm and universal constant CC whose long-run average cost WW satisfies W/W∗<CW/W_*<C for every SS and cc whenever the optimal value W∗W_* is finite?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.