 Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup timesS. Hamed Hendizadeh, Tarek Y. ElMekkawy and G. Gary Wang European Journal of Industrial Engineering, 2007, vol. 1, issue 4, 391-413 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] Keywords: bi-criteria scheduling; cellular manufacturing; manufacturing cells; sequence-dependent setups; setup times; flowshop scheduling; pareto-optimal frontier; multi-objective genetic algorithms; MOGA; makespan; total flow time; lower bound; branch and bound; B&B; metaheuristics. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:1:y:2007:i:4:p:391-413 Access Statistics for this article More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.