Job Shop Scheduling by Simulated Annealing

We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems. The generalization involves the acceptance of...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research Vol. 40; no. 1; pp. 113 - 125
Main Authors:	van Laarhoven, Peter J. M, Aarts, Emile H. L, Lenstra, Jan Karel
Format:	Journal Article
Language:	English
Published:	Linthicum, MD INFORMS 01.01.1992 Operations Research Society of America Institute for Operations Research and the Management Sciences
Subjects:	Algorithms analysis of algorithms Applied sciences Approximation Combinatorial optimization Cooling Cost efficiency deterministic Ergodic theory Exact sciences and technology Experiments Heuristics job shop scheduling Job shops Markov chains multiple machine Operational research and scientific management Operational research. Management science Operations research Optimization Production scheduling production/scheduling, sequencing Scheduling Scheduling, sequencing Simulated annealing Simulation suboptimal algorithms Markov chain Experimental result Approximation Simulated annealing Job shop Scheduling Asymptotic convergence Algorithm analysis
ISSN:	0030-364X, 1526-5463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!