A new tabu search procedure for an audit-scheduling problem
type: Item
instance of: scholarly article
title: A new tabu search procedure for an audit-scheduling problem
zbMATH Open document ID: 0941.90033
author: Peter Brucker
author: Doris Schumacher
published in: Journal of Scheduling
publication date: 2000-08-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1335392
zbMATH Keywords: audit scheduling
zbMATH Keywords: tabu search
zbMATH Keywords: time windows
MaRDI profile type: Publication
cites work: Scheduling of Project Networks by Job Assignment
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Scheduling Independent Tasks with Deadlines on Semi-identical Processors
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
cites work: Minimizing the sum of job completion times on capacitated parallel machines
cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
cites work: Tabu search for the job-shop scheduling problem with multi-purpose machines
OpenAlex ID: W2078122796
DOI: 10.1002/(SICI)1099-1425(199907/08)2:4%3C157::AID-JOS23%3E3.0.CO;2-Z
full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199907/08)2:4%3C157::aid-jos23%3E3.0.co
description: scientific article; zbMATH DE number 1335392