Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/4512
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kavitha, K | - |
dc.contributor.author | Babitha, T | - |
dc.date.accessioned | 2023-11-25T07:54:40Z | - |
dc.date.available | 2023-11-25T07:54:40Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 1857-8438 | - |
dc.identifier.uri | https://www.research-publication.com/amsj/uploads/papers/vol-09/iss-11/AMSJ-2020-N11-104.pdf | - |
dc.description.abstract | In 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.iso | en_US | en_US |
dc.publisher | Advances in Mathematics: Scientific Journal | en_US |
dc.title | AN APPROACH FOR JOB SHOP SCHEDULING USING PETRI NETS | en_US |
dc.type | Article | en_US |
Appears in Collections: | 2.Article (63) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
AN APPROACH FOR JOB SHOP SCHEDULING USING PETRI NETS.pdf | 872.91 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.