A new tabu search procedure for an audit-scheduling problem

Journal of Scheduling

Volumn 2, Issue 4, 1999, Pages 157-173

  Brucker, Peter ^a   Schumacher, Doris ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

Audit scheduling; Tabu search; Time windows

Indexed keywords

EID: 0347240810     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1425(199907/08)2:4<157::AID-JOS23>3.0.CO;2-Z     Document Type: Article

References (22)

1. E. L. Summers, 'The audit staff assignment problem: a linear programming analysis', Accounting Rev., XLVII, 443-453 (1972).
2. B. V. Balachandran and A. A. Zoltner, 'An interactive audit-staff scheduling decision support system', Accounting Rev., LVI, 901-812 (1981).
3. W. R. Knechl and H. P. Benson, 'An optimization approach for scheduling internal audits of devisions', Decision Science, 38, 1245-1263 (1991).
4. K. H. Chan and B. Dodin, 'A decision support system for audit staff scheduling with precedence constraints and due dates', Accounting Rev., LXI, 726-734 (1986).
5. A. Drexl, 'Scheduling of project networks by job assignment', Manage. Sci., 37(12), 1590-1602 (1991).
6. B. Dodin and K. Hung Chan, 'Application of production scheduling methods to external and internal audit scheduling', J. Oper. Res., 52, 267-279 (1991).
7. F. Salewski and T. Bartsch, 'A comparison of genetic and greedy randomized algorithms for medium-to-short-term audit-staff scheduling', Working paper No. 356, Department of Production and Logistics, Institute for Management, Christian-Albrechts University at Kiel, Germany, 1994.
8. F. Salewski, Hierarchische Personaleinsatzplanung in Wirtschaftsprüfungsgesellschaften, Physika, Heidelberg, 1995.
9. B. Dodin, A. A. Elimam and E. Rolland, Tabu search in audit scheduling', Anderson Graduate School of Management. Univ. of CA, Riverside, CA, 1996.
10. A. Hertz, E. Taillard and D. de Werra, Tabu Search', in E. Aarts and J. K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley, Chichester, 1997, pp. 121-136.
11. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Dordrecht, 1997.
12. E. H. L. Aarts and J. H. M. Korst, Simulated Annealing and Boltzmann Machines, Wiley, Chichester, 1989.
13. D. S. Johnson, C. Aragon, C. McGeoch and C. Schevon, 'Optimization by simulated annealing: an experimental evaluation II: graph coloring and number partitioning', Oper. Res., 39, 378-406 (1989).
14. G. Schmidt, 'Scheduling independent tasks with deadlines on semi-identical processors', J. Oper. Res. Soc., 39, 271-277(1988).
15. M. Kaspi and B. Montreuil, 'On the scheduling of identical parallel processes with arbitrary initial processor available times', Research Report 88-12, School of Industrial Engineering, Purdue University, 1988.
16. C.-Y. Lee, 'Parallel machines scheduling with non-simultaneous machine available time', Discrete Appl. Math., 30, 53-61 (1991).
17. C.-Y. Lee, 'Machine scheduling with an availability constraint', J. Global Optim., (Special Issue on 'Optimization on Scheduling Application'), to appear.
18. C.-Y. Lee and S. D. Liman, 'Capacitated two-parallel machines scheduling to minimize sum of job completion times', Discrete Appl. Math., 41, 211-222 (1993).
19. G. Mosheiov, 'Minimizing the sum of job completion times on capacitated parallel machines', Math. Comput. Modelling, 20, 91-99 (1994).
20. C.-Y. Lee, 'Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint', Oper. Res. Lett., 20, 129-139 (1997).
21. J. Hurink, B. Jurisch and M. Thole, Tabu search for the job shop scheduling problem with multi-purpose machines', OR Spektrum, 15, 205-215 (1994).
22. D. Schumacher, Lösungsverfahren für Auditing-Probleme, Diplomarbeit, Universität Osnabrück, 1998.