Volume 23, Issue 2 (IJIEPM 2012)
2012, 23(2): 153-164 |
Back to browse issues page
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , tavakoli@ut.ac.ir
Abstract: (14280 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
Keywords: Open shop scheduling problems, Tardiness and earliness time, Makespan, Setup cost, NSGA-II, Multi-objective scatter search
Type of Study: Research |
Subject:
Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE
Received: 2012/07/22 | Published: 2012/08/15
Received: 2012/07/22 | Published: 2012/08/15
| Rights and permissions | |
 | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |