Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
From MaRDI portal
(Redirected from Publication:5488538)
Recommendations
- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
- scientific article; zbMATH DE number 4064442
- Stochastic scheduling on two non-identical parallel processors
- Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
- Scheduling stochastic jobs with due dates on parallel machines
Cites work
- Games against nature
- Minimizing expected makespans on uniform processor systems
- 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
- Scheduling with deadlines and loss functions
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
Cited in
(4)- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
- Expected makespan minimization on identical machines in two interconnected queues
- scientific article; zbMATH DE number 4064442 (Why is no real title available?)
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
This page was built for publication: Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488538)