Job‐shop sequencing problems via network scheduling technique

Abstract

Examines a new approach to job‐shop sequencing problems. This is based on a network scheduling technique on the premiss of limited resource availability to achieve minimum total processing time. The method utilizes a resource allocation procedure based on random activity (job element) selection and the method of finding the optimal solution is that of selecting the trial run with the minimum time duration. With its random nature of selecting activities at the completion of one or more activities, the greater the number of trial runs, the greater the chances are of getting the exact solution which would have been derived had the more conventional mathematical techniques been used. Also aims to find solutions to the more practical job sequencing problems, which are difficult to solve using existing heuristics, mathematical methods and procedures. Highlights these practical examples in the different sections.