Multi-objective no-wait hybrid flowshop scheduling problem with transportation times

ISSN： 1742-7185

Source： International Journal of Computational Science and Engineering, Vol.7, Iss.2, 2012-07, pp. : 147-154

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

This paper studies multi-objective no-wait hybrid flowshop scheduling problems to minimise both makespan and total tardiness. Furthermore, we consider transportation times between machines. This transportation time can be either job-dependent or job-independent. We consider that all transportations are job-independent; and transportations between two machines have to be done by one transporter. This paper presents a new multi-objective electromagnetism algorithm (MOEA). Electromagnetism algorithm is known as a flexible and effective population-based algorithm utilising an attraction/repulsion mechanism to move the particles towards optimality. The algorithm is carefully evaluated for its performance against two available algorithms by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others.