Yayın:
Artificial Neural Networks for Finite Capacity Scheduling: A Comparative Study

Basit öğe sayfası
dc.contributor.authorGuneri, Ali Fuat
dc.contributor.authorGumus, Alev Taskin
dc.contributor.institutionauthorTAŞKIN, Alev
dc.date.accessioned2026-06-27T13:08:16Z
dc.date.issued2008
dc.description.abstractIn this study artificial neural networks are applied for finite capacity scheduling. Utilisation of artificial neural networks on solving finite scheduling problems is examined. Also a comparative model is proposed by using multi layer perceptron (MLP) neural networks and branch-and-bound algorithm, and carried out to solve a real world problem in a job shop scheduling system. Significance: The usage of artificial neural networks and branch-and-bound algorithm in finite scheduling is examined, and a comparative study is presented in this paper.en
dc.identifier.eissn1943-670X
dc.identifier.endpage359
dc.identifier.issn1072-4761
dc.identifier.issue4
dc.identifier.startpage349
dc.identifier.urihttps://hdl.handle.net/20.500.14981/50245
dc.identifier.volume15
dc.identifier.wos000207714000003
dc.language.isoeng
dc.publisherUNIV CINCINNATI INDUSTRIAL ENGINEERING
dc.relation.ispartofINTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE
dc.subjectFinite capacity scheduling
dc.subjectArtificial neural networks
dc.subjectBranch-and-bound algorithm
dc.subjectBOUND ALGORITHM
dc.subjectAPPROXIMATION
dc.subjectEngineering
dc.titleArtificial Neural Networks for Finite Capacity Scheduling: A Comparative Study
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar