A local search method for permutation flow shop scheduling

A local search method for permutation flow shop scheduling

0.00 Avg rating0 Votes
Article ID: iaor20072284
Country: United Kingdom
Volume: 57
Issue: 10
Start Page Number: 1248
End Page Number: 1251
Publication Date: Oct 2006
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.