Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
DOI10.1017/S0269964800004708zbMATH Open1096.68555OpenAlexW2112039769MaRDI QIDQ5488538FDOQ5488538
Authors: Sem Borst, John Bruno, E. G. jun. Coffman, Steven J. Phillips 
Publication date: 22 September 2006
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964800004708
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
- Scheduling with deadlines and loss functions
- Games against nature
- 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
- Minimizing expected makespans on uniform processor systems
Cited In (4)
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)
