Minimizing total expected costs in the two-machine, stochastic flow shop

DOI10.1016/0167-6377(83)90037-8zbMath0506.90038OpenAlexW1987283886MaRDI QIDQ1837103

Frank G. Forst

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

zbMATH Keywords

exponential distributionsjob processing timesn-jobtotal expected linear cost functiontwo-machine flowshop sequencing problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• Unnamed Item
• nx2 flowshop sequencing problem with random processing times
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Scheduling with Random Service Times
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

This page was built for publication: Minimizing total expected costs in the two-machine, stochastic flow shop