Some new results on simulated annealing applied to the job shop scheduling problem
From MaRDI portal
Publication:1806648
Recommendations
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 4079162 (Why is no real title available?)
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- scientific article; zbMATH DE number 890674 (Why is no real title available?)
- scientific article; zbMATH DE number 925015 (Why is no real title available?)
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A piecewise Markovian model for simulated annealing with stochastic cooling schedules
- Convergence and finite-time behavior of simulated annealing
- Convergence of Simulated Annealing with Feedback Temperature Schedules
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- Job Shop Scheduling by Simulated Annealing
- Multidimensional optimization with a fuzzy genetic algorithm
- Note on the Convergence of Simulated Annealing Algorithms
- Optimization by simulated annealing
- Simulated annealing methods with general acceptance probabilities
- The job shop scheduling problem: Conventional and new solution techniques
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(45)- A simulated annealing approach to the cyclic staff-scheduling problem
- Stochastic algorithms in scheduling theory (Diss., TU Berlin)
- Parallel machine scheduling models with fuzzy processing times
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- Focused simulated annealing search: An application to job shop scheduling
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
- Adaptive temperature control for simulated annealing: a comparative study
- An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm
- Analysing stability and investments in railway networks using advanced evolutionary algorithms
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling
- A particle swarm optimization-based algorithm for job-shop scheduling problems
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- A priority list based heuristic for the job shop problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- Multiple colony ant algorithm for job-shop scheduling problem
- An experimental analysis of local minima to improve neighbourhood search.
- A novel non-linear approach to minimal area rectangular packing
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Evolutionary Computation in Combinatorial Optimization
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
- An effective architecture for learning and evolving flexible job-shop schedules
- Scheduling the truckload operations in automatic warehouses
- Double layer ACO algorithm for the multi-objective FJSSP
- Deterministic job-shop scheduling: Past, present and future
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
- Simulated annealing and joint manufacturing batch-sizing
- A new hybrid parallel genetic algorithm for the job-shop scheduling problem
- A sequencing approach for creating new train timetables
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- Hybrid simulated annealing with memory: an evolution-based diversification approach
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
- An effective hybrid optimization strategy for job-shop scheduling problems
- A multi-echelon integrated JIT inventory model using the time buffer and emergency borrowing policies to deal with random delivery lead times
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Optimization based job shop scheduling
- Solving a multi-objective flexible job shop scheduling problem with timed Petri nets and genetic algorithm
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
- Minimizing L max for large-scale, job-shop scheduling problems
- Algorithmical approaches to business process design
This page was built for publication: Some new results on simulated annealing applied to the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806648)
