Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal on Artificial Intelligence Tools
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
