Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A hybrid GA-PSO algorithm for seru scheduling problem with dynamic resource allocation

A hybrid GA-PSO algorithm for seru scheduling problem with dynamic resource allocation As a new type flexible production mode, seru production is widely used in Japanese enterprises to deal with the manufacturing market with volatile and diversified demand. In practical seru production, product processing time may be related to resource allocation, i.e., more resource allocation, less processing time. Thus, this paper attempts to solve seru scheduling problems with dynamic resource allocation, along with which the learning effect of workers is also considered. A combinatorial optimisation model is proposed to minimise the makespan, and a hybrid GA-PSO algorithm with nonlinear inertia weight is specifically designed to solve the proposed model. Finally, a numerical example is presented to verify the effectiveness of hybrid algorithm. The computational results indicate that hybrid GA-PSO algorithm is efficient, and dynamic resource allocation should be considered in seru scheduling problems. [Submitted 1 February 2021; Accepted 30 April 2021] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Manufacturing Research Inderscience Publishers

A hybrid GA-PSO algorithm for seru scheduling problem with dynamic resource allocation

Loading next page...
 
/lp/inderscience-publishers/a-hybrid-ga-pso-algorithm-for-seru-scheduling-problem-with-dynamic-LGcuhiX07K
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1750-0591
eISSN
1750-0605
DOI
10.1504/ijmr.2023.129301
Publisher site
See Article on Publisher Site

Abstract

As a new type flexible production mode, seru production is widely used in Japanese enterprises to deal with the manufacturing market with volatile and diversified demand. In practical seru production, product processing time may be related to resource allocation, i.e., more resource allocation, less processing time. Thus, this paper attempts to solve seru scheduling problems with dynamic resource allocation, along with which the learning effect of workers is also considered. A combinatorial optimisation model is proposed to minimise the makespan, and a hybrid GA-PSO algorithm with nonlinear inertia weight is specifically designed to solve the proposed model. Finally, a numerical example is presented to verify the effectiveness of hybrid algorithm. The computational results indicate that hybrid GA-PSO algorithm is efficient, and dynamic resource allocation should be considered in seru scheduling problems. [Submitted 1 February 2021; Accepted 30 April 2021]

Journal

International Journal of Manufacturing ResearchInderscience Publishers

Published: Jan 1, 2023

There are no references for this article.