A new tabu search procedure for an audit-scheduling problem
From MaRDI portal
Publication:1297694
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(199907/08)2:4<157::AID-JOS23>3.0.CO;2-Z" /><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.90033OpenAlexW2078122796MaRDI QIDQ1297694
Doris Schumacher, Peter Brucker
Publication date: 7 August 2000
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199907/08)2:4<157::aid-jos23>3.0.co;2-z
Related Items (5)
A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem ⋮ Temporal linear relaxation in IBM ILOG CP optimizer ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ Scheduling and constraint propagation ⋮ 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
This page was built for publication: A new tabu search procedure for an audit-scheduling problem
