Scatter search is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear global optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, such as in generating surrogate constraints, scatter search uses strategies for combining solution vectors that have ...

Article history: Received December 10, 2014 Received in revised format: January 4, 2015 Accepted February 20, 2015 Available online February 24 2015 This paper presents a new search methodology for different sizes of 0-1 Knapsack Problem (KP). The proposed methodology uses a modified scatter search as a meta-heuristic algorithm. Moreover, rough set theory is implemented to improve the initial f...

This paper investigates the hybrid flowshop scheduling with finite intermediate buffers, whose objective is to minimize the sum of weighted completion time of all jobs. Since this problem is very complex and has been proven strongly NP-hard, a tabu search heuristic is proposed. In this heuristic there are two main features. One is that a scatter search mechanism is incorporated to improve the d...

Flexible manufacturing system (FMS) scheduling is one of the most trusted and complicated task in machine scheduling. It is strongly Non polynomial complete combinatorial problem. FMS is agile and flexible which is well suited for simultaneous production of a wide variety of product mix in low volumes. Meta-heuristic approaches such as genetic algorithm, simulated annealing etc. are widely appl...