论文标题
快速，精确的审核计划优化
Fast and exact audit scheduling optimization
论文作者
论文摘要
本文涉及通过整数线性编程对财务审计师的成本和时间有效安排。时间表优化考虑了13个不同的限制，员工稀缺性，对输入数据的频繁更改，需要最大程度地减少生成的时间表中的更改以及扩展问题。我们比较了两个问题的确切配方，我们发现多商品网络流程公式比三维公式快24倍。交付的实施将时间减少到第一个时间表从3人日降至1小时，而计划的时间表从1人日更新到4分钟。
This article is concerned with the cost and time effective scheduling of financial auditors with Integer Linear Programming. The schedule optimization takes into account 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. We compared two exact formulations of the problem and we found a multi-commodity network flow formulation to be 24 times faster than a three-dimensional formulation. The delivered implementation reduced time to the first schedule from 3 man-days to 1 hour and the schedule update time from 1 man-day to 4 minutes.
