Authors: Imen Chaouch; Olfa Belkahla Driss; Khaled Ghedira
Addresses: SOIE-COSMOS Laboratory; Ecole Nationale des Sciences de l'Informatique, Université de la Manouba, Tunisia ' SOIE-COSMOS Laboratory; Ecole Supérieure de Commerce de Tunis, Université de la Manouba, Tunis, Tunisia ' SOIE-COSMOS Laboratory, Université de la Manouba, Tunisia; Institut Supérieur de Gestion de Tunis, Université de Tunis, Tunisia
Abstract: The distributed job shop scheduling problem (DJSP) deals with the assignment of jobs to factories geographically distributed and with determining a good operation schedule of each factory. It is one of the well-known NP-hard combinatorial optimisation problem to solve optimally. 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. In this paper, we first present an overview of pioneer studies conducted on solving distributed job shop scheduling problems and a classification of the employed techniques is given. Then, depth analysis of the outcome of existing literature is presented.
Keywords: distributed scheduling; job shop; flexible job shop; optimisation method; survey.
International Journal of Operational Research, 2020 Vol.38 No.2, pp.147 - 165
Received: 30 Dec 2016
Accepted: 23 Jul 2017
Published online: 30 Mar 2020 *