Genetic Neuro-scheduler For Job Shop Scheduling

Abstract

This paper describes a hybrid approach between two new techniques, Genetic Algorithms and Artificial Neural Networks, for generating Job Shop Schedules (JSS) in a discrete manufacturing environment based on non-linear multi-criteria objective function. Genetic Algorithm (GA) is used as a search technique for an optimal schedule via a uniform randomly generated population of gene strings which represent alternative feasible schedules. GA propagates this specific gene population through a number of cycles or generations by implementing natural genetic mechanism (i.e. reproduction operator and crossover operator). It is important to design an appropriate format of genes for JSS problems. Specifically, gene strings should have a structure that imposes the most common restrictive constraint; a precedence constraint. The other is an Artificial Neural Network, which uses its highly connected-neuron network to perform as a multi-criteria evaluator. The basic idea is a neural network evaluator which maps a complex set of scheduling criteria (i.e. flowtime, lateness) to evaluate values provided by experienced experts. Once, the network is fully trained, it will be used as an evaluator to access the fitness or performance of those stimulated gene strings. The proposed approach was prototyped and implemented on JSS problems based on different model sizes; namely small, medium, and large. The results are compared to the Shortest Proceesing Time heuristic used extensively in industry. © 1993.

Department(s)

Engineering Management and Systems Engineering

International Standard Serial Number (ISSN)

0360-8352

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2023 Elsevier, All rights reserved.

Publication Date

01 Jan 1993

Link to Full Text

Share

 
COinS