Uncertain flexible flow shop scheduling problem subject to breakdowns

Uncertain flexible flow shop scheduling problem subject to breakdowns
复制标题

不确定的灵活流水车间调度问题容易出现故障

DOI:
10.3233/jifs-151400
复制
发表时间:
2017
影响因子:
2
通讯作者:
Yuanguo Zhu
Yuanguo Zhu
中科院分区:
计算机科学4区
文献类型:
--
作者:
Jiayu Shen;Yuanguo Zhu

文献摘要

参考文献

被引文献

相似文献

当考虑不确定因素时,柔性流水车间调度问题变得更加复杂。大多数文献都假设机器是连续可用的。但是,机器可能会因为许多原因而不可用,例如故障和有计划的预防性维护。一旦机器出现故障,原计划就无法执行,我们必须根据实际情况进行相应的调整。研究了一类加工维修时间不确定的故障柔性流水车间调度问题。机器是非连续可用的,也就是说,它们在事先未知的任意时刻发生故障。有故障的问题被建模为一系列没有故障的问题。为了解决这一问题,本文采用了遗传算法和粒子群算法。数值算例表明了该方法的有效性。5.
Flexible flow shop scheduling problems become more complex when uncertain factors are taken into consideration. Most literature are under the assumption that machines are continuous available. But, a machine can be unavailable for many reasons, such as breakdown and planned preventive maintenance. Once a machine breaks down, then the original schedule can not be executed and we must make the corresponding adjustment according to the actual situation. This paper deals with a flexible flow shop scheduling problem with uncertain processing and repair time subject to breakdowns. Machines are noncontinuously available, i.e., they break down at arbitrary time instance not known in advance. The problem with breakdowns is modeled as a series of problems without breakdowns. To solve the problem, approaches including genetic algorithm and particle swarm optimization are used in this paper. A numerical example shows the effectiveness of the proposed approach. 5
DOI: 10.1016/s0969-6016(97)00042-7
发表时间: 1998-07
影响因子: 3.1
作者:
A. Allahverdi;J. Mittenthal
通讯作者: A. Allahverdi;J. Mittenthal
DOI: 10.1080/00207543.2010.495088
发表时间: 2011-08
影响因子: 9.2
作者:
S. Hasan;R. Sarker;D. Essam
通讯作者: S. Hasan;R. Sarker;D. Essam
DOI: 10.1016/j.apm.2013.11.037
发表时间: 2014-06-01
影响因子: 5
作者:
Gao, Yuan;Yao, Kai
通讯作者: Yao, Kai
DOI: 10.1007/s00500-014-1392-8
发表时间: 2014-07
期刊: Soft Computing
影响因子: 4.1
作者:
K. Yao
通讯作者: K. Yao
DOI: 10.1057/jors.1995.122
发表时间: 1995-07
影响因子: 3.6
作者:
A. Allahverdi
通讯作者: A. Allahverdi