Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q59031835, #quickstatements; #temporary_batch_1710289860281
Property / Wikidata QID
 
Property / Wikidata QID: Q59031835 / rank
 
Normal rank

Revision as of 01:33, 13 March 2024

scientific article
Language Label Description Also known as
English
Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
scientific article

    Statements

    Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (English)
    0 references
    0 references
    0 references
    24 November 2014
    0 references
    Summary: 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.
    0 references

    Identifiers