Journal
INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS
Volume 21, Issue 4, Pages -Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0218213012400192
Keywords
Unrelated parallel machine scheduling; hybrid optimization; variable neighborhood decent; mixed-integer programming
Ask authors/readers for more resources
The NP-hard problem of scheduling jobs on unrelated parallel machines with the objective of minimizing the makespan is addressed. A variable neighborhood descent heuristic hybridized with mathematical programming is proposed. A new constructive heuristic is also introduced to seed the search with a solution residing in a promising region. The strength of the approach lies in the adoption of appropriately chosen optimization criteria that avoid early local optimum entrapment and in the hybridization of the heuristic with mathematical programming for the exploration of the large neighborhood structures. Experimental results on a large set of benchmark problem instances attest to the efficacy of the proposed approach.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available