Analyzing job shop scheduling problem by using dispatching rules


Job shop scheduling is one of the most typical and complicated manufacturing environments in production scheduling problems. As a result of this complexity, Akaki spare parts share company (ASPSC) has faced problem of scheduling jobs in the machining shop, therefore as to reduce the make span of the jobs in the machining shop, the aim of the research paper is to assess scheduling job shop sequencing of jobs in the machining shop by using dispatching rule, so as to minimize the total make span of the jobs. Secondary data of five jobs that processed on six machines in the machining shop was collected from the production planning and control system unit catalog. By using lekin scheduling software we can obtain the result using alternative dispatching rules based on processing time of each jobs. From these result the longest processing time can give the best possible make span which is 1426 minute relative to shortest processing time and first come first serve rule

This article is published in peer review journal and open access journal, International journal of research in engineering and innovation (IJREI) which have a high impact factor journal for more details regarding this article, please go through our journal website.






download PDF
Share on Google Plus

About Editor IJREI

0 comments:

Post a Comment