The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem
- 31 December 1990
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 17 (3) , 243-253
- https://doi.org/10.1016/0305-0548(90)90001-n
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Convergence of an annealing algorithmMathematical Programming, 1986
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Optimization by Simulated AnnealingScience, 1983
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- A Functional Heuristic Algorithm for the Flowshop Scheduling ProblemJournal of the Operational Research Society, 1971
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near OptimumJournal of the Operational Research Society, 1965
- On the Scheduling of Jobs by ComputerThe Computer Journal, 1962
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953