Probabilistic analysis of the minimum weighted flowtime scheduling problem
From MaRDI portal
Publication:1197880
DOI10.1016/0167-6377(92)90034-ZzbMath0761.90063MaRDI QIDQ1197880
Sara van de Geer, Leen Stougie, WanSoo T. Rhee, Alberto Marchetti-Spaccamela
Publication date: 16 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
law of large numberslaw of the iterated logarithmcentral limit theoremasymptotic optimalitygreedy heuristicminimal weighted flow time scheduling
Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)
Related Items (7)
Effective on-line algorithms for reliable due date quotation and large-scale scheduling ⋮ Weighted flow time bounds for scheduling identical processors ⋮ Scheduling and due‐date quotation in a make‐to‐order supply chain ⋮ On rates of convergence and asymptotic normality in the multiknapsack problem ⋮ A probabilistic analysis of the multi-period single-sourcing problem ⋮ An approximate algorithm for a high-multiplicity parallel machine scheduling problem ⋮ Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
Cites Work
This page was built for publication: Probabilistic analysis of the minimum weighted flowtime scheduling problem
