Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
From MaRDI portal
Publication:3863417
DOI10.2307/3212936zbMath0427.90051OpenAlexW2045673997MaRDI QIDQ3863417
Gideon Weiss, Michael L. Pinedo
Publication date: 1980
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3212936
dynamic programmingexponential distributionmultiprocessorsexpected makespanexpected lifetimeminimization of expected flowtimepreemptive scheduling of N tasks on m processorsreliability of series system with sparesstochastic preemptive scheduling
Related Items (32)
Resource allocation in grid computing ⋮ Scheduling jobs on heterogeneous processors ⋮ Multi-Actor Markov Decision Processes ⋮ Job scheduling to minimize expected weighted flowtime on uniform processors ⋮ On stochastic optimality of policies in first passage problems ⋮ Optimal sequences in stochastic single machine shops ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ Stochastic scheduling problems I — General strategies ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ A case for on-machine load balancing ⋮ On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS ⋮ On the relation between complexity and uncertainty ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ Analysis of Smith's rule in stochastic machine scheduling ⋮ 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. ⋮ Scheduling stochastic jobs with increasing hazard rate on identical parallel machines ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ Scheduling tasks with exponential duration on unrelated parallel machines ⋮ Single-machine scheduling with exponential processing times and general stochastic cost functions ⋮ Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines ⋮ Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines ⋮ Loading and Sequencing on Parallel Machines ⋮ Markov decision processes with multidimensional action spaces ⋮ Scheduling problems with random processing times under expected earliness/tardiness costs ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ Stochastic Online Scheduling Revisited ⋮ Stochastic scheduling problems II-set strategies- ⋮ The processor minimization problem with independent waiting-time constraints
This page was built for publication: Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
