Volume 23, Issue 2 (IJIEPM 2012)                   2012, 23(2): 153-164 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Amiri N, Tavakkoli-Moghaddam R, Gholipour-Kanani Y, Torabi S A. Modelling a Novel Multi-Objective Open-Shop Scheduling Problem and Solving by a Scatter Search Method. Journal title 2012; 23 (2) :153-164
URL: http://ijiepm.iust.ac.ir/article-1-877-en.html
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , tavakoli@ut.ac.ir
Abstract:   (14035 Views)
This paper proposes a novel, multi-objective integer programming model for an open-shop scheduling problem (OSSP). Three objectives are to minimize the makespan, total job tardiness and earliness, and total jobs setup cost. Due the complexity to solve such a hard problem, we develop a meta-heuristic algorithm based on multi-objective scatter search (MOSS), and a number of test problems are solved by this proposed algorithm. Finally, to prove its efficiency, the related results are compared with the results obtained by the well-known multi-objective evolutionary algorithm, called NSGA-II. The results confirm the efficiency and the effectiveness of our proposed MOSS to provide good solutions, especially for medium and large-sized problems
Full-Text [PDF 453 kb]   (8825 Downloads)    

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.