Release Time:2019-03-11  Hits:

Indexed by: Conference Paper

Date of Publication: 2008-10-20

Included Journals: Scopus、CPCI-S、EI

Volume: 1

Page Number: 535-539

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.