Inventory Based Bi-Objective Flow Shop Scheduling Model and Its Hybrid Genetic Algorithm

Ren Qing-dao-er-ji and Yuping Wang

Mathematical Problems in Engineering, 2013, vol. 2013, 1-7

Abstract:

Flow shop scheduling problem is a typical NP-hard problem, and the researchers have established many different multi-objective models for this problem, but none of these models have taken the inventory capacity into account. In this paper, an inventory based bi-objective flow shop scheduling model was proposed, in which both the total completion time and the inventory capacity were as objectives to be optimized simultaneously. To solve the proposed model more effectively, we used a tailor-made crossover operator, and mutation operator, and designed a new local search operator, which can improve the local search ability of GA greatly. Based on all these, a hybrid genetic algorithm was proposed. The computer simulations were made on a set of benchmark problems, and the results indicated the effectiveness of the proposed algorithm.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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

DOI: 10.1155/2013/976065

Access Statistics for this article

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