.png){kind=icon}
.png){kind=icon}
Return
A hybrid metaheuristic algorithm for a parallel machine scheduling problem with dependent setup times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2019.03.051.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work proposes a hybrid algorithm that combines GRASP and Variable Neighborhood Search for solving a parallel machine scheduling problem with dependent setup times for minimizing the total completion time. The aim of the problem is to assign jobs to machines and determine the order in which jobs have to be processed on the machines, in such a way that the sum of the completion times of all jobs is minimized. The designed algorithm consists of two phases: construction and improvement, that is performed by means of a general variable neighborhood search. The instances considered to test our algorithm are taken from the literature and the results are compared with the exact solutions obtained by a mathematical model and with the solutions provided by the best heuristic from the literature, which is outperformed by the proposed hybrid algorithm.
Keywords:
Parallel machine scheduling
Total completion time
Setup time
GRASP
Variable neighborhood search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations