Minimizing resource consumption on uniform parallel machines with a bound on makespan
Minimizing resource consumption on uniform parallel machines with a bound on makespan
复制标题
DOI：
10.1016/j.cor.2013.06.011
复制
发表时间：
2013-12
期刊：
影响因子：
--
通讯作者：
Min Ji;Jen-Ya Wang;Wen-Chiung Lee
中科院分区：
文献类型：
--
作者：
Min Ji;Jen-Ya Wang;Wen-Chiung Lee
随着环境保护这一关键问题的出现，有效管理自然资源和/或减少碳排放量变得比以往任何时候都更加重要。本文引入了一个均匀平行机调度问题，其目标是最小化资源消耗，使最大完工时间不超过某一水平。我们证明了该问题是强NP-难的。在此基础上，给出了紧致下界和粒子群优化算法。最后给出了一些计算结果。
With the crucial issue of environmental protection, managing natural resources efficiently and/or reducing the amount of carbon emissions have become more important than ever. In this paper, we introduce a uniform parallel machine scheduling problem where the objective is to minimize resource consumption given that the maximum completion time does not exceed a certain level. We show that the problem is strongly NP-hard. A tight lower bound and a particle swarm optimization algorithm are then developed. Finally, some computational results are provided.