Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times Online publication date: Sun, 14-Oct-2007
by S. Hamed Hendizadeh, Tarek Y. ElMekkawy, G. Gary Wang
European J. of Industrial Engineering (EJIE), Vol. 1, No. 4, 2007
Abstract: The paper considers a flowshop scheduling problem of a manufacturing cell that contains families of jobs whose setup times are dependent on the manufacturing sequence of the families. Two objectives, namely the makespan and total flow time, have been considered simultaneously in this work. Since minimisation of each of these two objectives is an Np-Hard problem, a Multi-Objective Genetic Algorithm (MOGA) has been proposed to deal with the bi-criteria optimisation problem. The performance of the proposed MOGA is compared with the makespan and total flow time lower bounds. The proposed MOGA obtained solutions that only deviate by an average of 1% from the lower bounds. Future research will develop more efficient lower bounds for the total flow time and also compare the proposed method with other multiobjective meta-heuristics. [Received on 6 February 2007; Revised 6 June 2007; Accepted 16 June 2007]
Online publication date: Sun, 14-Oct-2007
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com