Abstract
The paper deals with the criteria of makespan minimisation for the permutation flow shop problem with buffers of limited capacity located between successive machines. As the problem is NP-hard, an approximation algorithm is proposed which has been designed using a non-trivial generalisation of the block elimination properties known for the classic flow shop problem. This algorithm is able to achieve excellent results for problems up to 200 jobs and 20 machines as it exploits the structural properties defined in the problem and combines these with a local search technique controlled by a tabu search strategy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
