DSpace Repository

Dispatching Rules for the Job shop scheduling

Show simple item record

dc.contributor.author Kagthara, M.
dc.contributor.author Bhatt, M.
dc.date.accessioned 2023-05-24T07:21:30Z
dc.date.available 2023-05-24T07:21:30Z
dc.date.issued 2016
dc.identifier.citation Kagthara MS, Bhatt MG. Dispatching Rules for the Job shop scheduling. International Journal of Darshan Institute on Engineering Research & Emerging Technologies, Vol. 5, No. 2, 2016 , pp. 64-68, en_US
dc.identifier.issn 2583-3863
dc.identifier.uri http://10.9.150.37:8080/dspace//handle/atmiyauni/1082
dc.description.abstract Dispatching rules are widely accepted in the industry because of the ease of implementation, satisfactory performance, Low computation requirement, and flexibility to incorporate domain knowledge and expertise. Dispatching Rules have been reviewed and Case study Problem is solved using different Dispatching Rules in this paper. en_US
dc.language.iso en en_US
dc.publisher International Journal of Darshan Institute on Engineering Research & Emerging Technologies en_US
dc.subject Dispatching rule en_US
dc.subject Job shop en_US
dc.subject Flow shope en_US
dc.subject Tardiness en_US
dc.subject Makespan en_US
dc.title Dispatching Rules for the Job shop scheduling en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account