Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/4512
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKavitha, K-
dc.contributor.authorBabitha, T-
dc.date.accessioned2023-11-25T07:54:40Z-
dc.date.available2023-11-25T07:54:40Z-
dc.date.issued2020-
dc.identifier.issn1857-8438-
dc.identifier.urihttps://www.research-publication.com/amsj/uploads/papers/vol-09/iss-11/AMSJ-2020-N11-104.pdf-
dc.description.abstractIn this work, Petri Net-based united approach, for instantaneously modelling and scheduling industrial systems, is offered. A model that explain the implementation of the sequencing in single, multiple workstation, and “implements priority dispatching rules” to solve the ultimate conflicts, arediscussed. The proposed model was tested by taking a firm environment example that has flexible job shop-type system. proposed RKmax Algorithm has been experimented for solving sequence problems and compared the result of proposed method with the result of existing methods.en_US
dc.language.isoen_USen_US
dc.publisherAdvances in Mathematics: Scientific Journalen_US
dc.titleAN APPROACH FOR JOB SHOP SCHEDULING USING PETRI NETSen_US
dc.typeArticleen_US
Appears in Collections:2.Article (63)

Files in This Item:
File Description SizeFormat 
AN APPROACH FOR JOB SHOP SCHEDULING USING PETRI NETS.pdf872.91 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.