期刊名称：International Journal of Computational Intelligence Techniques
印刷版ISSN：0976-0466
电子版ISSN：0976-0474
出版年度：2012
期号：572
页码：99-101
出版社：Bioinfo Publications
摘要：This paper considers a nxm no-wait flowshop scheduling problem in which each job has an uncertain processing time on the machines. The objective of this paper pertains to determine an optimal or near optimal sequence for n-job problem which associates ‘weight’ with each job in the sense of relative importance in the process and includes job block and transportation time of jobs from one machine to other to minimize the total weighted mean flow time.
