Abstract
In this research, a permutation flowshop sequence-dependent group scheduling problem with minimisation of total completion time is considered. Since the problem is shown to be strongly NP-hard, a hybrid genetic (HG) algorithm is proposed. The only available lower bounding (LB) method for the proposed research problem in the literature based on branch and price (B&P) algorithm is also enhanced by proposing efficient method to solve sub-problems and proposing a better branching rule. A statistical comparison shows that both the proposed HG algorithm and the proposed LB have better performance than the other methods from the literature with an average 5.96% percentage gap.
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.
