Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/78593
Authors: 
Noori-Darvish, Samaneh
Tavakkoli-Moghaddam, Reza
Year of Publication: 
2012
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Publisher:] SpringerOpen [Place:] Heidelberg [Volume:] 8 [Year:] 2012 [Pages:] 1-13
Abstract: 
We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several multi-objective decision making (MODM) methods, an interactive one, called the TH method is applied for solving small-sized instances optimally and obtaining Pareto-optimal solutions by the Lingo software. To achieve Pareto-optimal sets for medium to large-sized problems, an improved non-dominated sorting genetic algorithm II (NSGA-II) is presented that consists of a heuristic method for obtaining a good initial population. In addition, by using the design of experiments (DOE), the efficiency of the proposed improved NSGA-II is compared with the efficiency of a well-known multi-objective genetic algorithm, namely SPEA-II. Finally, the performance of the improved NSGA-II is examined in a comparison with the performance of the traditional NSGA-II.
Subjects: 
open shop scheduling
total tardiness
makespan
sequence-dependent setup times
NSGA-II
SPEA-II
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/2.0/
Document Type: 
Article

Files in This Item:
File
Size
537.23 kB





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