Please use this identifier to cite or link to this item:
Full metadata record
|dc.guide||Gaindhar, J. N.||-|
|dc.description.abstract||Planning of every day work in a production shop to fix the sequence of work with respect to time is the most commonly used tool to get a maximum production rate with largest profit. Thus to achieve more output, the produ& tion time for a job should be reduced. All other condi- tions remaining same, this can be achieved through optimal scheduling. A schedule can be made in a number of ways depending upon different criteria for the selection of scheduling p±ocess. The work presented in this dissertation deals with determining a method of scheduling with the criterion to achieve 'no-wwaiting in process' for all the jobs with minis' mum possible completion time for all the jobs, This trite* cion ensured that in-process inventory is not developed on the shop floor. A better efficiency of work was achieved. it involves extensive mathematical calculations, hence computer programs were developed to more the tedious calcu lation work easy and get resulta in a very short time. The program can tackle any production situation, although it was verified for only one particular shop at BHE1 Iardwar. The algorithm developed w4s shown to result in many improvements in waiting of jobs, completion time of Jobs, machine utili- zation, space utilization etc.||en_US|
|dc.subject||MECHANICAL & INDUSTRIAL ENGINEERING||en_US|
|dc.title||JOB-SHOP SCHEDULING WITH NO-WAIT IN PROCESS||en_US|
|Appears in Collections:||MASTERS' DISSERTATIONS (MIED)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.