Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem

DOI10.1111/itor.12316OpenAlexW2469183162MaRDI QIDQ6070990

Greet vanden Berghe, Haroldo Gambini Santos, Unnamed Author, Túlio A. M. Toffolo

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12316

zbMATH Keywords

heuristicsschedulingmetaheuristicslocal search

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Variable neighborhood search
• The late acceptance hill-climbing heuristic
• Greedy randomized adaptive search procedures
• Automatically improving the anytime behaviour of optimisation algorithms
• A survey of scheduling problems with setup times or costs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Theory and Practice of Simulated Annealing
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• Handbook of metaheuristics

This page was built for publication: Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem