Stochastic limit laws for schedule makespans

DOI10.1080/15326349608807382MaRDI QIDQ4883748zbMATHOpenAlexFDO

Authors Ward Whitt, E. G. jun. Coffman, L. Flatto

Publication date 7 November 1996

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349608807382

zbMATH Keywords

Markov chainrates of convergencecentral limit theoremssuperpositionsmall setsmakespan schedulingstationary marked point processesmultiprocessor versionon-line greedy policy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1775053
• Bounds on optimal values in stochastic scheduling
• Makespan-related criteria for comparing schedules in stochastic environments
• Technical note The stochastic flowshop makespan: some further results
• Bounds for discounted stochastic scheduling problems
• A computational study on bounding the makespan distribution in stochastic project networks

Cited in

(5)

• Scheduling independent tasks to minimize the makespan on identical machines
• Asymptotic properties of stochastic greedy bin-packing
• Superposition of renewal processes and an application to multi-server queues
• On the Expected Relative Performance of List Scheduling
• Embedded Markov chain analysis of the superposition of renewal processes

This page was built for publication: Stochastic limit laws for schedule makespans

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