Some new results on simulated annealing applied to the job shop scheduling problem
From MaRDI portal
Publication:1806648
DOI10.1016/S0377-2217(97)00420-7zbMath0933.90029OpenAlexW2018179003MaRDI QIDQ1806648
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00420-7
job shop schedulinggenetic algorithmhybrid optimizationheuristic solutionsadaptive temperature controlconvergence of simulated annealing
Related Items (27)
Analysing stability and investments in railway networks using advanced evolutionary algorithms ⋮ Hybrid simulated annealing with memory: an evolution-based diversification approach ⋮ A novel threshold accepting meta-heuristic for the job-shop scheduling problem ⋮ Parallel machine scheduling models with fuzzy processing times ⋮ A hybrid evolutionary algorithm to solve the job shop scheduling problem ⋮ An effective architecture for learning and evolving flexible job-shop schedules ⋮ Scheduling the truckload operations in automatic warehouses ⋮ Simplifying dispatching rules in genetic programming for dynamic job shop scheduling ⋮ A novel non-linear approach to minimal area rectangular packing ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems ⋮ An agent-based parallel approach for the job shop scheduling problem with genetic algorithms ⋮ The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. ⋮ Multiple colony ant algorithm for job-shop scheduling problem ⋮ An experimental analysis of local minima to improve neighbourhood search. ⋮ A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS ⋮ SOLVING A MULTI-OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH TIMED PETRI NETS AND GENETIC ALGORITHM ⋮ Minimizing L max for large-scale, job-shop scheduling problems ⋮ A sequencing approach for creating new train timetables ⋮ Algorithmical approaches to business process design ⋮ Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems ⋮ Double layer ACO algorithm for the multi-objective FJSSP ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ A multi-echelon integrated JIT inventory model using the time buffer and emergency borrowing policies to deal with random delivery lead times ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing ⋮ A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
Cites Work
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- The job shop scheduling problem: Conventional and new solution techniques
- Multidimensional optimization with a fuzzy genetic algorithm
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Convergence of an annealing algorithm
- Convergence and finite-time behavior of simulated annealing
- Simulated annealing methods with general acceptance probabilities
- Cooling Schedules for Optimal Annealing
- Note on the Convergence of Simulated Annealing Algorithms
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A piecewise Markovian model for simulated annealing with stochastic cooling schedules
- Convergence of Simulated Annealing with Feedback Temperature Schedules
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some new results on simulated annealing applied to the job shop scheduling problem
