A new heuristic method for the flow shop sequencing problem

A new heuristic method for the flow shop sequencing problem

0.00 Avg rating—0 Votes
Article ID: iaor1989902
Country: Netherlands
Volume: 41
Issue: 2
Start Page Number: 186
End Page Number: 193
Publication Date: Jul 1989
Journal: European Journal of Operational Research
Authors: ,
Abstract:

A new heuristic method is presented for solving the m-machine, n-job flow shop scheduling problem. This method, named SPIRIT, is composed of two phases: the first finds an initial sequence using an analogy with the travelling salesman problem and the second tries to improve this solution using taboo search techniques. The results of the heuristic are compared with those from other well-known methods.

Reviews

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