Track: Operations Research

Abstract

This paper focuses on the problems faced during scheduling of large job shops (manufacturing units) to sequence their jobs on machines available in the such a way that results in all processes completed in minimum time. There are already different methods available to do sequencing of this kind of problems. Branch and Bound method (BB), Timed Petri net (TPN) models for sequencing are two methods which are considered as standard methods to solve any scheduling problems and to get an optimum answer. In above-mentioned methods, there are some limitations and due to these limitations these methods sometimes do not lead to optimum make span or take large computational time. In this paper, we have proposed a new sequencing approach which can easily solve problems for same flow for the path of operation of M jobs and N machines. It also removes limitations of Branch and Bound method and takes lesser time than Timed Petri net models for sequencing of jobs.