Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm

DOI10.1155/2013/976065MaRDI QIDQ474788zbMATH OpenOpenAlexWikidataFDO

Authors Yuping Wang, Ren Qing-dao-er-ji

Publication date 24 November 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/976065

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Deterministic scheduling theory in operations research (90B35)

Review text

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.

Recommendations

• Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm
• A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• A genetic algorithm for flowshop scheduling with multiple objectives
• Genetic algorithms for the two-stage bicriteria flowshop problem

Cites work

• A bicriteria scheduling with sequence-dependent setup times
• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
• A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
• A genetic algorithm for flowshop sequencing
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• A new hybrid genetic algorithm for job shop scheduling problem
• A search method for optimal control of a flow shop system of traditional machines
• An exact parallel method for a bi-objective permutation flowshop problem
• Applying tabu search to the job-shop scheduling problem
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• Multi-objective flow shop scheduling using differential evolution
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Optimal two- and three-stage production schedules with set-up time included

Cited in

(4)

• Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost
• Cultural-based genetic tabu algorithm for multiobjective job shop scheduling
• Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm
• Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm

This page was built for publication: Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474788)