A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors

DOI10.1109/TC.1984.1676440zbMath0528.68022OpenAlexW1990975283MaRDI QIDQ3309057

Michael R. Garey, Satish K. Tripathi, Edward G. jun. Coffman, Ashok K. Agrawala

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1984.1676440

zbMATH Keywords

stochastic optimizationstochastic schedulingrouting problemsmean flow time minimizationuniform processor systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling jobs on heterogeneous processors, Job scheduling to minimize expected weighted flowtime on uniform processors, AN INDIVIDUAL AND SOCIALLY OPTIMAL POLICY MINIMIZING EXPECTED FLOW TIMES, Optimal Routing of Fixed Size Jobs to Two Parallel Servers, A dynamic-server queuing simulation., A case for on-machine load balancing, Minimizing expected makespans of multi-priority classes of jobs on uniform processors, Common due-date assignment and scheduling on single machine with exponential processing times., Managing Queues with Heterogeneous Servers, Distributionally robust single machine scheduling with risk aversion, Robust scheduling on a single machine to minimize total flow time, Analysis of computer job control under uncertainty, Influencing waiting lists, Stochastic single machine scheduling problem as a multi-stage dynamic random decision process, Stalling for solving slow server problem, The Stochastic Sequential Assignment Problem With Random Deadlines, Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines, Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines, A note on Optimal control of a queueing system with two heterogeneous servers