A new tabu search procedure for an audit-scheduling problem

✍ Scribed by Peter Brucker; Doris Schumacher

• Publisher: Springer US
• Year: 1999
• Tongue: English
• Weight: 141 KB
• Volume: 2
• Category: Article
• ISSN: 1094-6136
• DOI: 10.1002/(sici)1099-1425(199907/08)2:4<157::aid-jos23>3.0.co;2-z

✦ Synopsis

We consider the following version of the auditing problem. A set of jobs must be processed by auditors A , . . . , A K . Each job consists of several tasks and there may be precedence constraints between these tasks. There is a due date associated with each job. Each auditor is available during disjoint time periods. Furthermore, s/he has a minimal and maximal working time. If task i is assigned to an auditor A H , the processing time is p GH and the processing costs are c GH . A task assigned to auditor A H can be preempted only at the end of one of the working periods of A H

. In this case it must be continued at the beginning of the next period.

One has to assign the tasks to the auditors and "nd a feasible schedule for the assigned tasks for each auditor such that the sum of the assignment costs and a weighted sum of tardiness values is minimized.

A tabu search procedure for this problem is described and computational results are presented.