Abstract
This study investigates a flow shop group scheduling problem where both sequence-dependent setup time between groups and round-trip transportation time between machines are considered. The objective is to minimize makespan. To solve the problem, we first develop a mixed integer linear programming model and then propose an efficient co-evolutionary discrete differential evolution algorithm (CDDEA). In the CDDEA, several problem-specific heuristic rules are generated to construct initial population. A novel discrete differential evolution mechanism and a cooperative-oriented optimization strategy are proposed to synergistically evolve both the sequence of jobs in each group and the sequence of groups. In addition, two lower bounds are developed to evaluate the solution quality of CDDEA. Extensive computational experiments are carried out. The results show that the proposed CDDEA is effective in solving the studied problem.
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.
