scispace - formally typeset
Search or ask a question
Author

Atabak Elmi

Other affiliations: Monash University, Urmia University, Dokuz Eylül University  ...read more
Bio: Atabak Elmi is an academic researcher from Deakin University. The author has contributed to research in topics: Flow shop scheduling & Job shop scheduling. The author has an hindex of 8, co-authored 16 publications receiving 325 citations. Previous affiliations of Atabak Elmi include Monash University & Urmia University.

Papers
More filters
Journal ArticleDOI
TL;DR: The computational results demonstrate that the proposed ILP model and SA algorithm are effective and efficient for this problem.

88 citations

Journal ArticleDOI
TL;DR: This paper describes an exact algorithm based on Benders decomposition to solve both simple and mixed-model assembly line balancing problems with setups and tests it on a set of benchmark instances and against a mixed-integer linear programming formulation of the problem solved using a commercial optimizer.

57 citations

Journal ArticleDOI
TL;DR: A mixed-integer linear programming model is proposed for the attempted cell scheduling problem and a nested application of tabu search approach is investigated in this paper to solve the problem heuristically.

49 citations

Journal ArticleDOI
TL;DR: This study shows that the appropriate number of robots depends on the sequence of processing operations to be performed at each stage, and a simulated annealing (SA) based solution approach is developed for its solution.

48 citations

Journal ArticleDOI
TL;DR: This research studies the k-degree cyclic robotic flow shop cell scheduling problem with multiple robots using a metaheuristic algorithm based on ant colony optimization to minimize the cycle time for per produced part.

35 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: A review of the state-of-the-art on the design of cellular reconfigurable manufacturing systems (RMS) compared to DMS, by means of optimization is presented in this paper.
Abstract: Reconfigurable manufacturing systems (RMS) are considered the future of manufacturing, being able to overcome both dedicated (DMS) and flexible manufacturing systems (FMS). In fact, they provide significant cost and time reductions in the launch of new products, and in the integration of new manufacturing processes into existing systems. The goals of RMS design are the extension of the production variety, the adaption to rapid changes in the market demand, and the minimization of the investment costs. Despite the interest of many authors, the debate on RMS is still open due to the lack of practical applications. This work is a review of the state-of-the-art on the design of cellular RMS, compared to DMS, by means of optimization. The problem addressed belongs to the NP-Hard family of combinatorial problem. The focus is on non-exact meta-heuristic and artificial intelligence methods, since these have been proven to be effective and robust in solving complex manufacturing design problems. A wide investigation on the most recurrent techniques in DMS and RMS literature is performed at first. A critical analysis over these techniques is given in the end.

125 citations

Journal ArticleDOI
TL;DR: Group scheduling in flexible flowshop environments as well as a related scheduling task in multiple cells, known as cell scheduling problem, is considered and open problems and promising fields for future research in the area of flowshop group scheduling are identified.

82 citations

Journal ArticleDOI
TL;DR: The experimental results show that the proposed novel metaheuristic optimization algorithm, named BRO (battle royale optimization), is an efficient method and provides promising and competitive results.
Abstract: Recently, several metaheuristic optimization approaches have been developed for solving many complex problems in various areas. Most of these optimization algorithms are inspired by nature or the social behavior of some animals. However, there is no optimization algorithm which has been inspired by a game. In this paper, a novel metaheuristic optimization algorithm, named BRO (battle royale optimization), is proposed. The proposed method is inspired by a genre of digital games knowns as “battle royale.” BRO is a population-based algorithm in which each individual is represented by a soldier/player that would like to move toward the safest (best) place and ultimately survive. The proposed scheme has been compared with the well-known PSO algorithm and six recent proposed optimization algorithms on nineteen benchmark optimization functions. Moreover, to evaluate the performance of the proposed algorithm on real-world engineering problems, the inverse kinematics problem of the 6-DOF PUMA 560 robot arm is considered. The experimental results show that, according to both convergence and accuracy, the proposed algorithm is an efficient method and provides promising and competitive results.

72 citations

Journal ArticleDOI
TL;DR: A survey of intelligent scheduling systems is provided by categorizing them into five major techniques containing fuzzy logic, expert systems, machine learning, stochastic local search optimization algorithms and constraint programming.
Abstract: Intelligent scheduling covers various tools and techniques for successfully and efficiently solving the scheduling problems. In this paper, we provide a survey of intelligent scheduling systems by categorizing them into five major techniques containing fuzzy logic, expert systems, machine learning, stochastic local search optimization algorithms and constraint programming. We also review the application case studies of these techniques.

67 citations

Journal ArticleDOI
TL;DR: A new approximate optimization approach is developed, which is based on the imperialist competitive algorithm hybridized with an efficient neighborhood search, and the effectiveness of the proposed approach is demonstrated through an experimental evaluation.

63 citations