Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines

DOI10.1287/opre.33.6.1381zbMath0581.90036OpenAlexW2107215333MaRDI QIDQ3703565

Gideon Weiss, Michael L. Pinedo

Publication date: 1985

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.33.6.1381

zbMATH Keywords

stochastic schedulingexpected makespanintree precedence constraintshighest level first policyindependent exponentially distributed processing timestwo identical parallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

KBSS: A knowledge-based system for scheduling in automated manufacturing ⋮ Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs

This page was built for publication: Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines