Scheduling internal audit activities: A stochastic combinatorial optimization problem

Roberto Rossi, S Armagan Tarim, Brahim Hnich, Steven Prestwich, Semra Karacaer

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

The problem of finding the optimal timing of audit activities within an organisation has been addressed by many researchers. We propose a stochastic programming formulation with Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) certainty-equivalent models. In experiments neither approach dominates the other. However, the CP approach is orders of magnitude faster for large audit times, and almost as fast as the MILP approach for small audit times. This work generalises a previous approach by relaxing the assumption of instantaneous audits, and by prohibiting concurrent auditing.
Original languageEnglish
Pages (from-to)325-346
Number of pages22
JournalJournal of Combinatorial Optimization
Issue number3
Early online date21 Jan 2009
Publication statusPublished - Apr 2010

Keywords / Materials (for Non-textual outputs)

  • uncertainty
  • audit scheduling
  • combinatorial optimization
  • mathematical programming
  • constraint programming


Dive into the research topics of 'Scheduling internal audit activities: A stochastic combinatorial optimization problem'. Together they form a unique fingerprint.

Cite this