A neural network and heuristics hybrid strategy for job-shop scheduling problem

dc.cclicenceN/Aen
dc.contributor.authorYang, Shengxiang
dc.contributor.authorWang, Dingwei
dc.date.acceptance1998-09
dc.date.accessioned2020-05-19T14:14:21Z
dc.date.available2020-05-19T14:14:21Z
dc.date.issued1999-06
dc.descriptionThe file attached to this record is the author's final peer reviewed version.en
dc.description.abstractA new efficient neural network and heuristics hybrid strategy for job-shop scheduling is presented. The neural network has the property of adapting its connection weights and biases of neural units while solving feasible solution. Heuristics are used to accelerate the solving process of neural network and guarantee its convergence, and to obtain non-schedule schedule from solved feasible solution by neural network with orders of operations determined and unchanged. Computer simulations have shown that the proposed hybrid strategy is of high speed and excellent efficiency.en
dc.funderOther external funder (please detail below)en
dc.funder.otherNational Natural Science Foundation of Chinaen
dc.identifier.citationYang, S. and Wang, D. (1999) A neural network and heuristics hybrid strategy for job-shop scheduling problem. Journal of Systems Engineering, 14(2), pp.140-144.en
dc.identifier.urihttps://dora.dmu.ac.uk/handle/2086/19616
dc.language.isozhen
dc.peerreviewedYesen
dc.projectid69684005en
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en
dc.subjectJob-shop schedulingen
dc.subjectNeural networken
dc.subjectHeuristicsen
dc.subjectHybrid strategyen
dc.titleA neural network and heuristics hybrid strategy for job-shop scheduling problemen
dc.typeArticleen

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
SEXB98.pdf
Size:
456.42 KB
Format:
Adobe Portable Document Format
Description:
Main article
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.2 KB
Format:
Item-specific license agreed upon to submission
Description: