Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Apt K (2003) Principles of constraint programming. Cambridge University Press, New York
Birge JR, Louveaux F (1997) Introduction to stochastic programming. Springer, New York
Bookbinder JH, Tan JY (1988) Strategies for the probabilistic lot-sizing problem with service-level constraints. Manag Sci 34:1096–1108
Boritz JE, Broca DS (1986) Scheduling internal audit activities. Auditing A J Pract Theory 6:1–19
Brailsford SC, Potts CN, Smith BM (1999) Constraint satisfaction problems: Algorithms and applications. Eur J Oper Res 119:557–581
Charnes A, Cooper WW (1959) Chance-constrained programming. Manag Sci 6(1):73–79
Chvtal V (1983) Linear programming. Freeman, New York
Colmerauer A (1985) Prolog in 10 figures. Commun ACM 28(12):1296–1310
Dantzig GB (1951) Maximization of a linear function of variables subject to linear inequalities. In: Activity analysis of production and allocation. Wiley, New York (Chap XXI)
Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton
Darby-Dowman K, Little J, Mitra G, Zaffalon M (1997) Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints 1(3):245–264
Hanus M (1998) Programming with constraints: An introduction by K Marriott and PJ Stuckey. MIT Press, Cambridge. See also J Funct Program 11(2):253–262 (2001)
Hughes J (1977) Optimal internal audit timing. Account Rev 52:56–68
Ilog (2007a) CPLEX 9.0 Users Manual. ILOG Inc, Incline Village, NV
Ilog (2007b) OPL Studio 3.7 Users Manual. ILOG Inc, Incline Village, NV
Jain V, Grossmann IE (2001) Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS J Comput 13:258–276
Jeffreys H (1961) Theory of probability. Clarendon, Oxford
Knechel WR, Benson HP (1991) The optimization approach for scheduling internal audits of division. Decis Sci 22:391–405
Lustig IJ, Puget JF (2001) Program does not equal program: Constraint programming and its relationship to mathematical programming. Interfaces 31:29–53
Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley-Interscience, New York
Proll L, Smith B (1998) Integer linear programming and constraint logic programming approaches to a template design problem. INFORMS J Comput 10:265–275
Regin J-C (1994) A filtering algorithm for constraints of difference in CSPS. In: Proceedings of the national conference on artificial intelligence (AAAI-94), Seattle, WA, USA, pp 362–367
Regin J-C (2003) Global constraints and filtering algorithms. In: Milano M (ed) Constraints and integer programming combined. Kluwer, Dordrecht
Schrijver A (1986) Theory of linear and integer programming. Wiley, New York
Smith B, Brailsford S, Hubbard P, Williams HP (1995) The progressive party problem: integer linear programming and constraint programming compared. In: CP95: Proceedings of the 1st international conference on principles and practice of constraint programming, Marseilles
Tarim SA, Smith B (2008) Constraint programming for computing non-stationary (R,S) inventory policies. Eur J Oper Res 189(3):1004–1021
Tarim SA, Tayfur O, Karacaer S (2008) A mip model for scheduling multi-location internal audit activities. Technical report, Hacettepe University, Dept of Management
Tsang EPK (1993) Foundations of constraint satisfaction. Academic Press, London/San Diego
Van Hentenryck P, Carillon JP (1988) Generality vs. specificity: an experience with AI and or techniques. In: Proceedings of the national conference on artificial intelligence (AAAI-88)
Van Hentenryck P (1989) Constraint satisfaction in logic programming. MIT Press, Cambridge
Van Hentenryck P (1999) The OPL optimization programming language. MIT Press, Cambridge
Ventsel ES (1979) Theory of probability. Nauka, Moscow (in Russian)
Williams HP (1994) Model building in mathematical programming, 3rd edn. Wiley, New York
Wilson D, Ranson R (1971) Internal audit scheduling—a mathematical model. The Internal Auditor, No. July–August, pp. 42–50
Author information
Authors and Affiliations
Corresponding author
Additional information
Roberto Rossi is supported by Science Foundation Ireland under Grant No. 03/CE3/I405 as part of the Centre for Telecommunications Value-Chain-Driven Research (CTVR) and Grant No. 05/IN/I886. S. Armagan Tarim and Brahim Hnich are supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under Grant No. SOBAG-108K027.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Rossi, R., Tarim, S.A., Hnich, B. et al. Scheduling internal audit activities: a stochastic combinatorial optimization problem. J Comb Optim 19, 325–346 (2010). https://doi.org/10.1007/s10878-009-9207-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9207-z