Dynamic job shop scheduling problem DJSSP is extensively studied using different methods, but so far no one method has been proved to be the best in dealing such problems. Several dispatching rules are developed and applied in the job shops to address this issue. Development of these dispatching rules is based on heuristics; and hence heuristics are useful in specific situations and performance measures. The present work focuses on developing new robust dispatching rules using heuristic-search techniques so that we can apply them to a larger spectrum of job shop environment and performance measures. A comparison of the developed dispatching rules and due-date setting methods with the existing ones in the dynamic job shop environment is also provided in the work.

The work also focuses on static job shop scheduling problem for finding the lower bounds for makespan and total flow time minimization problem for standard benchmark problems using Lagrangian relaxation.