Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 57, Issue 10, Pages 1248-1251Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1057/palgrave.jors.2602106
Keywords
heuristics; local search; escape-from-trap; flow shop sequencing
Ask authors/readers for more resources
It is well known that a local search method, a widely used approach for solving the permutation flow shop scheduling problem, can easily be trapped at a local optimum. In this paper, we propose two escape-from-trap procedures to move away from local optima. Computational experiments carried out on a standard set of instances show that this heuristic algorithm generally outperforms an effective approximation algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available