Admissions Open
Admissions Open
Scheduling plays an important role in production management. It is helpful in improving the quality and increasing the rate of production, fulfilling the customer demands in time, to minimize the flow time or production cost etc. In flow shop scheduling the emphasis is on minimization of elapsed time but minimization of elapsed time may not always lead to minimization of utilization time. This paper provides a simple heuristic algorithm to optimize the utilization time of machines for specially structured n-job and 2-machine flow shop scheduling problem with jobs in a string of disjoint job blocks including job weightage and transportation time. An algorithm has been developed to minimize the utilization time of machines and is validated with the help of numerical examples. Keywords: Disjoint Job Blocks, Jobs in a String, Specially Structured Flow Shop Scheduling, Transportation time, Weightage of jobs, Utilization Time.