arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.02776math.OCq-fin.GN
收藏

Fast and exact audit scheduling optimization

Jan Motl, Pavel Kordík

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑