Bi-objective energy-efficient scheduling in a seru production system considering reconfiguration of serus

被引:2
作者
Lian, Jie [1 ]
Li, Wenjuan [2 ]
Pu, Guoli [1 ]
Zhang, Pengwei [1 ]
机构
[1] Xian Univ Technol, Sch Econ & Management, Xian 710048, Peoples R China
[2] Beijing Inst Math Sci & Applicat, Beijing 101408, Peoples R China
关键词
Seru production; Cell loading; Green scheduling; Seru reconfiguration; NSGA-II; FLEXIBLE JOB-SHOP; PERMUTATION FLOW-SHOP; ELECTRICITY CONSUMPTION; OPTIMIZATION ALGORITHM; PARALLEL MACHINES; CARBON FOOTPRINT; TIME; TARDINESS; MODEL; EARLINESS;
D O I
10.1016/j.suscom.2023.100900
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Owing to movable workstations, light equipment and multi-skilled workers, serus can be constructed, modified and dismantled rapidly. Such an advantage enables serus to be reconfigured in response to frequent changes in product types. As different configurations lead to different processing time and energy consumption, an important issue is how to arrange a best configuration of seru with the tasks assigned to it. To this end, we focus on solving the task dispatching, product sequencing and seru reconfiguration problems simultaneously considering economic and environmental performance. A bi-objective mathematical model with objectives of minimizing the total earliness and tardiness and the total carbon dioxide emission is formulated. The problem is proved to be strongly NP-hard, and a non-dominated sorting genetic algorithm-II (NSGA-II) is developed. The algorithm is tested by a medium-size numerical example and ninety sets of large-size problems. Based on the computational results, the impact of configuration flexibility and the relation between processing time and energy consumption on the value of objective functions is analyzed.
引用
收藏
页数:12
相关论文
共 50 条
[41]   Bi-Objective Re-Entrant Hybrid Flow Shop Scheduling considering Energy Consumption Cost under Time-of-Use Electricity Tariffs [J].
Geng, Kaifeng ;
Ye, Chunming ;
Dai, Zhen Hua ;
Liu, Li .
COMPLEXITY, 2020, 2020
[42]   Bi-objective cyclic scheduling for single hoist with processing-time-window constraints considering buffer-setting [J].
Gao, Zhongshun ;
Zhou, Binghai .
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART I-JOURNAL OF SYSTEMS AND CONTROL ENGINEERING, 2019, 233 (02) :192-203
[43]   Surgical case scheduling problem with fuzzy surgery time: An advanced bi-objective ant system approach [J].
Behmanesh, Reza ;
Zandieh, Mostafa .
KNOWLEDGE-BASED SYSTEMS, 2019, 186
[44]   Solving bi-objective integrated scheduling problem of production, inventory and distribution using a modified NSGA-II [J].
Luo, Qiang ;
Fan, Qing ;
Deng, Qianwang ;
Guo, Xin ;
Gong, Guiliang ;
Liu, Xiahui .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 225
[45]   Multi-Objective Energy-Efficient Interval Scheduling in Hybrid Flow Shop Using Imperialist Competitive Algorithm [J].
Zhou, Rui ;
Lei, Deming ;
Zhou, Xinmin .
IEEE ACCESS, 2019, 7 :85029-85041
[46]   Bi-Objective Job-Shop Scheduling Considering Human Fatigue in Cobotic Order Picking Systems: A Case of an Online Grocer [J].
Vermin, Berry Lance ;
Abbink, David ;
Schulte, Frederik .
5TH INTERNATIONAL CONFERENCE ON INDUSTRY 4.0 AND SMART MANUFACTURING, ISM 2023, 2024, 232 :635-644
[47]   A reinforcement learning-driven adaptive decomposition algorithm for multi-objective hybrid seru system scheduling considering worker transfer [J].
Wu, Yuting ;
Wang, Ling ;
Li, Rui ;
Chen, Jing-fang .
SWARM AND EVOLUTIONARY COMPUTATION, 2024, 88
[48]   Energy-Efficient Integration Optimization of Production Scheduling and Ladle Dispatching in Steelmaking Plants [J].
Han, Dayong ;
Tang, Qiuhua ;
Zhang, Zikai ;
Cao, Jun .
IEEE ACCESS, 2020, 8 :176170-176187
[49]   No-Idle Flowshop Scheduling for Energy-Efficient Production: An Improved Optimization Framework [J].
Cheng, Chen-Yang ;
Lin, Shih-Wei ;
Pourhejazy, Pourya ;
Ying, Kuo-Ching ;
Lin, Yu-Zhe .
MATHEMATICS, 2021, 9 (12)
[50]   An energy-efficient multi-objective optimization for flexible job-shop scheduling problem [J].
Mokhtari, Hadi ;
Hasani, Aliakbar .
COMPUTERS & CHEMICAL ENGINEERING, 2017, 104 :339-352