Metaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs

摘要

This paper considers the scheduling ofnjobs onmparallel 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 problemonmparallel machineisalsoNP 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.