The optimality of LEPT in parallel machine scheduling

DOI10.2307/3215156MaRDI QIDQ4322031zbMATH OpenOpenAlexFDO

Authors Cheng-Shang Chang, Rhonda Righter

Publication date 20 March 1996

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3215156

zbMATH Keywords

longer expected processing time firstmakespanpreemptive scheduling on parallel machinesstochastic scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Recommendations

• scientific article; zbMATH DE number 4064442
• On the optimality of LEPT and cµ rules for machines in parallel
• On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines

Cited in

(8)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• A note on Lehtonen's schedule on parallel processors
• The ``least flexible job first rule in scheduling and in queueing
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
• The Asymptotic Optimality of the LPT Rule
• On the optimality of LEPT and cµ rules for machines in parallel
• On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
• A case for on-machine load balancing

This page was built for publication: The optimality of LEPT in parallel machine scheduling

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