On the optimality of LEPT and cµ rules for machines in parallel
From MaRDI portal
Publication:4021723
Recommendations
- The optimality of LEPT in parallel machine scheduling
- On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
- scientific article; zbMATH DE number 4064442
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Stochastic scheduling on parallel machines to minimize discounted holding costs
Cited in
(9)- On stochastic machine scheduling with general distributional assumptions
- Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem
- Stochastic scheduling on parallel machines to minimize discounted holding costs
- The ``least flexible job first rule in scheduling and in queueing
- A scheduling problem for several parallel servers
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Optimal allocation of machines to distinguishable repairmen in order to maximize some reward functions
- On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
- The optimality of LEPT in parallel machine scheduling
This page was built for publication: On the optimality of LEPT and cµ rules for machines in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021723)