An MILP Model for the Internal Audit Scheduling Problem
| Autor: | M. E. Angun, Temel Öncan, V. Yildirim |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
050210 logistics & transportation
Mathematical optimization 021103 operations research Job shop scheduling Computer science 05 social sciences 0211 other engineering and technologies Context (language use) 02 engineering and technology Solver Internal audit 0502 economics and business Management system Task analysis Complex problems Integer programming |
| Zdroj: | IEEM |
| Popis: | In this study we develop a Mixed Integer Linear Programming (MILP) formulation for the internal Audit Scheduling Problem (ASP) which arises in many organizations. The developed model consists of tailor-made constraints for the ASP in the context of management system standards. An illustrative real-world problem has been introduced and solved by a state-of-the-art commercial solver. The computational efficiency of the proposed MILP formulation is promising to solve large-scale and complex problems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|