A review of job shop scheduling problems in multi-factories

Imen Chaouch, Olfa Belkahla Driss and Khaled Ghedira

International Journal of Operational Research, 2020, vol. 38, issue 2, 147-165

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. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=107068 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:38:y:2020:i:2:p:147-165

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().