Development of a generalized algorithm for solving job shop scheduling problems

Abstract

Two different scheduling algorithms have bee"n developed to generate feasible schedules by Monte-Carlo sampling procedure for a multi machines multiple facilities system by incorporating job priority criteria in two different concepts. The algorithms also incorporate provisions for machines/facilities that can handle more than one job at a time. The concept of left shifting and other biasing techniques have also been applied on the algorithms to improve the efficiency of sampling procedure. The relative advantages J and disa~vantages of different biasing techniques have been explored. The algorithms have been evaluated with respect to different parameter~ related to the distribution of schedule times by using three parameter Weibull distribution function. The algorithms can be applied to special types "of transportation problems by using the concept of commonplace facilities.