A new tabu search procedure for an audit-scheduling problem

DOI<157::AID-JOS23>3.0.CO;2-Z 10.1002/(SICI)1099-1425(199907/08)2:4<157::AID-JOS23>3.0.CO;2-ZzbMath0941.90033MaRDI QIDQ1297694

Peter Brucker, Doris Schumacher

Publication date: 7 August 2000

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

tabu search; time windows; audit scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling and constraint propagation, A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem, Activity list representation for a generalization of the resource-constrained project scheduling problem

Cites Work

• Parallel machines scheduling with nonsimultaneous machine available time
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• Minimizing the sum of job completion times on capacitated parallel machines
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Scheduling of Project Networks by Job Assignment
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning