Redirigiendo al acceso original de articulo en 15 segundos...
Inicio  /  Applied Sciences  /  Vol: 11 Par: 11 (2021)  /  Artículo
ARTÍCULO
TITULO

Variable Neighborhood Strategy Adaptive Search to Solve Parallel-Machine Scheduling to Minimize Energy Consumption While Considering Job Priority and Control Makespan

Rujapa Nanthapodej    
Cheng-Hsiang Liu    
Krisanarach Nitisiri and Sirorat Pattanapairoj    

Resumen

Environmental concerns and rising energy prices put great pressure on the manufacturing industry to reduce pollution and save energy. Electricity is one of the main machinery energy sources in a plant; thus, reducing energy consumption both saves energy costs and protects our planet. This paper proposes the novel method called variable neighborhood strategy adaptive search (VaNSAS) in order to minimize energy consumption while also considering job priority and makespan control for parallel-machine scheduling problems. The newly presented neighborhood strategies of (1) solution destroy and repair (SDR), (2) track-transition method (TTM), and (3) multiplier factor (MF) were proposed and tested against the original differential evaluation (DE), current practice procedure (CU), SDR, TTM, and MF for three groups of test instances, namely small, medium, and large. Experimental results revealed that VaNSAS outperformed DE, CU, SDR, TTM, and MF, as it could find the optimal solution and the mathematical model in the small test instance, while the DE could only find 25%, and the others could not. In the remaining test instances, VaNSAS performed 16.35?19.55% better than the best solution obtained from Lingo, followed by DE, CU, SDR, TTM, and MF, which performed 7.89?14.59% better. Unfortunately, the CU failed to improve the solution and had worse performance than that of Lingo, including all proposed methods.

 Artículos similares

       
 
Bao Tong, Jianwei Wang, Xue Wang, Feihao Zhou, Xinhua Mao and Wenlong Zheng    
The optimal delivery route problem for truck?drone delivery is defined as a traveling salesman problem with drone (TSP-D), which has been studied in a wide range of previous literature. However, most of the existing studies ignore truck waiting time at r... ver más
Revista: Applied Sciences

 
Dhidhi Pambudi and Masaki Kawamura    
The quadratic unconstrained binary optimization (QUBO) problem is categorized as an NP-hard combinatorial optimization problem. The variable neighborhood search (VNS) algorithm is one of the leading algorithms used to solve QUBO problems. As neighborhood... ver más
Revista: Algorithms

 
Mehrdad Amirghasemi    
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a... ver más
Revista: Algorithms

 
Ningning Ding, Yuangui Tang, Zhibin Jiang, Yunfei Bai and Shixun Liang    
This paper investigates the station-keeping control of autonomous and remotely-operated vehicles (ARVs) for free-floating manipulation under model uncertainties and external disturbances. A modified adaptive generalized super-twisting algorithm (AGSTA) e... ver más

 
Lev Kazakovtsev, Ivan Rozhnov and Guzel Shkaberina    
The continuous p-median problem (CPMP) is one of the most popular and widely used models in location theory that minimizes the sum of distances from known demand points to the sought points called centers or medians. This NP-hard location problem is also... ver más
Revista: Algorithms