Journal
CYBERNETICS AND MATHEMATICS APPLICATIONS IN INTELLIGENT SYSTEMS, CSOC2017, VOL 2
Volume 574, Issue -, Pages 369-378Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-319-57264-2_38
Keywords
Distributed scheduling; Job shop; Optimization method; Survey
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available