Paper Info
Title
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times
Abstract
The NP-hard problem of scheduling jobs on unrelated parallel machines, in the presence of machine-dependent and sequence-dependent setup times, with the objective of minimizing the makespan, is considered. A variable neighborhood descent search algorithm, hybridized with mathematical programming elements, is presented and its performance is evaluated on a large set of benchmark problem instances. The extensive computational experiments show that the proposed algorithm outperforms previously proposed methods in terms of solution quality as well as computation time.
Year
DOI
Venue
2012
10.1007/s10845-011-0522-8
J. Intelligent Manufacturing
Keywords
Field
DocType
makespan minimisation,large set,benchmark problem instance,variable neighborhood descent heuristic,computation time,mathematical programming element,unrelated parallel machine,np-hard problem,solution quality,sequence-dependent setup time,proposed algorithm,extensive computational experiment,parallel machine scheduling · hybrid optimization · neighborhood search · makespan minimization · mixed-integer programming,mixed integer programming
Mathematical optimization,Makespan minimisation,Heuristic,Job shop scheduling,Search algorithm,Scheduling (computing),Integer programming,Artificial intelligence,Neighborhood search,Machine learning,Mathematics,Computation
Journal
Volume
Issue
ISSN
23
5
1572-8145
Citations 
PageRank 
References 
7
0.56
23
Authors
3
Name
Order
Citations
PageRank
Krzysztof Fleszar136825.38
Christoforos Charalambous2504.35
Khalil S. Hindi339822.75