A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown

Zhe Cui and Xingsheng Gu

Mathematical Problems in Engineering, 2014, vol. 2014, 1-11

Abstract:

The scheduling problems have been discussed in the literature extensively under the assumption that the machines are permanently available without any breakdown. However, in the real manufacturing environments, the machines could be unavailable inevitably for many reasons. In this paper, the authors introduce the hybrid flowshop scheduling problem with random breakdown (RBHFS) together with a discrete group search optimizer algorithm (DGSO). In particular, two different working cases, preempt-resume case, and preempt-repeat case are considered under random breakdown. The proposed DGSO algorithm adopts the vector representation and several discrete operators, such as insert, swap, differential evolution, destruction, and construction in the producers, scroungers, and rangers phases. In addition, an orthogonal test is applied to configure the adjustable parameters in the DGSO algorithm. The computational results in both cases indicate that the proposed algorithm significantly improves the performances compared with other high performing algorithms in the literature.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/621393.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/621393.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:jnlmpe:621393

DOI: 10.1155/2014/621393

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().