In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
Yunsong Guo, Yanzhi Li, Andrew Lim, Brian Rodrigue...
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
Andreas Beham, Stephan M. Winkler, Stefan Wagner 0...
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...