An efficient stochastic hybrid heuristic for flowshop scheduling
Authors:
- 1 September 2007
- journal article
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 20 (6) , 851-856
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A heuristic genetic algorithm for flowshop scheduling2001
- A new constructive heuristic for the flowshop scheduling problemEuropean Journal of Operational Research, 1998
- Modified simulated annealing algorithms for the flow shop sequencing problemEuropean Journal of Operational Research, 1995
- Some efficient heuristic methods for the flow shop sequencing problemEuropean Journal of Operational Research, 1990
- The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problemComputers & Operations Research, 1990
- Simulated annealing for permutation flow-shop schedulingOmega, 1989
- Optimization by Simulated AnnealingScience, 1983
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970