Аннотация
This paper deals with the flexible job shop scheduling problem with the preventive maintenance constraints where the objectives are to minimize the overall completion time (makespan), the total workload of machines and the workload of the most loaded machine. A fast heuristic algorithm based on a constructive procedure is developed to solve the problem in very short time. The algorithm is tested on the benchmark instances from the literature in order to evaluate its performance. Computational results show that, the proposed heuristic method is computationally efficient and promising for practical problems.
Пользователи данного ресурса
Пожалуйста,
войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)