文章基本信息

标题：Optimal Three Stage Flow Shop Scheduling in which Processing Time, Set Up Time, Each Associated With Probabilities Including Transportation Time and Jobs in a String of Disjoint Job-Blocks
其他标题：Optimal Three Stage Flow Shop Scheduling in which Processing Time, Set Up Time, Each Associated With Probabilities Including Transportation Time and Jobs in a String of Disjoint Job-Blocks
本地全文：下载
作者：Sameer Sharma
期刊名称：Journal of Natural Sciences Research
印刷版ISSN：2225-0921
电子版ISSN：2225-0921
出版年度：2011
卷号：1
期号：3
页码：18-29
语种：English
出版社：The International Institute for Science, Technology and Education (IISTE)
摘要：The paper deals with n jobs, 3 machines flow shop production scheduling in which processing times and set up times are associated with their respective probabilities involving transportation time and jobs are processed in two disjoint job blocks in a string. A heuristic method with an objective to minimize the total time elapsed time/idle time of the jobs/machines is discussed. A computer program followed by numerical illustration is given to clarify the algorithm. Keywords: Disjoint job-block, Set up time, Processing time, Transportation time, Equivalent job