A Hybrid Algorithm for the Permutation Flowshop Scheduling Problem without Intermediate Buffers

Xiaobo Liu, Kun Li and Huizhi Ren

Discrete Dynamics in Nature and Society, 2015, vol. 2015, 1-6

Abstract:

This paper deals with the permutation flowshop scheduling problem without intermediate buffers and presents a hybrid algorithm based on the scatter search and the variable neighborhood search. In the hybrid algorithm, the solutions with good quality and diversity are maintained by a reference set of scatter search, and the search at each generation starts from a solution generated from the reference set so as to improve the search diversity while guaranteeing the quality of the initial solution. In addition, a variable neighbourhood based on the notion of job-block is developed, and the neighbourhood size can adaptively change according to the construction of the job-block. Such a dynamic strategy can help to obtain a balance between search depth and diversity. Extensive experiments on benchmark problems are carried out and the results show that the proposed hybrid algorithm is powerful and competitive with the other powerful algorithms in the literature.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2015/548363.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2015/548363.xml (text/xml)

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:hin:jnddns:548363

DOI: 10.1155/2015/548363

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().