Birleşik denetim çizelgeleme problemi için bir karma tamsayılı doğrusal programlama gösterimi

In this thesis, we suggest a Mixed Integer Linear Programming (MILP) for the Combined Audit Scheduling Problem (CASP). This problem is faced by many medium and large-sized organizations and the importance of the problem is increased day by day with an increasing number of management system standards (MSS). CASP is a kind of Resource Constrained Multi-Project Scheduling Problem (RCMPSP) and requires that assigning auditors to audits according to their skills for few management systems where audits are grouped into engagements for each organizational function or process. We assume that each audit has the same processing steps based on ISO 19011:2018 guidelines for auditing management system and show how to construct an Activity On Network (AON) for CASP. The proposed model includes tailor-made constraints for the CASP. The model minimizes firstly throughput time of each engagement and after arrival time of each task. An illustrative real-life problem has been introduced and a feasible solution is attained in limited time by this model. Finally, the results are demonstrated with a Gantt chart and discussed.