Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines

DOI10.1017/S0269964800000991MaRDI QIDQ3415915zbMATH OpenFDO

Authors Gideon Weiss, E. G. jun. Coffman, Micha Hofri

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800000991

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
• Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
• scientific article; zbMATH DE number 4064442
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Stochastic scheduling for a two-machine open shop

Cites work

• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
• A note on time-sharing
• Games against nature
• Minimizing expected makespans on uniform processor systems
• Multiple feedback at a single-server station
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• Scheduling for Minimum Total Loss Using Service Time Distributions
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Cited in

(11)

• Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
• Scheduling stochastic jobs with due dates on parallel machines
• Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
• Job-shop resource scheduling via simulating random operations
• A tight 2-approximation for preemptive stochastic scheduling
• Expected makespan minimization on identical machines in two interconnected queues
• Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
• Approximation results in parallel machines stochastic scheduling
• Scheduling stochastic jobs with increasing hazard rate on identical parallel machines
• Stochastic scheduling on two non-identical parallel processors

This page was built for publication: Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines

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