Inequalities and Bounds in Stochastic Shop Scheduling

DOI10.1137/0144062zbMATH Open0545.90057OpenAlexW1976484931MaRDI QIDQ3337205FDOQ3337205

Authors: Michael L. Pinedo, Richard Weber 

Publication date: 1984

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0144062

Recommendations

• Inequalities for stochastic flow shops and job shops
• Inequalities and bounds for the scheduling of stochastic jobs on parallel machines
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• scientific article; zbMATH DE number 4099021
• Stochastically minimizing the makespan in flow shops

zbMATH Keywords

exponential distributionmakespanflow shopopen shopflow timeBoundsjop shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (7)

• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
• Inequalities for stochastic flow shops and job shops
• Inequalities and bounds for the scheduling of stochastic jobs on parallel machines
• Title not available (Why is that?)
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Makespan-related criteria for comparing schedules in stochastic environments
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine

This page was built for publication: Inequalities and Bounds in Stochastic Shop Scheduling

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