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)...
This paper addresses the problem of makespan minimization on unrelated parallel machines with sequen...
AbstractIn this paper, we compare three multi-objective algorithms based on Variable Neighborhood Se...
Grid computing solves high performance and high-throughput computing problems through sharing resour...
Green machine scheduling consists in the allocation of jobs in order to maximize production, in view...
In many real scheduling environments, a job processed later needs longer time than the same job when...
The unrelated parallel machine scheduling problem with sequence dependent setup times (UPMSP-SDST) a...
This article addresses a challenging industrial problem known as the unrelated parallel machine sche...
AbstractTraditionally in metal cutting, it is assumed that a machine tool can process at most one op...
Manufacturing is a broad field with different types of production processes. Therefore, specific pro...
Variable neighborhood search is a local search metaheuristic that uses sequentially different neighb...
AbstractGrid computing solves high performance and high-throughput computing problems through sharin...
In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VN...
Variable neighbourhood search (VNS) is one of the most recent metaheuristics used for solving combin...
In recent years sustainability in manufacturing has become a fundamental topic in the scientific li...
This work implements and compares four algorithms based on Variable Neighborhood Search (VNS), named...
This paper addresses the problem of makespan minimization on unrelated parallel machines with sequen...
AbstractIn this paper, we compare three multi-objective algorithms based on Variable Neighborhood Se...
Grid computing solves high performance and high-throughput computing problems through sharing resour...
Green machine scheduling consists in the allocation of jobs in order to maximize production, in view...
In many real scheduling environments, a job processed later needs longer time than the same job when...
The unrelated parallel machine scheduling problem with sequence dependent setup times (UPMSP-SDST) a...
This article addresses a challenging industrial problem known as the unrelated parallel machine sche...
AbstractTraditionally in metal cutting, it is assumed that a machine tool can process at most one op...
Manufacturing is a broad field with different types of production processes. Therefore, specific pro...
Variable neighborhood search is a local search metaheuristic that uses sequentially different neighb...
AbstractGrid computing solves high performance and high-throughput computing problems through sharin...
In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VN...
Variable neighbourhood search (VNS) is one of the most recent metaheuristics used for solving combin...
In recent years sustainability in manufacturing has become a fundamental topic in the scientific li...
This work implements and compares four algorithms based on Variable Neighborhood Search (VNS), named...
This paper addresses the problem of makespan minimization on unrelated parallel machines with sequen...
AbstractIn this paper, we compare three multi-objective algorithms based on Variable Neighborhood Se...
Grid computing solves high performance and high-throughput computing problems through sharing resour...