A note on the two machine job shop with exponential processing times

DOI10.1002/NAV.3800280417zbMATH Open0535.90047OpenAlexW2060574560MaRDI QIDQ3320106FDOQ3320106

Authors: Michael L. Pinedo 

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280417

Recommendations

• Exponentially distributed jobshop scheduling problems.
• Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
• Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines
• Stochastic scheduling on two non-identical parallel processors
• Scheduling jobs with exponential processing times on parallel machines

zbMATH Keywords

exponentially distributed processing timesminimization of expected completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (6)

• Exponentially distributed jobshop scheduling problems.
• An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops
• On Klimov's model by two job classes and exponential processing times
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
• Dynamic scheduling in manufacturing systems using Brownian approximations

This page was built for publication: A note on the two machine job shop with exponential processing times

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