An effective algorithm based on GENET neural network model for job shop scheduling with release dates and due dates

Authors:
Xin Feng;Hofung Leung;Lixin Tang
Affiliations:
Department of Systems Engineering, Northeastern University, Shenyang, China;Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, China;Department of Systems Engineering, Northeastern University, Shenyang, China
Venue:
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Year:
2005

Citing 4
Cited 0

GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Generating Experimental Data for Computational Testing with Machine Scheduling Applications

Operations Research
Progressive Stochastic Search for Solving Constraint Satisfaction Problems

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
A note on the SPT heuristic for solving scheduling problems with generalized due dates

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The job shop scheduling with release dates and due dates is considered. An effective algorithm based on GENET neural network model is presented for solving this type of problem. Two heuristics are embedded into the progressive stochastic search scheme in GENET network for the objective of minimizing the weighted number of tardy jobs. Experimental results indicate that the presented algorithm is competent to attain significant reductions in number of tardy jobs in relation to priority heuristic algorithms.