Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
From MaRDI portal
Publication:5364075
Recommendations
- Some new results on simulated annealing applied to the job shop scheduling problem
- Focused simulated annealing search: An application to job shop scheduling
- scientific article; zbMATH DE number 1054937
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Job Shop Scheduling by Simulated Annealing
Cited in
(12)- Research on optimization algorithm for multiprocessor scheduling problem based on simulated annealing
- Focused simulated annealing search: An application to job shop scheduling
- Artificial Intelligence and Soft Computing - ICAISC 2004
- SA algorithm based on Block properties of large-scale FSPs
- Extended tabu search-based scheduling to improve profitability in heterogeneous parallel systems
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
- Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem
- Optimization of departure runway scheduling incorporating arrival crossings
- Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
- Investigating volatility transmission across international equity markets using multivariate fractional models
- The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach
- An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
This page was built for publication: Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364075)