期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2015
卷号：8
期号：10
页码：299-310
DOI：10.14257/ijhit.2015.8.10.27
出版社：SERSC
摘要：Traditional flexible flow shop scheduling cannot adapt to the work processes with existence of parallel machines, and blocks or limits the processes with no-wait constraints. Firstly, according to the problem in NWBFFSSP, which minimizes the maximum time used in the flow shop, an optimal solving model has been designed to realize the flexible flow shop scheduling with multi constraints; besides, for the distribution of machinery is improved, Finally, in the solving process, a real-time release priority strategy has been proposed to determine processing machine for each work piece. Furthermore, a methodology to detect work piece conflicts has been introduced while the conflicts are then eliminated by a kind of right moving strategy based on the maximum difference. The experimental results verify the effectiveness and feasibility of the proposed algorithm
