Paper Info
Title
A Hybrid Searching Method For The Unrelated Parallel Machine Scheduling Problem
Abstract
The work addresses the NP-hard problem of scheduling a set of jobs to unrelated parallel machines with the overall objective of minimizing makespan. The solution presented proposes a greedy constructive algorithm followed by an application of a Variable Neighborhood Decent strategy that continually improves the incumbent solution until a local optimum is reached. The strength of the approach lies in the adoption of different objectives at various stages of the search to avoid early local optimum entrapment and, mainly, in the hybridization of heuristic methods and mathematical programming for the definition and exploration of neighborhood structures. Experimental results on a large set of benchmark problems attest to the efficacy of the proposed approach.
Year
DOI
Venue
2010
10.1007/978-3-642-16239-8_31
ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS
Keywords
Field
DocType
parallel machine scheduling, hybrid optimization, variable neighborhood search, mixed-integer programming
Heuristic,Mathematical optimization,Machine scheduling,Job shop scheduling,Variable neighborhood search,Computer science,Scheduling (computing),Local optimum,Nurse scheduling problem,Integer programming,Artificial intelligence,Machine learning
Conference
Volume
ISSN
Citations 
339
1868-4238
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Christoforos Charalambous1504.35
Krzysztof Fleszar236825.38
Khalil S. Hindi339822.75