期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2013
卷号：1
期号：4
出版社：S&S Publications
摘要：This paper studies two stage flow shop scheduling problem in which processing times are associatedwith their respective probabilities and transportation times from one machine to another are given. The objective of thestudy is to get optimal sequence of jobs in order to minimize the total elapsed time. The given problem is solved withbranch and bound method. The method is illustrated by numerical example.
关键词：Transportation Time; processing time; elapsed time; Branch and Bound
