Abstract
This paper considers the scheduling of n jobs on m parallel machines to minimize the weighted number of early and tardy jobs. The single machine case of this problem has been shown to be NP- complete in the strong sense. This problem on m parallel machineis also NP complete in the strong sense and finding an optimal solution appears unlikely. The problem is formulated as an integer linear programming model. In this paper, we propose some meta-heuristics for solving this problem. Extensive computational experiments were performed which gave promising results. Key words: Scheduling, parallel machine, heuristics, metaheuristics, particle swarm optimization, genetic algorithm, simulated annealing, hybrid.
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.
