Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
From MaRDI portal
Publication:5364075
DOI10.1111/itor.12195zbMath1371.90053OpenAlexW1483455873MaRDI QIDQ5364075
Martín H. Cruz-Rosales, Marco Antonio Cruz-Chávez, Martín G. Martínez-Rangel
Publication date: 2 October 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12195
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Auction-based approach for a flexible job-shop scheduling problem with multiple process plans ⋮ A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ Investigating volatility transmission across international equity markets using multivariate fractional models ⋮ Optimization of departure runway scheduling incorporating arrival crossings ⋮ An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints ⋮ Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem ⋮ Unnamed Item ⋮ The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach
This page was built for publication: Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
