Modified simulated annealing algorithms for the flow shop sequencing problem

This publication has 14 references indexed in Scilit:

• A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
  Published by Elsevier ,2003
• The Lessons of Flowshop Scheduling Research
  Operations Research, 1992
• The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem
  Computers & Operations Research, 1990
• Convergence of an annealing algorithm
  Mathematical Programming, 1986
• Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
  Journal of Optimization Theory and Applications, 1985
• Optimization by Simulated Annealing
  Science, 1983
• An Evaluation of Flow Shop Sequencing Heuristics
  Management Science, 1977
• Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
  Operations Research, 1965
• A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem
  Journal of the Operational Research Society, 1965
• Optimal two‐ and three‐stage production schedules with setup times included
  Naval Research Logistics Quarterly, 1954