Fast and exact audit scheduling optimization

Abstract

Abstract This article is concerned with the cost and time-effective scheduling of financial auditors with integer linear programming. The schedule optimization considers 13 different constraints, staff scarcity, frequent alterations of the input data with the need to minimize the changes in the generated schedule, and scaling issues. The delivered implementation reduced the time to the first schedule from 3 man-days to 1 h and the schedule update time from 1 man-day to 4 min.

Keywords

• Audit-staff scheduling
• Assignment problem
• Integer linear programming
• Multi-commodity network flow