The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research

Volumn 17, Issue 3, 1990, Pages 243-253

  Ogbu, F A ^a   Smith, D K ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL TECHNIQUES--PERTURBATION TECHNIQUES; PROBABILITY;

FLOWSHOP PROBLEMS; REPETITIVE ITERATIVE IMPROVEMENT ALGORITHM; SIMULATED ANNEALING ALGORITHMS;

SCHEDULING;

EID: 0025263381     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(90)90001-N     Document Type: Article

References (25)

1. Convergence of an annealing algorithm
2. Complexity of machine scheduling problems
3. A functional heuristic algorithm for the flowshop scheduling problem
4. On the scheduling of jobs by computer
5. Sequencing jobs through a multi-stage process in the minimum total time — a quick method of obtaining a near optimum
6. An evaluation of flowshop sequencing heuristics
7. A heuristic algorithm for the n-job m-machine sequencing problem
8. Equation of state calculations by fast computing machines
9. Optimisation by simulated annealing
10. A thermodynamical approach to the travelling salesman problem an efficient simulation algorithm
11. Global wiring by simulated annealing
12. Applications of the simulated annealing algorithm to combinatorial problems in statistics
13. Statistical cooling: a general approach to combinatorial optimisation problems
14. Optimisation by simulated annealing: quantitative studies
15. Simulated annealing method for the determination of spin Hamiltonian parameters from electron-spin-resonance data
16. Simulated annealing methods with general acceptance probabilities
17. A controlled search simulated annealing method for the single machine weghted tardiness problem
18. Optimal two- and three-stage production schedules with set-up times included
19. Structural analysis of local search heuristics in combinatorial optimisation
20. Heuristic programming as an aid to network design
21. Solving quadratic assignment problems by simulated annealing