scientific article; zbMATH DE number 4064442

MaRDI QIDQ3798207zbMATH OpenFDO

Authors Richard Weber

Publication date 1982

zbMATH Keywords

amount of processingflowtime minimizationparallel processingprobability distributions

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)

Recommendations

• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Scheduling stochastic jobs with due dates on parallel machines
• Inequalities and bounds for the scheduling of stochastic jobs on parallel machines
• Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
• Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
• Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
• Approximation results in parallel machines stochastic scheduling
• scientific article; zbMATH DE number 4058854

Cited in

(28)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Minimizing expected makespans of multi-priority classes of jobs on uniform processors
• Scheduling stochastic jobs with increasing hazard rate on identical parallel machines
• A note on Lehtonen's schedule on parallel processors
• Stochastic scheduling on parallel machines to minimize discounted holding costs
• The ``least flexible job first rule in scheduling and in queueing
• Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
• Scheduling independent tasks to minimize the makespan on identical machines
• Stochastically minimizing the makespan in flow shops
• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
• Stochastic scheduling problems II-set strategies-
• Stochastic flowshop no-wait scheduling
• Inequalities and bounds for the scheduling of stochastic jobs on parallel machines
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
• scientific article; zbMATH DE number 4058854 (Why is no real title available?)
• Exponentially distributed jobshop scheduling problems.
• Scheduling jobs with exponential processing times on parallel machines
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• On the optimality of LEPT and cµ rules for machines in parallel
• On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
• The optimality of LEPT in parallel machine scheduling
• scientific article; zbMATH DE number 947476 (Why is no real title available?)
• Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
• Scheduling stochastic jobs with due dates on parallel machines
• Scheduling parallel jobs to minimize the makespan
• Scheduling semi-malleable jobs to minimize mean flow time

This page was built for publication:

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