Tabu Search in Audit Scheduling
In this paper, we present a heuristic procedure based on tabu search (TS) and intelligent memory structures for solving this problem. The TS method starts with a feasible schedule generated by a greedy forward dispatching procedure, then through a series of intensification and diversification steps it improves on the initial schedule. The improvement in the value of the objective function is observed interactively. The search can be terminated as the improvement in the value of the objective function stabilizes. Application of the TS method to different audit scheduling problems has consistently improved the value of the cost minimization objective function.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1996|
|Date of revision:|
|Contact details of provider:|| Postal: The A. Gary Anderson Graduate School of Management. University of California, Riverside. Riverside CA 92521|
Web page: http://www.agsm.ucr.edu/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:caland:96-25. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.