Probabilistic analysis of the minimum weighted flowtime scheduling problem

DOI10.1016/0167-6377(92)90034-ZMaRDI QIDQ1197880zbMATH OpenFDO

Authors L. Stougie, Sara Van De Geer, Alberto Marchetti-Spaccamela, Wansoo T. Rhee

Publication date 16 January 1993

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

zbMATH Keywords

central limit theoremlaw of large numberslaw of the iterated logarithmasymptotic optimalitygreedy heuristicminimal weighted flow time scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Recommendations

• Probabilistic Analysis of a Machine Scheduling Problem
• Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
• Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem
• On the asymptotic optimality of algorithms for the flow shop problem with release dates
• Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

Cites work

• scientific article; zbMATH DE number 4099020 (Why is no real title available?)
• scientific article; zbMATH DE number 3658755 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The minimum distance method of testing

Cited in

(11)

• Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
• On rates of convergence and asymptotic normality in the multiknapsack 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
• Scheduling and due-date quotation in a make-to-order supply chain
• Weighted flow time bounds for scheduling identical processors
• Probabilistic Analysis of a Machine Scheduling Problem
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling
• Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• A probabilistic analysis of the multi-period single-sourcing problem

This page was built for publication: Probabilistic analysis of the minimum weighted flowtime scheduling problem

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