Minimizing total expected costs in the two-machine, stochastic flow shop
From MaRDI portal
Publication:1837103
DOI10.1016/0167-6377(83)90037-8zbMath0506.90038OpenAlexW1987283886MaRDI QIDQ1837103
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(83)90037-8
exponential distributionsjob processing timesn-jobtotal expected linear cost functiontwo-machine flowshop sequencing problem
Related Items (6)
Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times ⋮ Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function ⋮ A contribution to the stochastic flow shop scheduling problem. ⋮ Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs ⋮ On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops
Cites Work
This page was built for publication: Minimizing total expected costs in the two-machine, stochastic flow shop