Please use this identifier to cite or link to this item:
Title: Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times
Authors: Mansouri, SA
Hendizadeh, SH
Salmasi, N
Keywords: Multicriteria scheduling;Sequence-dependent setups;Flowshop;Pareto-optimal frontier;Genetic algorithms;Simulated annealing
Issue Date: 2009
Publisher: Springer-Verlag
Citation: The International Journal of Advanced Manufacturing Technology 40(11-12):1216–1226
Abstract: A two-machine flowshop scheduling problem is addressed to minimize setups and makespan where each job is characterized by a pair of attributes that entail setups on each machine. The setup times are sequence-dependent on both machines. It is shown that these objectives conflict, so the Pareto optimization approach is considered. The scheduling problems considering either of these objectives are NP-hard , so exact optimization techniques are impractical for large-sized problems. We propose two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) to find approximations of Pareto-optimal sets. The performances of these approaches are compared with lower bounds for small problems. In larger problems, performance of the proposed algorithms are compared with each other. Experimentations revealed that both algorithms perform very similar on small problems. Moreover, it was observed that MOGA outperforms MOSA in terms of the quality of solutions on larger problems.
Description: The official published version of the article can be found at the link below.
ISSN: 0268-3768
Appears in Collections:Business and Management
Brunel Business School Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf185.71 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.