Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
From MaRDI portal
Publication:954251
DOI10.1007/s10951-007-0043-7zbMath1153.90415OpenAlexW2084084982MaRDI QIDQ954251
Jacques A. Ferland, Véronique Bouffard
Publication date: 10 November 2008
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0043-7
simulated annealingtabu searchthreshold acceptingvariable neighborhood searchdiversificationresource-constrained scheduling
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Dynamic job shop scheduling using variable neighbourhood search ⋮ Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search ⋮ Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing ⋮ Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem ⋮ Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An introduction to timetabling
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A large scale timetabling problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Simulated annealing for resource-constrained scheduling
- A study of diversification strategies for the quadratic assignment problem
- Tight approximations for resource constrained scheduling and bin packing
- Variable neighborhood search
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- Recent research directions in automated timetabling
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Future paths for integer programming and links to artificial intelligence
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Job Shop Scheduling by Simulated Annealing
- An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Variable neighborhood search: Principles and applications
- A robust genetic algorithm for resource allocation in project scheduling
This page was built for publication: Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
