Minimizing resource consumption on uniform parallel machines with a bound on makespan

被引：37

作者：

Ji, Min ^{[1
]}

Wang, Jen-Ya ^{[2
]}

Lee, Wen-Chiung ^{[3
]}

机构：

[1] Zhejiang Gongshang Univ, Sch Comp Sci & Informat Engn, Contemporary Business & Trade Res Ctr, Hangzhou 310018, Zhejiang, Peoples R China

[2] Hungkuang Univ, Dept Comp Sci & Informat Management, Shalu 43302, Taiwan

[3] Feng Chia Univ, Dept Stat, Taichung 40724, Taiwan

来源：

COMPUTERS & OPERATIONS RESEARCH | 2013年 / 40卷 / 12期

基金：

中国国家自然科学基金;

关键词：

Scheduling; Uniform parallel machine; Makespan; Resource consumption; ALGORITHM;

D O I：

10.1016/j.cor.2013.06.011

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. (C) 2013 Elsevier Ltd. All rights reserved.

引用

页码：2970 / 2974

页数：5

共 50 条

[41] Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
Elidrissi, Abdelhak
Benmansour, Rachid
Hasani, Keramat
Werner, Frank
[J]. COMPUTERS & OPERATIONS RESEARCH, 2024, 167
[42] A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines
Purushothaman Damodaran
Don Asanka Diyadawagamage
Omar Ghrayeb
Mario C. Vélez-Gallego
[J]. The International Journal of Advanced Manufacturing Technology, 2012, 58 : 1131 - 1140
[43] A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
Liu, Peihai
Lu, Xiwen
Fang, Yang
[J]. JOURNAL OF SCHEDULING, 2012, 15 (01) : 77 - 81
[44] A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
Peihai Liu
Xiwen Lu
Yang Fang
[J]. Journal of Scheduling, 2012, 15 : 77 - 81
[45] Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines
Johnny C. Ho
Francisco J. López
Alex J. Ruiz-Torres
Tzu-Liang (Bill) Tseng
[J]. Journal of Intelligent Manufacturing, 2011, 22 : 179 - 190
[46] A Job Scheduling Model and Heuristic Algorithm for Minimizing the Range of Lateness and Makespan on Parallel Machines
HUANG Decai Zhejiang University of technology
[J]. Journal of Systems Science and Systems Engineering, 1998, (01) : 51 - 56
[47] Minimizing makespan on parallel batch processing machines with two-dimensional rectangular jobs
Zhou, Shengchao
Jia, Zhaohong
Jin, Mingzhou
Du, Ni
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169
[48] Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines
Ho, Johnny C.
Lopez, Francisco J.
Ruiz-Torres, Alex J.
Tseng, Tzu-Liang
[J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2011, 22 (02) : 179 - 190
[49] Makespan minimization for multiple uniform machines
Lin, Chien-Hung
Liao, Ching-Jong
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (04) : 983 - 992
[50] Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling
Noman, Mohammed A.
Alatefi, Moath
Al-Ahmari, Abdulrahman M.
Ali, Tamer
[J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021

← 1 2 3 4 5 →