Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
From MaRDI portal
Publication:5488538
DOI10.1017/S0269964800004708zbMath1096.68555OpenAlexW2112039769MaRDI QIDQ5488538
Sem C. Borst, John L. Bruno, Edward 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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Games against nature
- Scheduling with Deadlines and Loss Functions
- Minimizing expected makespans on uniform processor systems
- 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
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
This page was built for publication: Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
