Abstract

Distributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention. In this study, DHFSP with sequence-dependent setup times is studied and a multi-class teaching–learning-based optimization (MTLBO) is proposed to minimize makespan and maximum tardiness simultaneously. A two-string representation is adopted. s classes are formed to improve search efficiency by implementing reward and punishment mechanism among them. Class evaluation is introduced and two teacher phases and one learner phase are applied in the evolution of each class. Elimination process acts on the worst class to avoid the waste of computing resource. A number of experiments are conducted and the computational results demonstrate that MTLBO is a very competitive method for DHFSP.

Full Text
Published version (Free)

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 call