当前位置: X-MOL 学术Swarm Evol. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem
Swarm and Evolutionary Computation ( IF 8.2 ) Pub Date : 2020-08-05 , DOI: 10.1016/j.swevo.2020.100747
Zhongshi Shao , Weishi Shao , Dechang Pi

In consideration of the uncertainty of manufacturing system, this paper investigates a distributed fuzzy blocking flow-shop scheduling problem (DFBFSP) in which there are multiple homogeneous factories and each one is set as a flow shop with no intermediate buffers between any consecutive machines. The processing time is uncertain and represented by the fuzzy number. The objective is to minimize the fuzzy makespan among all factories. To address this problem, two constructive heuristics (i.e., INEH and DPFNEH) are firstly proposed based on the problem-specific knowledge and the NEH heuristic. The INEH employs the spread value of fuzzy processing time to generate the initial job sequence. The DPFNEH assigns the partial jobs to factories by reducing the total expected idle time and blocking time. Afterwards, two iterated greedy (IG) methods are presented in which the proposed constructive heuristic is employed to generate the initial solution with high quality. A novel plateau exploration-based local search is incorporated to enhance the quality of solutions. To keep the search vitality, an improved acceptance criterion based on the fuzzy characteristic is designed to avoid falling into the local optimum. Finally, a comprehensive computational experiment and comparisons with the state-of-the-art methods in the literature are conducted based on an extended benchmark set and a new evaluation indicator. The results show that the proposed constructive heuristics and IG methods can effectively and efficiently solve the considered problem.



中文翻译:

分布式模糊阻塞流水车间调度问题的有效启发式和元启发式

考虑到制造系统的不确定性,本文研究了分布式模糊阻塞流水车间调度问题(DFBFSP),其中存在多个同构工厂,每个工厂都设置为流水车间,任何连续机器之间都没有中间缓冲区。处理时间不确定,用模糊数表示。目的是最小化所有工厂之间的模糊制造期。为了解决这个问题,首先基于特定问题的知识和NEH启发式,提出了两种建设性的启发式算法(即INEH和DPFNEH)。INEH使用模糊处理时间的扩展值来生成初始作业序列。DPFNEH通过减少总的预期空闲时间和阻塞时间将部分作业分配给工厂。之后,提出了两种迭代贪婪(IG)方法,其中所提出的构造启发式方法用于生成高质量的初始解。一种新颖的基于高原探索的本地搜索被纳入以提高解决方案的质量。为了保持搜索活力,设计了一种基于模糊特性的改进接受准则,以避免陷入局部最优状态。最后,基于扩展的基准集和新的评估指标,进行了全面的计算实验,并与文献中的最新方法进行了比较。结果表明,所提出的建设性启发式方法和IG方法可以有效地解决所考虑的问题。一种新颖的基于高原探索的本地搜索被纳入以提高解决方案的质量。为了保持搜索活力,设计了一种基于模糊特性的改进接受准则,以避免陷入局部最优状态。最后,基于扩展的基准集和新的评估指标,进行了全面的计算实验,并与文献中的最新方法进行了比较。结果表明,所提出的建设性启发式方法和IG方法可以有效地解决所考虑的问题。一种新颖的基于高原探索的本地搜索被纳入以提高解决方案的质量。为了保持搜索活力,设计了一种基于模糊特性的改进接受准则,以避免陷入局部最优状态。最后,基于扩展的基准集和新的评估指标,进行了全面的计算实验,并与文献中的最新方法进行了比较。结果表明,所提出的建设性启发式方法和IG方法可以有效地解决所考虑的问题。基于扩展的基准集和新的评估指标,进行了全面的计算实验,并与文献中的最新方法进行了比较。结果表明,所提出的建设性启发式方法和IG方法可以有效地解决所考虑的问题。基于扩展的基准集和新的评估指标,进行了全面的计算实验,并与文献中的最新方法进行了比较。结果表明,所提出的建设性启发式方法和IG方法可以有效地解决所考虑的问题。

更新日期:2020-08-05
down
wechat
bug