Single Objective Evolutionary Algorithm for Job Shop Scheduling Problem

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

Abstract

 — Job shop scheduling belongs to the class of NPhard problems. There are a number of algorithms in literature for finding near optimal solution for the job shop scheduling problem. Many of these algorithms exploit the problem specific information and hence are less general. However, single objective evolutionary algorithms for job shop scheduling are general and produce better results. In this paper, we discuss approaches to developing single objective evolutionary algorithm for solving the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also designed. It jumped from the local optimal  solution, and the search area of solution is improved. Finally, the algorithm is tested on instances of 8 working procedure and 5 machines. The result shows that the evolutionary algorithm has been successfully applied to the job shop scheduling problems efficiency

Authors and Affiliations

G. Uma Sankar1 , Dr. D. Saravanan

Keywords

Related Articles

On Predicting the Next Term of a Sequence

When introducing sequences to students, the first skill we teach them is how to predict the next term of a sequence given the first few terms, usually the first three, four or five terms. In this note, we intend to show...

 SOME RESULTS ON KRONECKER PRODUCT OF TWO GRAPHS

 We consider product graphs and recall the results associated to the product graphs. Paul M.Weichsel [3] defined the Kronecker product of graphs. He has proved a characterization for the product graphs to be connect...

Weak Reciprocally Continuity and Common Fixed Point Theorem in Complete Intuitionistic Fuzzy Metric Spaces

In this paper, we define the new concept of reciprocally and weak reciprocally continuity in complete intuitionistic fuzzy metric spaces and prove a common fixed point theorem for self mappings in intuitionistic fuzzy me...

On Soft Čech Closure Spaces

The purpose of the present paper is to introduce the basic notions of Soft Čech closure spaces and investigate some separation axioms in Soft Čech closure spaces.

On Some Generalized Well Known Results of Fixed Point Theorems of T- Contraction Mappings in Cone Metric Spaces

In this paper, we obtain sufficient conditions for the existence of a common fixed point of T- Contraction mapping in the setting on complete cone metric spaces. Our results generalized well known recent result of Garg a...

Download PDF file
  • EP ID EP161625
  • DOI -
  • Views 69
  • Downloads 0

How To Cite

G. Uma Sankar1, Dr. D. Saravanan (2012).  Single Objective Evolutionary Algorithm for Job Shop Scheduling Problem. INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY, 3(1), 38-42. https://europub.co.uk/articles/-A-161625