زمان بندي كاركارگاهي انعطاف پذير با در نظر گرفتن محدوديت نگه داري و تعميرات (نت)

FLEXIBLE JOB SHOP SCHEDULING PROBLEM; CONSIDERING MAINTENANCE CONSTRAINT

In most of flexible job shop scheduling models, it is assumed that machines are always available. However in practice, machines may be unavailable for various reasons, such as maintenance. In this article, the flexible job shop scheduling problem is studied considering operation flexibility maintenance constraints. In this study, deterministic machine availability was considered as a non-fixed availability case which is named the maintenance constraint, allowing preemption, and a no-resumption processing regime. Therefore, a mixed integer nonlinear programming model and a hybrid genetic algorithm were proposed for this problem. Computational experiments show the superiority of the proposed algorithm for solving the research problem.