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

 A Discrete Host Commensal Species with Limited Resources and Mortality Rate for the Commensal

 This paper deals with an investigation on a Discrete Host-Commensal species with limited resources and mortality rate for the commensal. The model comprises of a commensal (S1), host (S2) that would benefit S1, w...

g*-Closed Sets in Topological Spaces

In this paper we have introduced a new class of sets called g*-closed sets which is properly placed in between the class of closed sets and g-closed sets. As an application, we introduce three new spaces namely, Tg*,gTg*...

Common Fixed Points for Generalized Weakly Contractive Mappings in G-Metric Spaces

The existence of points of coincidence and common fixed points for a pair of self mappings satisfying generalized weakly contractive conditions in -metric spaces is proved. Our results are generalization and extension of...

Numerical Analysis of the Fuzzy Integro-Differential Equations using Single-Term Haar Wavelet Series

This paper presents numerical analysis of the fuzzy integro-differential equations (FIDE) using Single Term Haar Wavelet Series (STHWS) method [6-9] is considered. The obtained discrete solutions using STHWS are compared...

On Edge Pair Sum Labeling of Graphs

An injective map f : E(G) → {±1,±2,…,±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f^*:V(G)→Z-{0} defined by f^* (v)=∑_(e∊E_v)▒f(e) is one – one, where E_v denotes the set...

Download PDF file
  • EP ID EP161625
  • DOI -
  • Views 72
  • 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