Inequalities and Bounds in Stochastic Shop Scheduling

DOI10.1137/0144062zbMath0545.90057OpenAlexW1976484931MaRDI QIDQ3337205

Richard R. Weber, Michael L. Pinedo

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

zbMATH Keywords

exponential distributionmakespanflow shopopen shopflow timeBoundsjop shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops

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