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

This paper analyzes the n-job, two-machine flowshop sequencing problem with job processing times following exponential distributions. Three sufficient conditions are derived for determining a job sequence which minimizes a total expected linear cost function. Stronger results are obtained for severa...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters 1983, Vol.2 (2), p.58-61
Main Author: Forst, Frank G
Format: Article
Language:English
Subjects:
flow shop
sequencing
Stochastic models
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper analyzes the n-job, two-machine flowshop sequencing problem with job processing times following exponential distributions. Three sufficient conditions are derived for determining a job sequence which minimizes a total expected linear cost function. Stronger results are obtained for several special cases.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(83)90037-8