Minimizing non-processing energy consumption/total weighted tardiness & earliness, and makespan into typical production scheduling model-the job shop scheduling problem

被引:6
作者
Jyothi, Kilari [1 ]
Dubey, R. B. [2 ]
机构
[1] SRM Univ Delhi NCR, Dept Elect & Commun Engn, Sonepat, Haryana, India
[2] SRM Univ Delhi NCR, Dept Elect & Elect Engn, Sonepat, Haryana, India
关键词
Hybrid approach; total weighted tardiness and earliness; job shop scheduling; machine status; non-processing energy consumption; makespan; MULTIOBJECTIVE GENETIC ALGORITHM; POWER-CONSUMPTION; CARBON FOOTPRINT; OPTIMIZATION; EFFICIENCY; SEARCH; TIME;
D O I
10.3233/JIFS-222362
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This manuscript proposes a hybrid method to solve the job shop scheduling problem (JSP). Here, the machine consumes different amounts of energy for processing the tasks. The proposed method is the joint execution of Feedback Artificial Tree (FAT) and Atomic Orbital Search (AOS), hence it is called the FAT-AOS method. The aim of the proposed multi-objective method is to lessen the non-processing energy consumption (NEC), total weighted tardiness and earliness (TWET), and makespan (Cmax). Depending on the machine's operating status, such as working, standby, off, or idle, the energy-consumption model of the machine is constructed. The NEC is the essential metric and the Cmax and TWET are the classical performance metrics used to predict the effects of energy effectiveness in JSP. The proposed AOS technique optimizes the objective of the system and FAT is used to predict the optimal outcome. The proposed method's performance is implemented in MATLAB and is compared with various existing methods. From this simulation, under the 15x15_1 instance, the proposed method makes the span the best value of 1370, the median is 1720, and the worst value become 2268 is obtained.
引用
收藏
页码:6959 / 6981
页数:23
相关论文
共 47 条
[21]   The feedback artificial tree (FAT) algorithm [J].
Li, Q. Q. ;
He, Z. C. ;
Li, Eric .
SOFT COMPUTING, 2020, 24 (17) :13413-13440
[22]   A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan [J].
Lian, Zhigang ;
Jiao, Bin ;
Gu, Xingsheng .
APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (02) :1008-1017
[23]   A multi-objective genetic algorithm for optimisation of energy consumption and shop floor production performance [J].
Liu, Ying ;
Dong, Haibo ;
Lohse, Niels ;
Petrovic, Sanja .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2016, 179 :259-272
[24]   An investigation into minimising total energy consumption and total weighted tardiness in job shops [J].
Liu, Ying ;
Dong, Haibo ;
Lohse, Niels ;
Petrovic, Sanja ;
Gindy, Nabil .
JOURNAL OF CLEANER PRODUCTION, 2014, 65 :87-96
[25]   Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning [J].
Luo, Shu .
APPLIED SOFT COMPUTING, 2020, 91
[26]   Operational methods for minimization of energy consumption of manufacturing equipment [J].
Mouzon, Gilles ;
Yildirim, Mehmet B. ;
Twomey, Janet .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2007, 45 (18-19) :4247-4271
[27]   Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm [J].
Piroozfard, Hamed ;
Wong, Kuan Yew ;
Wong, Wai Peng .
RESOURCES CONSERVATION AND RECYCLING, 2018, 128 :267-283
[28]   An improved electromagnetism-like mechanism algorithm for energy-aware many-objective flexible job shop scheduling [J].
Qu, Minghao ;
Zuo, Ying ;
Xiang, Feng ;
Tao, Fei .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2022, 119 (7-8) :4265-4275
[29]   Optimally detecting and classifying the transmission line fault in power system using hybrid technique [J].
Rajesh, P. ;
Kannan, R. ;
Vishnupriyan, J. ;
Rajani, B. .
ISA TRANSACTIONS, 2022, 130 :253-264
[30]  
Rajesh P., 2020, EUR J ELECT ENG, V22, P224, DOI [DOI 10.18280/EJEE.224-509, 10.18280/ejee.224-509]