Tabu search for resource-constrained scheduling
type: Item
instance of: scholarly article
title: Tabu search for resource-constrained scheduling
zbMATH Open document ID: 0991.90057
DOI: 10.1016/S0377-2217(98)80001-5
author: M. G. A. Verhoeven
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1782808
zbMATH Keywords: project scheduling
zbMATH Keywords: tabu search
zbMATH Keywords: job shop scheduling
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4326789
cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
cites work: Tabu Search—Part I
cites work: A user's guide to tabu search
cites work: Tabu search for the job-shop scheduling problem with multi-purpose machines
cites work: Q4130999
cites work: Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: A computational study of constraint satisfaction for multiple capacitated job shop scheduling
cites work: Q3525910
cites work: Q4495496
cites work: Q4201451
cites work: Q4149195
cites work: Q3975934
full work available at URL: s0377-2217(98)80001-5
OpenAlex ID: W2051751101
description: scientific article; zbMATH DE number 1782808