A variable neighbourhood search algorithm for the flexible job-shop scheduling problem

作者：Amiri M; Zandieh M^*; Yazdani M; Bagheri A

来源：International Journal of Production Research, 2010, 48(19): 5671-5689.

DOI：10.1080/00207540903055743

• flexible job-shop scheduling
• variable neighbourhood search
• makespan
• combinatorial optimisation

The flexible job-shop scheduling problem (FJSP) is a generalisation of the classical job-shop scheduling problem which allows an operation of each job to be executed by any machine out of a set of available machines. FJSP consists of two sub-problems which are assigning each operation to a machine out of a set of capable machines (routing sub-problem) and sequencing the assigned operations on the machines (sequencing sub-problem). This paper proposes a variable neighbourhood search (VNS) algorithm that solves the FJSP to minimise makespan. In the process of the presented algorithm, various neighbourhood structures related to assignment and sequencing problems are used for generating neighbouring solutions. To compare our algorithm with previous ones, an extensive computational study on 181 benchmark problems has been conducted. The results obtained from the presented algorithm are quite comparable to those obtained by the best-known algorithms for FJSP.

• 出版日期2010