Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints

DOI10.1287/MNSC.30.7.883MaRDI QIDQ3220335zbMATH OpenOpenAlexFDO

Authors Gideon Weiss, Michael L. Pinedo

Publication date 1984

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.30.7.883

zbMATH Keywords

identical parallel machinesmaximum completion timeoptimal policypreemptive schedulingresource constraintstochastic scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines
• Scheduling jobs with exponential processing times on parallel machines
• Scheduling tasks with exponential duration on unrelated parallel machines
• Scheduling two classes of exponential jobs on parallel processors: structural results and worst-case analysis
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Exponentially distributed jobshop scheduling problems.
• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
• Scheduling jobs with equal processing times subject to machine eligibility constraints
• Scheduling on two identical machines with a speed-up resource

Cited in

(10)

• A note on the two machine job shop with exponential processing times
• Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines
• 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
• Scheduling two classes of exponential jobs on parallel processors: structural results and worst-case analysis
• On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization
• scientific article; zbMATH DE number 6796346 (Why is no real title available?)
• Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines

This page was built for publication: Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints

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