当前位置: X-MOL 学术J. Comb. Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints
Journal of Combinatorial Optimization ( IF 1 ) Pub Date : 2020-06-20 , DOI: 10.1007/s10878-020-00607-y
Norelhouda Sekkal , Fayçal Belkaid

Production systems are subject to machine deterioration and resource consumption constraints. The deterioration increases the processing time which leads to an increase in resource consumption. In this study, we investigate and model the behavior of a parallel machine scheduling problem with respect to the processing time. The machine is subject to deterioration and includes two resource consumption constraints. The first resource R1 controls the processing time so that additional amounts of R1 decrease the processing time. The second R2 is controlled by the actual processing time so that R2 consumption is a linear function of the actual processing time. The increment of R1 consumption leads to processing time and so R2 decrement. Solving this problem consists in finding the optimal schedule that will minimize both makespan and resources cost. This paper provides a mathematical programming model. In fact, due to the deterioration effect and the two resource consumptions, solving such a problem may be very difficult and requires a large computational time. In this paper, we introduce a multi objective simulated annealing (MOSA) in order to solve the combinatorial optimization problem related to finding the best combination (machine, job, position, R1). Literally the best jobs assignment and resources allocation so that makespan and resources cost are minimized. In order to improve the quality of the results we also developed a 2-steps algorithm by decomposing the original problem into two sub problems: an assignment problem and a resources allocation problem. Some simulations were performed to analyze the performances of the two algorithms. The results show that the 2-steps algorithm is very efficient and outperforms MOSA.

中文翻译:

多目标模拟退火解决具有退化效应和资源消耗约束的相同并行机调度问题

生产系统容易受到机器性能下降和资源消耗的限制。劣化增加了处理时间,这导致资源消耗的增加。在这项研究中,我们针对处理时间调查并建模了并行机器调度问题的行为。机器容易老化,并且包括两个资源消耗约束。第一资源R 1控制处理时间,使得R 1的附加量减少处理时间。第二R 2由实际处理时间控制,使得R 2消耗是实际处理时间的线性函数。R 1的增量消耗量导致处理时间,因此R 2减少。解决此问题的方法是找到可以将制造时间和资源成本降至最低的最佳计划。本文提供了一个数学编程模型。实际上,由于恶化效果和两个资源消耗,解决这样的问题可能非常困难并且需要大量的计算时间。在本文中,我们引入了多目标模拟退火(MOSA),以解决与找到最佳组合(机器,作业,位置,R 1)相关的组合优化问题。)。从字面上看,最佳的工作分配和资源分配是为了使制造时间和资源成本最小化。为了提高结果的质量,我们还通过将原始问题分解为两个子问题(分配问题和资源分配问题)开发了一种两步算法。进行了一些仿真,以分析这两种算法的性能。结果表明,两步算法非常有效,优于MOSA。
更新日期:2020-06-20
down
wechat
bug