A Survey of Optimization Techniques for Distributed Job Shop Scheduling Problems in Multi-factories

Distributed Job shop Scheduling Problem is one of the well-known hardest combinatorial optimization problems. In the last two decades, the problem has captured the interest of a number of researchers and therefore various methods have been employed to study this problem. The scope of this paper is to give an overview of pioneer studies conducted on solving Distributed Job shop Scheduling Problem using different techniques and aiming to reach a specified objective function. Resolution approaches used to solve the problem are reviewed and a classification of the employed techniques is given.