Job Shop Scheduling by Simulated Annealing
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Hybrid rollout approaches for the job shop scheduling problem
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- An integrated tabu search algorithm for the lot streaming problem in job shops
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Extending the shifting bottleneck procedure to real-life applications
- A neural network model for scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
- The life span method -- a new variant of local search
- Scheduling jobs on parallel machines with sequence-dependent setup times
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Comparison of iterative improvement techniques for schedule optimization
- Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
- Multi-resource shop scheduling with resource flexibility
- Benchmarks for shop scheduling problems
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- A branch and bound algorithm for the job-shop scheduling problem
- Combinatorial optimization techniques for spacecraft scheduling automation
- Unrelated parallel machine scheduling using local search
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Effective job shop scheduling through active chain manipulation
- Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing
- A tabu search algorithm for the open shop problem
- Generalized pairwise interchanges and machine scheduling
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A systematic procedure for setting parameters in simulated annealing algorithms
- A hierarchical approach for the FMS scheduling problem
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- A composite heuristic for the single machine early/tardy job scheduling problem.
- Job-shop scheduling with processing alternatives.
- A repairing technique for the local search of the job-shop problem.
- An experimental analysis of local minima to improve neighbourhood search.
- Heuristics for minimizing total weighted tardiness in flexible flow shops
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- A large step random walk for minimizing total weighted tardiness in a job shop
- Efficiency of reductions of job-shop to flow-shop problems
- A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
- Decomposition methods for large job shops
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- The convergence of stochastic algorithms solving flow shop scheduling
- A tabu search approach to machine scheduling
- An integrated model to improve ergonomic and economic performance in order picking by rotating pallets
- Risk measure of job shop scheduling with random machine breakdowns
- Simulated annealing algorithm combined with chaos for task allocation in real-time distributed systems
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- A flexible job shop scheduling approach with operators for coal export terminals
- The job shop scheduling problem with convex costs
- A competent memetic algorithm for complex scheduling
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- Job-shop scheduling with blocking and no-wait constraints
- Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
- An improved shifting bottleneck procedure for the job shop scheduling problem
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem
- Adaptive temperature control for simulated annealing: a comparative study
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility
- Improving local search heuristics for some scheduling problems. I
- On a scheduling problem in a robotized analytical system
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- Focused simulated annealing search: An application to job shop scheduling
- A comparison of local search methods for flow shop scheduling
- Metaheuristics: A bibliography
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Effective neighbourhood functions for the flexible job shop problem
- Review on nature-inspired algorithms
- Estimating the convergence of a simulated annealing algorithm for the problem of constructing multiprocessor schedules
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- TLMPA: teaching-learning-based marine predators algorithm
- A simulated multi-objective model for flexible job shop transportation scheduling
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling
- Integration of routing into a resource-constrained project scheduling problem
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
- Multiobjective optimization for complex flexible job-shop scheduling problems
- A sequencing approach for creating new train timetables
- Nested partitions for the large-scale extended job shop scheduling problem
- A multi-objective memetic algorithm for the job-shop scheduling problem
- A tabu search experience in production scheduling
- Routing and scheduling in a flexible job shop by tabu search
- Applying tabu search to the job-shop scheduling problem
- Problems of discrete optimization: challenges and main approaches to solve them
- A very fast TS/SA algorithm for the job shop scheduling problem
- Simulated annealing technique in discrete fracture network inversion: optimizing the optimization
- On edge orienting methods for graph coloring
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
- A tabu search approach for proportionate multiprocessor open shop scheduling
- A review of some issues and identification of some barriers in the implementation of FMS
- An advanced tabu search algorithm for the job shop problem
- A memetic algorithm for the job-shop with time-lags
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- A hybrid genetic algorithm for the job shop scheduling problem
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Hierarchical minimization of completion time variance and makespan in jobshops
- An integrated approach for modeling and solving the scheduling problem of container handling systems
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- Modelling and heuristics of FMS scheduling with multiple objectives
This page was built for publication: Job Shop Scheduling by Simulated Annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991326)
