Simulated annealing for permutation flow-shop scheduling

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
• Comparison of heuristics for flow shop sequencing
  Omega, 1987
• Convergence of an annealing algorithm
  Mathematical Programming, 1986
• Optimization by Simulated Annealing
  Science, 1983
• An adaptive branching rule for the permutation flow-shop problem
  European Journal of Operational Research, 1980
• Complexity of Machine Scheduling Problems
  Published by Elsevier ,1977
• A New Bound for Machine Scheduling
  Journal of the Operational Research Society, 1976
• The Complexity of Flowshop and Jobshop Scheduling
  Mathematics of Operations Research, 1976
• Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum
  Journal of the Operational Research Society, 1965
• Optimal two‐ and three‐stage production schedules with setup times included
  Naval Research Logistics Quarterly, 1954