Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines

DOI10.1017/S0269964800002436zbMATH Open1134.90407OpenAlexW2124379850MaRDI QIDQ3416042FDOQ3416042

Authors: Chueng Chiu Huang, Gideon Weiss 

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/s0269964800002436

Recommendations

• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• scientific article; zbMATH DE number 4064442
• On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
• The optimality of LEPT in parallel machine scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• Scheduling for Minimum Total Loss Using Service Time Distributions
• Approximation results in parallel machines stochastic scheduling
• Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling

Cited In (11)

• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines
• On preemptive scheduling: A general setting for the two-phase method
• Expected makespan minimization on identical machines in two interconnected queues
• On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
• Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
• Scheduling stochastic jobs with increasing hazard rate on identical parallel machines
• A case for on-machine load balancing
• Title not available (Why is that?)
• Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime

This page was built for publication: Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines

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