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

XML Persian Abstract Print


Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , tavakoli@ut.ac.ir
Abstract:   (14037 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]   (8826 Downloads)    

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