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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 7 users not shown)
Property / author
 
Property / author: Ren Qing-dao-er-ji / rank
Normal rank
 
Property / author
 
Property / author: Ren Qing-dao-er-ji / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59031835 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/976065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089148332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search method for optimal control of a flow shop system of traditional machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria scheduling with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact parallel method for a bi-objective permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective Flow Shop Scheduling Using Differential Evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: New multi-objective method to solve reentrant hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new hybrid genetic algorithm for job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:57, 9 July 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
    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
    0 references
    0 references
    0 references