This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...

This paper browses through some well-known meta-heuristic search strategies, and briefly discusses some of their recent applications to the VLSI layout design process. It starts with very brief description of the different phases of VLSI layout design, and a brief overview of Meta-Heuristic search strategies. Since most of the VLSI layout design problems are hard optimization problems, the conc...

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...

Nowadays computers are used to solve a variety and multitude of complex problems facing in every sphere of peoples’ life. However, many of the problems are intractable in nature exact algorithm might need centuries to manage with formidable challenges. In such cases heuristic or in a broader sense meta-heuristic algorithms that find an approximate solution but have acceptable time and space com...

The human has always been to up to the best in everything, And this perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables to find the best acceptable answer to the limitations in a problem, so that the objective function is a minimum or a maximum. Metaheuristic algorithms are one of inaccurate optimization methods that inspired by ...

Services are the basic amass that aims to support the building of business application in a more flexible and interoperable manner for enterprise collaboration. Satisfying the needs of service consumer and to become accustomed to changing needs, service composition is performed to compose the various capabilities of available services. With the proliferation of services presenting similar funct...

Dynamic response of a structure is a remarkable characteristic which can be optimized (controlled) by imposing constraints on natural frequencies. But it is mentionable that size and shape optimization of trusses with multiple frequency constraints is a very non-linear and non-convex problem that may be converged to local optima when using meta-heuristic algorithms. To concur this problem, rese...

 Abstract : In this paper a meta-heuristic approach has been presented to solve lot-size determination problems in a complex multi-stage production planning problems with production capacity constraint. This type of problems has multiple products with sequential production processes which are manufactured in different periods to meet customer’s demand. By determining the decision variables, mac...