Abstract
In this paper, a composite heuristic algorithm is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are well known NP-hard. Besides initialized by LR(n/m), solution of the proposal is developed by iteration of FPE or BPE alternatively. Perturbation is applied to escape from the local optimization when no improvement can be obtained during the development procedure. Good structures in the sequence can be kept during the perturbation. Ties with no improvement can be broken up during the perturbation. Experimental results show that the proposal is rather suitable for large-sized problems and outperforms the other recent and effective algorithms considered on benchmark instances on average.
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.
