Abstract
The bi-criteria scheduling problem optimization model in a real-life flow shop with setup times was built, while the similarity of jobs were considered. The case study differs from the conventional scheduling problems. A modified genetic local search algorithm to minimize makespan and maximum tardiness was proposed. Two new neighborhood structures based on the problem-concerned knowledge were defined, and were used in the local search procedure to improve efficiency of optimization. The performance of this algorithm was compared with two multi-objective genetic local search algorithms proposed in the literature, and the simulation experiment shows that the scheduling model and proposed algorithm are relatively effective.
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.
