Job shop scheduling algorithms — A shift from traditional techniques to non-traditional techniques

The success of planning and operations phase essentially lies in efficient scheduling, and searching for the best scheduling algorithm in accordance with the problem in hand, is still a difficult task. Numerous job shop scheduling algorithms have been proposed and implemented, and each has its pros and cons. This review paper discusses the development of traditional and nontraditional Job Shop Scheduling Problem and also advancements in the development of methods to be used in solving the problem. It also classifies the JSSP, on the basis of the complexity of the solution. The survey provides an insight on the research carried out in this field.