Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
type: Item
instance of: scholarly article
title: Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
zbMATH Open document ID: 1153.90415
author: Véronique Bouffard
author: Jacques A. Ferland
published in: Journal of Scheduling
publication date: 2008-11-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5363515
zbMATH Keywords: simulated annealing
zbMATH Keywords: threshold accepting
zbMATH Keywords: tabu search
zbMATH Keywords: diversification
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: resource-constrained scheduling
MaRDI profile type: Publication
full work available at URL: s10951-007-0043-7
OpenAlex ID: W2084084982
cites work: A robust genetic algorithm for resource allocation in project scheduling
cites work: A large scale timetabling problem
cites work: Q4495168
cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems
cites work: Q3940840
cites work: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
cites work: Q2779816
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: Recent research directions in automated timetabling
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: An introduction to timetabling
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Variable neighborhood search: Principles and applications
cites work: Q4248938
cites work: Simulated annealing for resource-constrained scheduling
cites work: A study of diversification strategies for the quadratic assignment problem
cites work: Optimization by Simulated Annealing
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: Variable neighborhood search
cites work: Tight approximations for resource constrained scheduling and bin packing
cites work: Job Shop Scheduling by Simulated Annealing
DOI: 10.1007/S10951-007-0043-7
description: scientific article; zbMATH DE number 5363515