Job Shop Scheduling by Simulated Annealing

DOI10.1287/OPRE.40.1.113zbMath0751.90039OpenAlexW2081278763MaRDI QIDQ3991326

Emile H. L. Aarts, Jan Karel Lenstra, Peter J. M. Van Laarhoven

Publication date: 28 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/60b3ffcdcfd3cacf050ba096b4201adc1ce296ba

zbMATH Keywords

simulated annealingapproximation algorithmjob shopminimum makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (only showing first 100 items - show all)

A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ Hybrid simulated annealing with memory: an evolution-based diversification approach ⋮ Multi-agent based beam search for intelligent production planning and scheduling ⋮ 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 ⋮ TLMPA: teaching-learning-based marine predators algorithm ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ A very fast TS/SA algorithm for the job shop scheduling problem ⋮ A simulated multi-objective model for flexible job shop transportation scheduling ⋮ Simulated annealing technique in discrete fracture network inversion: optimizing the optimization ⋮ On edge orienting methods for graph coloring ⋮ 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 ⋮ An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ Hybrid Metaheuristics: An Introduction ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ Flexible job-shop scheduling with transportation resources ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ Firefly-Inspired Algorithm for Job Shop Scheduling ⋮ A memetic algorithm for restoring feasibility in scheduling with limited makespan ⋮ Scheduling Massively Parallel Multigrid for Multilevel Monte Carlo Methods ⋮ 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 ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ 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 ⋮ Simulated annealing: An introduction ⋮ SOLVING A MULTI-OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH TIMED PETRI NETS AND GENETIC ALGORITHM ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ A hybrid genetic algorithm for the job shop scheduling problem ⋮ DLSP for two-stage multi-item batch production ⋮ Stochastic assembly line balancing using simulated annealing ⋮ An effective hybrid optimization strategy for job-shop scheduling problems ⋮ A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling ⋮ Fractional cell formation in group technology ⋮ Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem ⋮ Minimizing L _max for large-scale, job-shop scheduling problems ⋮ A sequencing approach for creating new train timetables ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Nested partitions for the large-scale extended job shop scheduling problem ⋮ A genetic algorithm methodology for complex scheduling problems ⋮ A scatter search approach to sequence-dependent setup times job shop scheduling ⋮ Fast parallel heuristics for the job shop scheduling problem ⋮ Real-world extensions to scheduling algorithms based on Lagrangian relaxation ⋮ Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems ⋮ 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 ⋮ Improving local search heuristics for some scheduling problems. II ⋮ Design of manufacturing systems by a hybrid approach with neural network metamodelling and stochastic local search ⋮ Linguistic-based meta-heuristic optimization model for flexible job shop scheduling ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ Convergence of Simulated Annealing with Feedback Temperature Schedules ⋮ Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing ⋮ Modelling and heuristics of FMS scheduling with multiple objectives ⋮ Part-mix allocation in a hybrid manufacturing system with a flexible manufacturing cell and a conventional jobshop ⋮ A branch and bound algorithm for the job-shop scheduling problem ⋮ A flow-based tabu search algorithm for the RCPSP with transfer times ⋮ An improved shifting bottleneck procedure for the job shop scheduling problem ⋮ An integrated model to improve ergonomic and economic performance in order picking by rotating pallets ⋮ Combinatorial optimization techniques for spacecraft scheduling automation ⋮ A novel threshold accepting meta-heuristic for the job-shop scheduling problem ⋮ A tabu search heuristic for the quay crane scheduling problem ⋮ Adaptive temperature control for simulated annealing: a comparative study ⋮ 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 ⋮ A backward approach in list scheduling algorithms for multi-machine tardiness problems ⋮ A hybrid evolutionary algorithm to solve the job shop scheduling problem ⋮ Cooperative twin-crane scheduling ⋮ Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ Solving the job-shop scheduling problem optimally by dynamic programming ⋮ A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective ⋮ An effective new island model genetic algorithm for job shop scheduling problem ⋮ The multiple team formation problem using sociometry ⋮ Risk measure of job shop scheduling with random machine breakdowns ⋮ A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility ⋮ Solving a concrete sleepers production scheduling by genetic algorithms ⋮ An algorithm for the job shop scheduling problem based on global equilibrium search techniques ⋮ Heuristics for search sequencing under time-dependent probabilities of existence ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal ⋮ 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

This page was built for publication: Job Shop Scheduling by Simulated Annealing