Abstract
Parallel machine problem is a typical scheduling problem with wide applications in practice. As for the scheduling criteria, the total weighted tardiness is always regarded as one of the most important criteria in real situations. The problem of scheduling a given set of independent jobs on unrelated parallel machines to minimize the total weighted tardiness is studied in this paper, which is known to be NP-hard in strong sense. An ant colony optimization (ACO) algorithm is presented with the following features: (1) extending the use of VMDD heuristic rule from single machine situation to unrelated parallel machine environment; (2) incorporating PGA gene transfer operator in local search. The computational experiment shows that the proposed ACO algorithm strongly outperforms the traditional heuristic rule-VMDD and the general ACO algorithm without gene transfer operator.
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 callDisclaimer: 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.
