A Sustainable Parallel-machine Scheduling Problem with Time Constraint Based on Hybrid Metaheuristic Algorithm

被引：2
|
作者：
Lu, Hong [1 ]
Qiao, Fei [1 ]
机构：
[1] Tongji Univ, Sch Elect & Informat Engn, Shanghai, Peoples R China
来源：
2020 CHINESE AUTOMATION CONGRESS (CAC 2020) | 2020年
基金：
中国国家自然科学基金;
关键词：
sustainable scheduling; parallel machine; energy consumption; time constraint; metaheuristic; LOCAL SEARCH; TARDINESS;
D O I：
10.1109/CAC51589.2020.9327164
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Sustainable scheduling is of great significance for modern manufacturing companies' long-term development. In this paper, we focus on a sustainable parallel-machine scheduling problem with time constraint, which comes from a rubber manufacturing enterprise. Sustainable demands of this problem include economic benefit (completion time constraint) and environmental effect (energy consumption objective). Besides, this problem not only schedule jobs but also decide the processing speed of machines. We analyze the complexity of the problem and develop a hybrid metaheuristic algorithm to effectively tackle the problem. Experimental results of a case study and comparative analysis show the effectiveness of the proposed algorithm.
引用
收藏
页码：1506 / 1510
页数：5
相关论文
共 50 条
12345