Minimizing total expected costs in the two-machine, stochastic flow shop
type: Item
instance of: scholarly article
title: Minimizing total expected costs in the two-machine, stochastic flow shop
zbMATH Open document ID: 0506.90038
DOI: 10.1016/0167-6377(83)90037-8
author: Frank G. Forst
published in: Operations Research Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 3799382
zbMATH Keywords: n-job
zbMATH Keywords: two-machine flowshop sequencing problem
zbMATH Keywords: job processing times
zbMATH Keywords: exponential distributions
zbMATH Keywords: total expected linear cost function
MaRDI profile type: Publication
full work available at URL: 0167-6377(83)90037-8
OpenAlex ID: W1987283886
cites work: Q4658190
cites work: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
cites work: Minimizing the Expected Makespan in Stochastic Flow Shops
cites work: nx2 flowshop sequencing problem with random processing times
cites work: Scheduling with Random Service Times
description: scientific article; zbMATH DE number 3799382