Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1197.90191
Amiri, M.; Zandieh, M.; Yazdani, M.; Bagheri, A.
A variable neighbourhood search algorithm for the flexible job-shop scheduling problem. (English)
[J] Int. J. Prod. Res. 48, No. 19, 5671-5689 (2010). ISSN 0020-7543; ISSN 1366-588X/e

Summary: 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.

MSC 2000:: *90B35 Scheduling theory
90C27 Combinatorial programming

Keywords: flexible job-shop scheduling; variable neighbourhood search; makespan; combinatorial optimisation

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]