Single Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem

Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2012, Vol 3, Issue 2

Abstract

 - A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial population and several strategies for producing new population for next generation. Proposed EA is tested on benchmark problems and with due attention to the results of other meta-heuristics in this field, the results of EA show that our algorithm is effective and comparable to the other algorithms.

Authors and Affiliations

1M. Nagamani, 2Dr. E. Chandrasekaran, 3Dr. D. Saravanan

Keywords

Related Articles

The Analysis Solutions for Two-Dimensional Fractional Diffusion Equations with Variable Coefficients

This paper deals with a fractional diffusion equation with variable coefficients developed by a non-local method with temporal and spatial correlations. The time-fractional derivative is described in the Caputo sense whi...

An Inventory Model for Time Varying Holding Cost and Weibull Distribution for Deterioration with Fully Backlogged Shortages

To find optimum order quantity deterioration plays crucial role in inventory management therefore handling of deterioration is in highlight and attracted of many researchers. In this model Economic Production P roblem u...

Some Common Fixed Point Theorems for Weakly Compatible Mappings in Menger Spaces

In this paper,firstly we prove a common fixed point theorem for weakly compatible mappings. Secondly, we prove common fixed point theorems for weakly compatible mappings with E.A and CLR property in Menger spaces. At the...

Asymptotic Behavior of Solutions for Forced Non Linear Delay Impulsive Differential Equations

We establish new sufficient conditions for asymptotic behavior of the solutions of non linear forced neutral delay differential equations with constant impulsive jumps. Our results improve and generalize some known resul...

Fekete-Szego Problems Involving Certain Integral Operator

In this paper, we obtain Fekete-Szego inequality for certain normalized analytic function f (z) de ned on the open unit disc for which z(J;f(z))0 J;f(z) ; (0  - 1 < 2) lies in a region starlike with respect to 1...

Download PDF file
  • EP ID EP146147
  • DOI -
  • Views 78
  • Downloads 0

How To Cite

1M. Nagamani, 2Dr. E. Chandrasekaran, 3Dr. D. Saravanan (2012).  Single Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem. INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY, 3(2), 78-81. https://europub.co.uk/articles/-A-146147